<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Publishing DTD v1.3 20210610//EN" "JATS-journalpublishing1-3.dtd">
<article article-type="research-article" dtd-version="1.3" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xml:lang="ru"><front><journal-meta><journal-id journal-id-type="publisher-id">bsuir</journal-id><journal-title-group><journal-title xml:lang="ru">Доклады БГУИР</journal-title><trans-title-group xml:lang="en"><trans-title>Doklady BGUIR</trans-title></trans-title-group></journal-title-group><issn pub-type="ppub">1729-7648</issn><issn pub-type="epub">2708-0382</issn><publisher><publisher-name>БГУИР</publisher-name></publisher></journal-meta><article-meta><article-id custom-type="elpub" pub-id-type="custom">bsuir-335</article-id><article-categories><subj-group subj-group-type="heading"><subject>Research Article</subject></subj-group><subj-group subj-group-type="section-heading" xml:lang="ru"><subject>Статьи</subject></subj-group></article-categories><title-group><article-title>СРАВНИТЕЛЬНЫЙ АНАЛИЗ ВЕРОЯТНОСТИ ОШИБОК ДЕКОДИРОВАНИЯ КОДОВЫХ КОНСТРУКЦИЙ RIJNDAEL И БЧХ</article-title><trans-title-group xml:lang="en"><trans-title>ANALYSIS OF DECODERS BIT ERROR FOR RIJNDAEL And BCH codes</trans-title></trans-title-group></title-group><contrib-group><contrib contrib-type="author" corresp="yes"><name-alternatives><name name-style="eastern" xml:lang="ru"><surname>Бильдюк</surname><given-names>Д. М.</given-names></name><name name-style="western" xml:lang="en"><surname>Bildziuk</surname><given-names>D. M.</given-names></name></name-alternatives><email xlink:type="simple">noemail@neicon.ru</email><xref ref-type="aff" rid="aff-1"/></contrib><contrib contrib-type="author" corresp="yes"><name-alternatives><name name-style="eastern" xml:lang="ru"><surname>Саломатин</surname><given-names>С. Б.</given-names></name><name name-style="western" xml:lang="en"><surname>Salomatin</surname><given-names>S. B.</given-names></name></name-alternatives><email xlink:type="simple">noemail@neicon.ru</email><xref ref-type="aff" rid="aff-1"/></contrib></contrib-group><aff xml:lang="ru" id="aff-1"><institution>Белорусский государственный университет информатики и радиоэлектроники</institution><country>Belarus</country></aff><pub-date pub-type="collection"><year>2014</year></pub-date><pub-date pub-type="epub"><day>03</day><month>06</month><year>2019</year></pub-date><volume>0</volume><issue>5</issue><fpage>17</fpage><lpage>23</lpage><permissions><copyright-statement>Copyright &amp;#x00A9; Бильдюк Д.М., Саломатин С.Б., 2019</copyright-statement><copyright-year>2019</copyright-year><copyright-holder xml:lang="ru">Бильдюк Д.М., Саломатин С.Б.</copyright-holder><copyright-holder xml:lang="en">Bildziuk D.M., Salomatin S.B.</copyright-holder><license xml:lang="ru" license-type="creative-commons-attribution" xlink:href="https://creativecommons.org/licenses/by/4.0/" xlink:type="simple"><license-p>Данная работа распространяется под лицензией Creative Commons Attribution 4.0.</license-p></license><license xml:lang="en" license-type="creative-commons-attribution" xlink:href="https://creativecommons.org/licenses/by/4.0/" xlink:type="simple"><license-p>This work is licensed under a Creative Commons Attribution 4.0 License.</license-p></license></permissions><self-uri xlink:href="https://doklady.bsuir.by/jour/article/view/335">https://doklady.bsuir.by/jour/article/view/335</self-uri><abstract><p>Рассматривается нелинейный помехоустойчивый код на базе алгоритма криптографического преобразования данных Rijndael . Произведен сравнительный анализ декодирования кодов Rijndael и БЧХ.</p></abstract><trans-abstract xml:lang="en"><p>The nonlinear error control code on the basis of cryptographic transformation of data through Rijndael algorithm is considered. Bit error properties of decoding algorithms of Rijndael codes and BCH codes for AWGN channel are compared.</p></trans-abstract><kwd-group xml:lang="ru"><kwd>криптографическое преобразование данных</kwd><kwd>помехоустойчивое кодирование</kwd><kwd>алгоритм Rijndael</kwd><kwd>границы помехоустойчивого кодирования</kwd><kwd>нелинейный код</kwd></kwd-group></article-meta></front><back><ref-list><title>References</title><ref id="cit1"><label>1</label><citation-alternatives><mixed-citation xml:lang="ru">Бильдюк Д.М., Саломатин С.Б. // Докл. БГУИР. 2012. № 8 (70). С. 75-80.</mixed-citation><mixed-citation xml:lang="en">Бильдюк Д.М., Саломатин С.Б. // Докл. БГУИР. 2012. № 8 (70). С. 75-80.</mixed-citation></citation-alternatives></ref><ref id="cit2"><label>2</label><citation-alternatives><mixed-citation xml:lang="ru">Бильдюк Д.М., Саломатин С.Б. // Докл. БГУИР. 2012. № 7 (63). С. 105-109.</mixed-citation><mixed-citation xml:lang="en">Бильдюк Д.М., Саломатин С.Б. // Докл. БГУИР. 2012. № 7 (63). С. 105-109.</mixed-citation></citation-alternatives></ref><ref id="cit3"><label>3</label><citation-alternatives><mixed-citation xml:lang="ru">Elumalai R., Reddy A.R. // Int. J. of Scientific Research. 2011. Vol. 2, Iss 3.</mixed-citation><mixed-citation xml:lang="en">Elumalai R., Reddy A.R. // Int. J. of Scientific Research. 2011. Vol. 2, Iss 3.</mixed-citation></citation-alternatives></ref><ref id="cit4"><label>4</label><citation-alternatives><mixed-citation xml:lang="ru">Фомичев В.М. Дискретная математика и криптология. М., 2003.</mixed-citation><mixed-citation xml:lang="en">Фомичев В.М. Дискретная математика и криптология. М., 2003.</mixed-citation></citation-alternatives></ref><ref id="cit5"><label>5</label><citation-alternatives><mixed-citation xml:lang="ru">MacWilliams F.J., Sloane N.J.A. The theory of error correcting codes. North-Holland, 1977.</mixed-citation><mixed-citation xml:lang="en">MacWilliams F.J., Sloane N.J.A. The theory of error correcting codes. North-Holland, 1977.</mixed-citation></citation-alternatives></ref><ref id="cit6"><label>6</label><citation-alternatives><mixed-citation xml:lang="ru">Peter Sweeney. Federal Information Processing Standards Publication 197. USA, 2001.</mixed-citation><mixed-citation xml:lang="en">Peter Sweeney. Federal Information Processing Standards Publication 197. USA, 2001.</mixed-citation></citation-alternatives></ref><ref id="cit7"><label>7</label><citation-alternatives><mixed-citation xml:lang="ru">Farber. R. CUDA Application Design and Development. MK, 2011.</mixed-citation><mixed-citation xml:lang="en">Farber. R. CUDA Application Design and Development. MK, 2011.</mixed-citation></citation-alternatives></ref></ref-list><fn-group><fn fn-type="conflict"><p>The authors declare that there are no conflicts of interest present.</p></fn></fn-group></back></article>
