<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE root>
<article 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" xmlns:ali="http://www.niso.org/schemas/ali/1.0/" article-type="research-article" dtd-version="1.2" xml:lang="en"><front><journal-meta><journal-id journal-id-type="publisher-id">Last Mile</journal-id><journal-title-group><journal-title xml:lang="en">Last Mile</journal-title><trans-title-group xml:lang="ru"><trans-title>Первая миля</trans-title></trans-title-group></journal-title-group><issn publication-format="print">2070-8963</issn><publisher><publisher-name xml:lang="en">Technosphera JSC</publisher-name></publisher></journal-meta><article-meta><article-id pub-id-type="publisher-id">678864</article-id><article-id pub-id-type="doi">10.22184/2070-8963.2025.125.1.64.69</article-id><article-categories><subj-group subj-group-type="toc-heading"><subject>СЕТЕВАЯ ИНФРАСТРУКТУРА</subject></subj-group><subj-group subj-group-type="article-type"><subject>Research Article</subject></subj-group></article-categories><title-group><article-title xml:lang="en">New class of codes with error localization and its noise immunity: the basic idea</article-title><trans-title-group xml:lang="ru"><trans-title>Новый класс кодов с локализацией ошибок и его помехоустойчивость: основная идея</trans-title></trans-title-group></title-group><contrib-group><contrib contrib-type="author"><name-alternatives><name xml:lang="en"><surname>Zyablov</surname><given-names>V. V.</given-names></name><name xml:lang="ru"><surname>Зяблов</surname><given-names>В. В.</given-names></name></name-alternatives><address><country country="RU">Russian Federation</country></address><bio xml:lang="ru"><p>д.т.н., главный научный сотрудник</p></bio><email>zyablov@iitp.ru</email><xref ref-type="aff" rid="aff1"/></contrib><contrib contrib-type="author"><name-alternatives><name xml:lang="en"><surname>Portnoy</surname><given-names>S. L.</given-names></name><name xml:lang="ru"><surname>Портной</surname><given-names>С. Л.</given-names></name></name-alternatives><address><country country="RU">Russian Federation</country></address><bio xml:lang="ru"><p>д.т.н., проф. Московского института электроники и математики им. А. Н.Тихонова</p></bio><email>sportnoy@hse.ru</email><xref ref-type="aff" rid="aff2"/></contrib><contrib contrib-type="author"><name-alternatives><name xml:lang="en"><surname>Nikitin</surname><given-names>S. E.</given-names></name><name xml:lang="ru"><surname>Никитин</surname><given-names>С. Е.</given-names></name></name-alternatives><address><country country="RU">Russian Federation</country></address><bio xml:lang="ru"><p>ст. преподаватель</p></bio><email>snikitin@hse.ru</email><xref ref-type="aff" rid="aff3"/></contrib><contrib contrib-type="author"><name-alternatives><name xml:lang="en"><surname>Voloshin</surname><given-names>A. D.</given-names></name><name xml:lang="ru"><surname>Волошин</surname><given-names>А. Д.</given-names></name></name-alternatives><address><country country="RU">Russian Federation</country></address><bio xml:lang="ru"><p>магистрант</p></bio><email>advoloshin@edu.hse.ru</email><xref ref-type="aff" rid="aff3"/></contrib><contrib contrib-type="author"><name-alternatives><name xml:lang="en"><surname>Klyuev</surname><given-names>N. S.</given-names></name><name xml:lang="ru"><surname>Клюев</surname><given-names>Н. С.</given-names></name></name-alternatives><address><country country="RU">Russian Federation</country></address><bio xml:lang="ru"><p>магистрант</p></bio><email>nsklyuev@edu.hse.ru</email><xref ref-type="aff" rid="aff3"/></contrib></contrib-group><aff-alternatives id="aff1"><aff><institution xml:lang="en"></institution></aff><aff><institution xml:lang="ru">ИППИ РАН им А.А. Харкевича</institution></aff></aff-alternatives><aff-alternatives id="aff2"><aff><institution xml:lang="en"></institution></aff><aff><institution xml:lang="ru">НИУ ВШЭ</institution></aff></aff-alternatives><aff-alternatives id="aff3"><aff><institution xml:lang="en"></institution></aff><aff><institution xml:lang="ru">МИЭМ НИУ ВШЭ</institution></aff></aff-alternatives><pub-date date-type="pub" iso-8601-date="2025-04-24" publication-format="electronic"><day>24</day><month>04</month><year>2025</year></pub-date><issue>1</issue><issue-title xml:lang="en"/><issue-title xml:lang="ru"/><fpage>64</fpage><lpage>69</lpage><history><date date-type="received" iso-8601-date="2025-04-24"><day>24</day><month>04</month><year>2025</year></date><date date-type="accepted" iso-8601-date="2025-04-24"><day>24</day><month>04</month><year>2025</year></date></history><permissions><copyright-statement xml:lang="en">Copyright ©; 2025, Zyablov V.V., Portnoy S.L., Nikitin S.E., Voloshin A.D., Klyuev N.S.</copyright-statement><copyright-statement xml:lang="ru">Copyright ©; 2025, Зяблов В.В., Портной С.Л., Никитин С.Е., Волошин А.Д., Клюев Н.С.</copyright-statement><copyright-year>2025</copyright-year><copyright-holder xml:lang="en">Zyablov V.V., Portnoy S.L., Nikitin S.E., Voloshin A.D., Klyuev N.S.</copyright-holder><copyright-holder xml:lang="ru">Зяблов В.В., Портной С.Л., Никитин С.Е., Волошин А.Д., Клюев Н.С.</copyright-holder></permissions><self-uri xlink:href="https://journals.eco-vector.com/2070-8963/article/view/678864">https://journals.eco-vector.com/2070-8963/article/view/678864</self-uri><abstract xml:lang="en"><p>The possibility of rethinking the established code constructions is considered. The new modification of traditional cascade and generalized cascade codes is offered, that in turn creates essentially new family of codes and opens prospects for development of new decoding algorithms. Three examples of development of codes with error localization and results of their modelling are resulted. Directions of the further researches of new classes of codes are described.</p></abstract><trans-abstract xml:lang="ru"><p>Рассматривается возможность переосмысления устоявшихся кодовых конструкций. Предлагается новая модификация традиционных каскадных и обобщенных каскадных кодов, что в свою очередь создает принципиально новое семейство кодов и открывает перспективы для разработки новых алгоритмов декодирования. Приведены три примера построения кодов с локализацией ошибок и результаты их моделирования. Описаны направления дальнейших исследований новых классов кодов.</p></trans-abstract><kwd-group xml:lang="en"><kwd>noise-immune coding</kwd><kwd>cascade codes</kwd><kwd>Reed – Solomon code</kwd><kwd>codes with error localisation</kwd><kwd>cascading of codes with error localisation</kwd></kwd-group><kwd-group xml:lang="ru"><kwd>помехоустойчивое кодирование</kwd><kwd>каскадные коды</kwd><kwd>код Рида – Соломона</kwd><kwd>коды с локализацией ошибок</kwd><kwd>каскадирование кодов с локализацией ошибок</kwd></kwd-group><funding-group/></article-meta></front><body></body><back><ref-list><ref id="B1"><label>1.</label><mixed-citation>Shannon C.E. A mathematical theory of communication // The Bell System Technical Journal. 1948. Vol. 27. No. 3. PP. 379–423.</mixed-citation></ref><ref id="B2"><label>2.</label><mixed-citation>Hamming R.W. Error detecting and error correcting codes // The Bell System Technical Journal. 1950. Vol. 29. No. 2. PP. 147–160.</mixed-citation></ref><ref id="B3"><label>3.</label><mixed-citation>Elias P. Error-free Coding // Transactions of the IRE Professional Group on Information Theory. 1954. Vol. 4. No. 4. PP. 29–37.</mixed-citation></ref><ref id="B4"><label>4.</label><mixed-citation>Berrou C. et al. Near Shannon limit error-correcting coding and decoding: Turbo-codes // Proceedings of IEEE International Conference on Communications, Geneva, Switzerland. 1993. Vol. 2. PP. 1064–1070.</mixed-citation></ref><ref id="B5"><label>5.</label><mixed-citation>Галлагер Р. Теория информации и надежная связь. М.: Советское радио, 1974. 720 c.</mixed-citation></ref><ref id="B6"><label>6.</label><mixed-citation>Gallager R. Low-density parity-check codes // IRE Transactions on Information Theory. 1962. Vol. 8. No. 1. PP. 21–28.</mixed-citation></ref><ref id="B7"><label>7.</label><mixed-citation>Форни Д. Каскадные коды. М.: Наука, 1970. 207 c.</mixed-citation></ref><ref id="B8"><label>8.</label><mixed-citation>Блох Э., Зяблов В. Обобщение каскадных кодов. М.: Связь, 1976. 240 c.</mixed-citation></ref><ref id="B9"><label>9.</label><mixed-citation>Гинзбург В.В. Многомерные сигналы для непрерывного канала // Проблемы передачи информации. 1984. Т. 20. № 1. С. 28–46.</mixed-citation></ref><ref id="B10"><label>10.</label><mixed-citation>Ungerboeck G. Trellis-coded modulation with redundant signal sets. Part I: introduction // IEEE Communications Magazine. 1987. Vol. 25. No. 2. PP. 5–11.</mixed-citation></ref><ref id="B11"><label>11.</label><mixed-citation>Зяблов В.В. и др. Высокоскоростная передача сообщений в реальных каналах. М.: Радио и связь, 1991. 287 c.</mixed-citation></ref><ref id="B12"><label>12.</label><mixed-citation>Arıkan E. Channel polarization: A method for constructing capacity achieving codes for symmetric binary-input memoryless channels // IEEE Transactions on Information Theory. 2009. Vol. 55. No. 7. PP. 3051–3073.</mixed-citation></ref><ref id="B13"><label>13.</label><mixed-citation>PP TS 38.212. Multiplexing and channel coding (Release 18). 2023.</mixed-citation></ref></ref-list></back></article>
