Estimating the fraction of erasure patterns correctable by linear codes
- 作者: Afanassiev V.1, Davydov A.1, Zigangirov D.1
-
隶属关系:
- Kharkevich Institute for Information Transmission Problems
- 期: 卷 62, 编号 6 (2017)
- 页面: 669-685
- 栏目: Theory and Methods of Information Processing
- URL: https://journals.rcsi.science/1064-2269/article/view/198508
- DOI: https://doi.org/10.1134/S106422691706002X
- ID: 198508
如何引用文章
详细
The conditional probability (fraction) of the successful decoding of erasure patterns of high (greater than the code distance) weights is investigated for linear codes with the partially known or unknown weight spectra of code words. The estimated conditional probabilities and the methods used to calculate them refer to arbitrary binary linear codes and binary Hamming, Panchenko, and Bose–Chaudhuri–Hocquenghem (BCH) codes, including their extended and shortened forms. Error detection probabilities are estimated under erasure-correction conditions. The product-code decoding algorithms involving the correction of high weight erasures by means of component Hamming, Panchenko, and BCH codes are proposed, and the upper estimate of decoding failure probability is presented.
作者简介
V. Afanassiev
Kharkevich Institute for Information Transmission Problems
编辑信件的主要联系方式.
Email: afanv@iitp.ru
俄罗斯联邦, Moscow, 127051
A. Davydov
Kharkevich Institute for Information Transmission Problems
Email: afanv@iitp.ru
俄罗斯联邦, Moscow, 127051
D. Zigangirov
Kharkevich Institute for Information Transmission Problems
Email: afanv@iitp.ru
俄罗斯联邦, Moscow, 127051