On Decoding of Binary Cyclic Codes up to Error-Correcting Capacity Five
暂无分享,去创建一个
In this paper, a simplified decoding algorithm of the binary cyclic codes with error-correcting capacity less than or equal to 5 is proposed. The simulation result of the decoding algorithm is shown that all correctable error patterns are decoded successfully via the simplified decoding algorithm.
[1] Michele Elia,et al. Algebraic decoding of the (23, 12, 7) Golay code , 1987, IEEE Trans. Inf. Theory.
[2] Xuemin Chen,et al. Decoding the (47, 24, 11) quadratic residue code , 2001, IEEE Trans. Inf. Theory.
[3] Gui Liang Feng,et al. A new procedure for decoding cyclic and BCH codes up to actual minimum distance , 1994, IEEE Trans. Inf. Theory.