Efficient Decoding of Systematic (41, 21, 9) Quadratic Residue Code
暂无分享,去创建一个
[1] Michele Elia,et al. Algebraic decoding of the (23, 12, 7) Golay code , 1987, IEEE Trans. Inf. Theory.
[2] Tor Helleseth,et al. Use of Grobner bases to decode binary cyclic codes up to the true minimum distance , 1994, IEEE Trans. Inf. Theory.
[3] Tsung-Ching Lin,et al. On the decoding of the (24, 12, 8) Golay code , 2010, Inf. Sci..
[4] Xuemin Chen,et al. Decoding the (47, 24, 11) quadratic residue code , 2001, IEEE Trans. Inf. Theory.
[5] H. Mattson,et al. New 5-designs , 1969 .
[6] O. Antoine,et al. Theory of Error-correcting Codes , 2022 .
[7] Ofer Amrani,et al. The Leech lattice and the Golay code: bounded-distance decoding and multilevel constructions , 1994, IEEE Trans. Inf. Theory.
[8] Xuemin Chen,et al. A performance comparison of the binary quadratic residue codes with the 1/2-rate convolutional codes , 1994, IEEE Trans. Inf. Theory.
[9] Chong-Dao Lee,et al. Algebraic decoding of (71, 36, 11), (79, 40, 15), and (97, 49, 15) quadratic residue codes , 2003, IEEE Trans. Commun..
[10] Tsung-Ching Lin,et al. Algebraic decoding of the (41, 21, 9) Quadratic Residue code , 2009, Inf. Sci..
[11] James L. Massey,et al. Shift-register synthesis and BCH decoding , 1969, IEEE Trans. Inf. Theory.
[12] Trieu-Kien Truong,et al. Algebraic decoding of the (32, 16, 8) quadratic residue code , 1990, IEEE Trans. Inf. Theory.