It is shown that error-erasure decoding for a cycliccode allows the correction of a combination of t errors and r erasures when 2t+r> sigma /sub 0/; the parameter sigma /sub 0/ denotes a particular instance of...
详细信息
It is shown that error-erasure decoding for a cycliccode allows the correction of a combination of t errors and r erasures when 2t+r> sigma /sub 0/; the parameter sigma /sub 0/ denotes a particular instance of the Hartmann-Tzeng bound. This procedure is an improvement on the error-erasure decoding algorithm developed by G.D. Forney (1965), which works when 2t+r> sigma , where sigma denotes the BCH-bound of the code.
For a number of binarycycliccodes with e<e/sub BCH/, algebraic algorithms are given to find the error locator polynomial. Thus, for these codes more errors can be corrected algebraically than by the Berlekamp...
详细信息
For a number of binarycycliccodes with e<e/sub BCH/, algebraic algorithms are given to find the error locator polynomial. Thus, for these codes more errors can be corrected algebraically than by the Berlekamp-Massey algorithm. In some cases, all error patterns of weight up to e can be decoded; in other cases, only error patterns of weight up to e' with e/sub BCH/>e'>or=e can be decoded. The correctness of three of these algorithms is (partly) based on an exhaustive computer search; in all other cases, the algebraic proof is given in detail. It seems likely that many more cycliccodes can be decoded with these methods.
Irregular low-density parity-check (LDPC) codes outperform turbo codes for the block length 10(4) and above. This study introduces generalised LDPC (GLDPC) codes with binarycycliccodes as component codes whose perfo...
详细信息
Irregular low-density parity-check (LDPC) codes outperform turbo codes for the block length 10(4) and above. This study introduces generalised LDPC (GLDPC) codes with binarycycliccodes as component codes whose performance is better than that of irregular LDPC codes. The codes are found by optimising degree distributions. The authors also present some simulation results, which show that the codes surpass the irregular LDPC codes.
The unequal error correction capabilities of binarycycliccodes of composite length are investigated. Under certain conditions, direct sums of concatenated codes have unequal error correction capabilities. By a modif...
详细信息
The unequal error correction capabilities of binarycycliccodes of composite length are investigated. Under certain conditions, direct sums of concatenated codes have unequal error correction capabilities. By a modified Hartmann and Tzeng (1973) algorithm, it is shown that a binarycycliccode of composite length is equivalent to the direct sum of concatenated codes. With this, some binarycyclic unequal error protection (UEP) codes are constructed. Finally, the authors present a class of two-level UEP cyclic direct-sum codes which provide error correction capabilities higher than those guaranteed by the Blokh-Zyablov (1974) constructions
For cycliccodes we proposed a lower bound of minimum distance by discrete Fourier transform (DFT). In this paper, we will show the procedure for construction of the independent set, give the designed minimum distance...
详细信息
ISBN:
(纸本)9784885522673
For cycliccodes we proposed a lower bound of minimum distance by discrete Fourier transform (DFT). In this paper, we will show the procedure for construction of the independent set, give the designed minimum distance of binarycycliccodes of odd lengths from 69 to 99 using the proposed lower bound.
暂无评论