The DOI matches its Crossref record; 49 of the 49 references it cites were found in a registry or an index.
Algebraic-geometry codes
Abstract
The theory of error-correcting codes derived from curves in an algebraic geometry was initiated by the work of Goppa as generalizations of Bose-Chaudhuri-Hocquenghem (BCH), Reed-Solomon (RS), and Goppa codes. The development of the theory has received intense consideration since that time and the purpose of the paper is to review this work. Elements of the theory of algebraic curves, at a level sufficient to understand the code constructions and decoding algorithms, are introduced. Code constructions from particular classes of curves, including the Klein quartic, elliptic, and hyperelliptic curves, and Hermitian curves, are presented. Decoding algorithms for these classes of codes, and others, are considered. The construction of classes of asymptotically good codes using modular curves is also discussed.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
A Mathematical Theory of Communication
Shannon, C. E. (1948) · Bell System Technical Journal · doi:10.1002/j.1538-7305.1948.tb00917.x · Cited by 48,949
The Theory of Error-Correcting Codes
(1977) · North-Holland Mathematical Library · doi:10.1016/s0924-6509(08)x7030-8 · Cited by 10,760
Error Detecting and Error Correcting Codes
Hamming, R. W. (1950) · Bell System Technical Journal · doi:10.1002/j.1538-7305.1950.tb00463.x · Cited by 5,377
The Arithmetic of Elliptic Curves
Silverman, J. H. (1986) · Graduate Texts in Mathematics · doi:10.1007/978-1-4757-1920-8 · Cited by 4,044
Polynomial Codes Over Certain Finite Fields
Reed, I. S., & Solomon, G. (1960) · Journal of the Society for Industrial and Applied Mathematics · doi:10.1137/0108018 · Cited by 3,662
Sphere Packings, Lattices and Groups.
Coxeter, H. S. M., Conway, J. H., & Sloane, N. J. A. (1989) · The American Mathematical Monthly · doi:10.2307/2323992 · Cited by 3,377
ERROR DETECTING AND ERROR CORRECTING CODES
Chauhan, N., Yadav, P., & Kumari, P. (2014) · Cited by 3,270
Algebraic Coding Theory: Revised Edition
Berlekamp, E. R. (2015) · WORLD SCIENTIFIC eBooks · doi:10.1142/9407 · Cited by 2,474
Ideals, Varieties, and Algorithms
Cox, D., Little, J., & O’Shea, D. (2007) · Undergraduate Texts in Mathematics · doi:10.1007/978-0-387-35651-8 · Cited by 2,377
Lide, R., & Niederreiter, H. (1996) · Cited by 2,213
Shift-register synthesis and BCH decoding
Massey, J. (1969) · IEEE Transactions on Information Theory · doi:10.1109/tit.1969.1054260 · Cited by 2,186
Algebraic Function Fields and Codes
Stichtenoth, H. (2009) · Graduate Texts in Mathematics · doi:10.1007/978-3-540-76878-4 · Cited by 1,938
Lidl, R. (1983) · Cited by 1,390
On a class of error correcting binary group codes
Bose, R. C., & Ray-Chaudhuri, D. K. (1960) · Information and Control · doi:10.1016/s0019-9958(60)90287-4 · Cited by 1,367
Walker, R. J. (1950) · Cited by 1,240
Ideals, Varieties, and Algorithms
Cox, D. H., Little, J. B., & O’Shea, D. (1992) · Undergraduate texts in mathematics · doi:10.1007/978-1-4757-2181-2 · Cited by 1,002
The Theory of Information and Coding
McEliece, R. (2002) · Cambridge University Press eBooks · doi:10.1017/cbo9780511606267 · Cited by 986
Sphere Packings, Lattices and Groups
Conway, J. H., & Sloane, N. J. A. (1993) · Grundlehren der mathematischen Wissenschaften · doi:10.1007/978-1-4757-2249-9 · Cited by 880
Elliptic Curve Public Key Cryptosystems
Menezes, A. (1993) · Springer eBooks · doi:10.1007/978-1-4615-3198-2 · Cited by 852
A Course in Number Theory and Cryptography
Koblitz, N. (1987) · Graduate Texts in Mathematics · doi:10.1007/978-1-4684-0310-7 · Cited by 839
Decoding of Reed Solomon Codes beyond the Error-Correction Bound
Sudan, M. (1997) · Journal of Complexity · doi:10.1006/jcom.1997.0439 · Cited by 723
Finite fields: Encyclopedia of mathematics and its applications
(1997) · Computers & Mathematics with Applications · doi:10.1016/s0898-1221(97)84597-x · Cited by 680
The theory of error-correcting codes
Massey, J. L. (1980) · Proceedings of the IEEE · doi:10.1109/proc.1980.11608 · Cited by 676
van Lint, J. H. (1982) · Graduate Texts in Mathematics · doi:10.1007/978-3-662-07998-0 · Cited by 668
A Course in Number Theory and Cryptography
Koblitz, N. (1994) · Graduate Texts in Mathematics · doi:10.1007/978-1-4419-8592-7 · Cited by 576
Modular curves, Shimura curves, and Goppa codes, better than Varshamov‐Gilbert bound
Tsfasman, M. A., Vlădutx, S. G., & Zink, T. (1982) · Mathematische Nachrichten · doi:10.1002/mana.19821090103 · Cited by 534
Golay, M. J. E. (1949) · Cited by 422
Fulton, W. (1969) · Cited by 414
A tower of Artin-Schreier extensions of function fields attaining the Drinfeld-Vladut bound
Garcia, A., & Stichtenoth, H. (1995) · Inventiones Mathematicae · doi:10.1007/bf01884295 · Cited by 348
Goppa, V. D. (1981) · Cited by 347
Class of constructive asymptotically good algebraic codes
Justesen, J. (1972) · IEEE Transactions on Information Theory · doi:10.1109/tit.1972.1054893 · Cited by 294
On subfield subcodes of modified Reed-Solomon codes (Corresp.)
Delsarte, P. (1975) · IEEE Transactions on Information Theory · doi:10.1109/tit.1975.1055435 · Cited by 277
On the Asymptotic Behaviour of Some Towers of Function Fields over Finite Fields
Garcia, A., & Stichtenoth, H. (1996) · Journal of Number Theory · doi:10.1006/jnth.1996.0147 · Cited by 266
On the minimum distance of cyclic codes
van Lint, J., & Wilson, R. (1986) · IEEE Transactions on Information Theory · doi:10.1109/tit.1986.1057134 · Cited by 181
Construction and decoding of a class of algebraic geometry codes
Justesen, J., Larsen, K. J., Jensen, H. E., Havemose, A., & Høholdt, T. (1989) · IEEE Transactions on Information Theory · doi:10.1109/18.32157 · Cited by 127
Bounds on the size of linear codes
Brouwer, A. A. (1998) · TU/e Research Portal · Cited by 124
On the decoding of algebraic-geometric codes
Skorobogatov, A. N., & Vladut, S. G. (1990) · IEEE Transactions on Information Theory · doi:10.1109/18.57204 · Cited by 108
Remarks on codes from Hermitian curves (Corresp.)
Tiersma, H. J. (1987) · IEEE Transactions on Information Theory · doi:10.1109/tit.1987.1057327 · Cited by 85
Saints, K., & Heegard, C. (1995) · IEEE Transactions on Information Theory · doi:10.1109/18.476246 · Cited by 83
Self-citationWhich linear codes are algebraic-geometric?
Pellikan, R., Shen, B.-Z., & van Wee, G. J. M. (1991) · IEEE Transactions on Information Theory · doi:10.1109/18.79915 · Cited by 71
Generalized Reed - Solomon codes from algebraic geometry
van Lint, J., & Springer, T. A. (1987) · IEEE Transactions on Information Theory · doi:10.1109/tit.1987.1057320 · Cited by 68
Codes on the Klein quartic, ideals, and decoding (Corresp.)
Hansen, J. P. (1987) · IEEE Transactions on Information Theory · doi:10.1109/tit.1987.1057365 · Cited by 40
Goppa codes and Weierstrass gaps
Garcia, A., & Lax, R. F. (1992) · Lecture notes in mathematics · doi:10.1007/bfb0087991 · Cited by 36
Decoding codes from curves and cyclic codes
Duursma, I. (1993) · doi:10.6100/ir399251 · Cited by 33
ALGEBRAIC CURVES OVER FINITE FIELDS: (Cambridge Tracts in Mathematics 97)
Pellikaan, R. (1992) · Bulletin of the London Mathematical Society · doi:10.1112/blms/24.5.497 · Cited by 29
Achieving the designed error capacity in decoding algebraic-geometric codes
Ehrhard, D. (1993) · IEEE Transactions on Information Theory · doi:10.1109/18.256485 · Cited by 28
Algebraic decoding using special divisors
Duursma, I. (1993) · IEEE Transactions on Information Theory · doi:10.1109/18.212305 · Cited by 27
On the main conjecture on geometric MDS codes
Munuera, C. (1992) · IEEE Transactions on Information Theory · doi:10.1109/18.149510 · Cited by 22
van der Geer, G. (1991) · Birkhäuser Boston eBooks · doi:10.1007/978-1-4612-0441-1_10 · Cited by 8
Cited by
Improved decoding of Reed-Solomon and algebraic-geometry codes
Guruswami, V., & Sudan, M. (1999) · IEEE Transactions on Information Theory · doi:10.1109/18.782097 · Cited by 998
Information and computation: Classical and quantum aspects
Galindo, A., & Martín-Delgado, M. A. (2002) · Reviews of Modern Physics · doi:10.1103/revmodphys.74.347 · Cited by 552
Channel coding: The road to channel capacity
Costello, D. J., & Forney, G. D. (2007) · Proceedings of the IEEE · doi:10.1109/jproc.2007.895188 · Cited by 408
Metadata
- Authors
- Blake, I., Heegard, C., Hoholdt, T., & Wei, V.
- Venue
- IEEE Transactions on Information Theory
- Published
- 1998
- Volume
- 44
- Issue
- 6
- Pages
- 2596-2618
- ISSN
- 0018-9448 (ISSN-L)
- OpenAlex
- W2127579297
- Cited by
- 265
- References
- 49
- FWCI
- 13.13
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.