Performance of Hermitian codes using combined error and erasure decoding
暂无分享,去创建一个
[1] Rolando Carrasco,et al. Design of algebraic-geometric codes over fading channels , 2004 .
[2] Shojiro Sakata,et al. Finding a Minimal Set of Linear Recurring Relations Capable of Generating a Given Finite Two-Dimensional Array , 1988, J. Symb. Comput..
[3] T. R. N. Rao,et al. Decoding algebraic-geometric codes up to the designed minimum distance , 1993, IEEE Trans. Inf. Theory.
[4] Rolando Carrasco,et al. Construction and performance of algebraic–geometric codes over AWGN and fading channels , 2005 .
[5] Douglas A. Leonard,et al. Fast Erasure-and-Error Decoding of Algebraic Geometry Codes up to the Feng-Rao Bound , 1998, IEEE Trans. Inf. Theory.
[6] Douglas A. Leonard,et al. A generalized Forney formula for algebraic-geometric codes , 1996, IEEE Trans. Inf. Theory.
[7] R. Kotter. Fast generalized minimum-distance decoding of algebraic-geometry and Reed-Solomon codes , 1996 .
[8] Tom Høholdt,et al. Fast decoding of algebraic-geometric codes up to the designed minimum distance , 1995, IEEE Trans. Inf. Theory.
[9] Tom Høholdt,et al. Construction and decoding of a class of algebraic geometry codes , 1989, IEEE Trans. Inf. Theory.