Tables of Coverings for Decoding by S-Sets
暂无分享,去创建一个
A linear block decoding method in which decoding is reduced to the repeated decoding of shortened codes is proposed. The algorithm for constructing coverings from codewords, which are necessary for the proposed technique, is provided. A tables of such coverings for a number of binary BCH and quadratic-residue (QR) codes is presented.
[1] Hermann J. Helgert,et al. Minimum-distance bounds for binary linear codes , 1973, IEEE Trans. Inf. Theory.
[2] J. Spencer. Probabilistic Methods in Combinatorics , 1974 .