Construction and performance of algebraic–geometric codes over AWGN and fading channels
暂无分享,去创建一个
[1] Oliver Pretzel,et al. Codes and Algebraic Curves , 1998 .
[2] Chris Heegard,et al. Cyclic Codes: A Unified Theory and Algorithms for Decoding Using Grobner Bases , 1995 .
[3] Chris Heegard,et al. Systematic encoding via Grobner bases for a class of algebraic-geometric Goppa codes , 1995, IEEE Trans. Inf. Theory.
[4] V. D. Goppa. Codes on Algebraic Curves , 1981 .
[5] Tom Høholdt,et al. Fast decoding of algebraic-geometric codes up to the designed minimum distance , 1995, IEEE Trans. Inf. Theory.
[6] T. R. N. Rao,et al. Decoding algebraic-geometric codes up to the designed minimum distance , 1993, IEEE Trans. Inf. Theory.
[7] Chih-Wei Liu. Determination of Error Values for Decoding Hermitian Codes with the Inverse Affine Fourier Transform , 1999 .
[8] 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..
[9] Tom Høholdt,et al. Fast decoding of codes from algebraic plane curves , 1992, IEEE Trans. Inf. Theory.
[10] Tom Høholdt,et al. Construction and decoding of a class of algebraic geometry codes , 1989, IEEE Trans. Inf. Theory.