Decoding algebraic-geometric codes up to the designed minimum distance
- 1 January 1993
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 39 (1) , 37-45
- https://doi.org/10.1109/18.179340
Abstract
No abstract availableThis publication has 13 references indexed in Scilit:
- Fast decoding of codes from algebraic plane curvesIEEE Transactions on Information Theory, 1992
- A generalization of the Berlekamp-Massey algorithm for multisequence shift-register synthesis with applications to decoding cyclic codesIEEE Transactions on Information Theory, 1991
- On the decoding of algebraic-geometric codesIEEE Transactions on Information Theory, 1990
- Algebraic Geometric CodesPublished by Springer Nature ,1990
- Construction and decoding of a class of algebraic geometry codesIEEE Transactions on Information Theory, 1989
- On a decoding algorithm for codes on maximal curvesIEEE Transactions on Information Theory, 1989
- Generalized Reed - Solomon codes from algebraic geometryIEEE Transactions on Information Theory, 1987
- Elliptic codes over fields of characteristics 2Journal of Pure and Applied Algebra, 1987
- Recent results on coding and algebraic geometryPublished by Springer Nature ,1986
- Modular curves and codes with a polynomial constructionIEEE Transactions on Information Theory, 1984