Algebraic codes on lines, planes, and curves

Algebraic Codes on Lines, Planes, and Curves

Volumn 9780521771948, Issue , 2008, Pages 1-543

  Blahut, Richard E ^a  

^a United States of America   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGEBRA; COMPUTER PROGRAMMING; DECODING; GEOMETRY; INFORMATION THEORY; SIGNAL PROCESSING; STUDENTS;

ALGEBRAIC CODING THEORY; ALGEBRAIC GEOMETRY; APPLICATIONS IN COMMUNICATIONS; COMMUNICATION ENGINEERS; DECODING ALGORITHM; ENCODERS AND DECODERS; ERROR CORRECTING CODE; FUNDAMENTAL PRINCIPLES;

CODES (SYMBOLS);

EID: 84927006060     PISSN: None     EISSN: None     Source Type: Book    
DOI: 10.1017/CBO9780511543401     Document Type: Book

References (184)

1. S. Arimoto, Encoding and Decoding of p-ary Group Codes and the Correction System, Information Processing in Japan, vol. 2, pp. 320–325, 1961 (in Japanese).
2. E. F. Assmus, Jr. and H. F. Mattson, Jr., Coding and Combinatorics, SIAM Review, vol. 16, pp. 349–388, 1974.
3. E. F. Assmus, Jr., H. F. Mattson, Jr., and R. J. Turyn, Cyclic Codes, Report AFCRL-65-332, Air Force Cambridge Research Laboratories, Bedford, MA, 1965.
4. E. F. Assmus, Jr., H. F. Mattson, Jr., and R. J. Turyn, Research to Develop the Algebraic Theory of Codes, Report AFCRL-67-0365, Air Force Cambridge Research Laboratories, Bedford, MA, 1967.
5. S. Arimoto, Encoding and Decoding of p-ary Group Codes and the Correction System, Information Processing in Japan, (in Japanese), vol. 2, pp. 320–325, 1961.
6. E. R. Berlekamp, Algebraic Coding Theory, McGraw-Hill, New York, 1968.
7. E. R. Berlekamp, CodingTheory and the Mathieu Groups, Information and Control, vol. 18, pp. 40–64, 1971.
8. E. R. Berlekamp, Bounded Distance +1 Soft-Decision Reed–Solomon Decoding, IEEE Transactions on Information Theory, vol. IT-42, pp. 704–720, 1996.
9. E. R. Berlekamp, G. Seroussi, and P. Tong, AHypersystolic Reed–Solomon Decoder, in Reed–Solomon Codes and Their Applications, S. B. Wicker and V. K. Bhargava, editors, IEEE Press, 1994.
10. E. Bézout, Sur le degré des équations résultantes de l’évanouissement des inconnus, Histoire de l’Académie Royale des Sciences, anneé 1764, pp. 288–338, Paris, 1767.
11. E. Bézout, Théorie générale des équation algébriques, Paris, 1770.
12. R. E. Blahut, A Universal Reed–Solomon Decoder, IBM Journal of Research and Development, vol. 28, pp. 150–158, 1984.
13. R. E. Blahut, Algebraic Codes for Data Transmission, Cambridge University Press, Cambridge, 2003.
14. R. E. Blahut, Algebraic Geometry Codes without Algebraic Geometry, IEEE Information Theory Workshop, Salvador, Bahia, Brazil, 1992.
15. R. E. Blahut, Algebraic Methods for Signal Processing and Communications Coding, Springer-Verlag, New York, 1992.
16. R. E. Blahut, Fast Algorithms for Digital Signal Processing, Addison-Wesley, Reading, MA, 1985.
17. R. E. Blahut, On Codes Containing Hermitian Codes, Proceedings of the 1995 IEEE International Symposium on Information Theory, Whistler, British Columbia, Canada, 1995.
18. R. E. Blahut, The Gleason–Prange Theorem, IEEE Transactions on Information Theory, vol. IT-37, pp. 1264–1273, 1991.
19. R. E. Blahut, Theory and Practice of Error Control Codes, Addison-Wesley, Reading, MA, 1983.
20. R. E. Blahut, Transform Techniques for Error-Control Codes, IBM Journal of Research and Development, vol. 23, pp. 299–315, 1979.
21. I. F. Blake, Codes over Certain Rings, Information and Control, vol. 20, pp. 396–404, 1972.
22. I. F. Blake, C. Heegard, T. Høholdt, and V. Wei, Algebraic Geometry Codes, IEEE Transactions on Information Theory, vol. IT-44, pp. 2596–2618, 1998.
23. E. L. Blokh and V. V. Zyablov, Coding of Generalized Concatenated Codes, Problems of Information Transmission, vol. 10, pp. 218–222, 1974.
24. R. C. Bose and D. K. Ray-Chaudhuri, On a Class of Error Correcting Binary Group Codes, Information and Control, vol. 3, pp. 68–79, 1960.
25. B. Buchberger, Ein Algorithmus zum Auffinden der Basiselemente des Restklassenringes nach einem nulldimensionalen Polynomideal, Ph.D. Thesis, University of Innsbruck, Austria, 1965.
26. B. Buchberger, Gröbner Bases: An Algorithmic Method in Polynomial Ideal Theory, in Multidimensional Systems Theory, N. K. Bose, editor, D. Reidel Publishing Company, pp. 184–232, 1985.
27. A. R. Calderbank and G. McGuire, Construction of a (64, 237, 12) Code via Galois Rings, Designs, Codes, and Cryptography, vol. 10, pp. 157–165, 1997.
28. A. R. Calderbank, G. McGuire, P. V. Kumar, and T. Helleseth, Cyclic Codes over Z4, Locator Polynomials, and Newton’s Identities, IEEE Transactions on Information Theory, vol. IT-42, pp. 217–226, 1996.
29. T. K. Citron, Algorithms and Architectures for Error Correcting Codes, Ph.D. Dissertation, Stanford University, Stanford, CA, 1986.
30. J. H. Conway and N. J. A. Sloane, Sphere Packings, Lattices, and Groups, Second Edition, Springer-Verlag, New York, 1992.
31. D. Coppersmith and G. Seroussi, On the Minimum Distance of Some Quadratic Residue Codes, IEEE Transactions on Information Theory, vol. IT-30, pp. 407–411, 1984.
32. D. Cox, J. Little, and D. O’Shea, Ideals, Varieties, and Algorithms, Springer-Verlag, New York, 1992.
33. D. Dabiri, Algorithms and Architectures for Error-Correction Codes, Ph.D. Dissertation, University of Waterloo, Ontario, Canada, 1996.
34. D. Dabiri and I. F. Blake, Fast Parallel Algorithms for Decoding Reed–Solomon Codes Based on Remainder Polynomials, IEEE Transactions on Information Theory, vol. IT-41, pp. 873–885, 1995.
35. P. Delsarte, Four Fundamental Parameters of a Code and Their Combinatorial Significance, Information and Control, vol. 27, pp. 407–438, 1973.
36. P. Delsarte, On Subfield Subcodes of Modified Reed–Solomon Codes, IEEE Transactions on Information Theory, vol. IT-21, pp. 575–576, 1975.
37. L. E. Dickson, Finiteness of the Odd Perfect and Primitive Abundant Numbers with n Distinct Prime Factors, American Journal of Mathematics, vol. 35, pp. 413–422, 1913.
38. J. L. Dornstetter, On the Equivalence Between Berlekamp’s and Euclid’s Algorithms, IEEE Transactions on Information Theory, vol. IT-33, pp. 428–431, 1987.
39. V. G. Drinfeld and S. G. Vlǎdut, Number of Points on anAlgebraic Curve, Functional Analysis, vol. 17, pp. 53–54, 1993.
40. I. M. Duursma, Decoding Codes from Curves and Cyclic Codes, Ph.D. Dissertation, Eindhoven University, Eindhoven, Netherlands, 1993a.
41. I. M. Duursma, Algebraic Decoding Using Special Divisors, IEEE Transactions on Information Theory, vol. IT-39, pp. 694–698, 1993b.
42. D. Ehrhard, Über das Dekodieren Algebraisch-Geometrischer Coden, Ph.D. Dissertation, Universität Düsseldorf, Düsseldorf, Germany, 1991.
43. D. Ehrhard, Achieving the Designed Error Capacity in Decoding Algebraic-Geometric Codes, IEEE Transactions on Information Theory, vol. IT-39, pp. 743–751, 1993.
44. S. V. Fedorenko, A Simple Algorithm for Decoding Reed–Solomon Codes and its Relation to the Welch–Berlekamp Algorithm, IEEE Transactions on Information Theory, vol. IT-51, pp. 1196– 1198, 2005.
45. W. Feit, A Self Dual Even (96, 48, 16) Code, IEEE Transactions on Information Theory, vol. IT-20, pp. 136–138, 1974.
46. G.-L. Feng and T. R. N. Rao, Decoding Algebraic-Geometric Codes up to the Designed Minimum Distance, IEEE Transactions on Information Theory, vol. IT-39, pp. 37–45, 1993.
47. G.-L. Feng and T. R. N. Rao, A Simple Approach for Construction of Algebraic-Geometric Codes From Affine Plane Curves, IEEE Transactions on Information Theory, vol. IT-40, pp. 1003–1012, 1994.
48. G.-L. Feng and T. R. N. Rao, Improved Geometric Goppa Codes, Part I, Basic Theory, IEEE Transactions on Information Theory, vol. IT-41, pp. 1678–1693, 1995.
49. G.-L. Feng, V. K. Wei, T. R. N. Rao, and K. K. Tzeng, Simplified Understanding and Effect Decoding of a Class of Algebraic-Geometric Codes, IEEE Transactions on Information Theory, vol. 40, pp. 981–1002, 1994.
50. W. Feng, On Decoding Reed–Solomon Codes and Hermitian Codes, Ph.D. Dissertation, University of Illinois, Urbana, Illinois, 1999.
51. W. Feng and R. E. Blahut, A Class of Codes that Contains the Klein Quartic Codes, Proceedings of the 30th Conference on Information Sciences and Systems, Princeton, NJ, 1996.
52. W. Feng and R. E. Blahut, Some Results on the Sudan Algorithm, Proceedings of the 1998 IEEE International Symposium on Information Theory, Cambridge, MA, 1998.
53. P. Fitzpatrick, On the Key Equation, IEEE Transactions on Information Theory, vol. IT-41, pp. 1–13, 1995.
54. G. D. Forney, Jr., On Decoding BCH Codes, IEEE Transactions on Information Theory, vol. IT-11, pp. 549–557, 1965.
55. G. D. Forney, Jr., Concatenated Codes, The M.I.T. Press, Cambridge, MA, 1966.
56. G. D. Forney, Jr., Transforms and Groups, in Codes, Curves, and Signals: Common Threads in Communication, A. Vardy, editor, Kluwer Academic, Norwell, MA, 1998.
57. G. D. Forney, Jr., N. J. A. Sloane, and M. D. Trott, The Nordstrom–Robinson code is the Binary Image of the Octacode, Proceedings DIMACS/IEEE Workshop on Coding and Quantization, DIMACS Series in Discrete Mathematics and Theoretical Computer Science, American Mathematical Society, 1993.
58. W. Fulton, Algebraic Curves, Benjamin-Cummings, 1969; reprinted inAdvanced Book Classic Series, Addison-Wesley, Reading, MA, 1989.
59. A. Garcia, S. J. Kim, and R. F. Lax, Consecutive Weierstrass Gaps and Minimum Distance of Goppa Codes, Journal of Pure and Applied Algebra, vol. 84, pp. 199–207, 1993.
60. O. Geil and T. Høholdt, Footprints or Generalized Bézout’s Theorem, IEEE Transactions on Information Theory, vol. IT-46, pp. 635–641, 2000.
61. O. Geil and T. Høholdt, On Hyperbolic Codes, Proceedings of AAECC-14, Melbourne, November 2001, Springer LNCS, 2002.
62. G. Goertzel, An Algorithm for the Evaluation of Finite Trigometric Series, American Mathematical Monthly, vol. 65, pp. 34–35, 1968.
63. J. M. Goethals, Nonlinear Codes Defined by Quadratic Forms Over GF(2), Information and Control, vol. 31, pp. 43–74, 1976.
64. M. J. E. Golay, Notes on Digital Coding, Proceedings of the IRE, vol. 37, p. 657, 1949.
65. I. J. Good, The Interaction Algorithm and Practical Fourier Analysis, Journal of the Royal Statistical Society, vol. B20, pp. 361–375, 1958; addendum, vol. 22, pp. 372–375, 1960.
66. V. D. Goppa, A New Class of Linear Error-Correcting Codes, Problemy Peredachi Informatsii, vol. 6, pp. 207–212, 1970.
67. V. D. Goppa, Codes Associated with Divisors, Problemy Peredachi Informatsii, vol. 13, pp. 33–39, 1977; Problems of Information Transmission, vol. 13, pp. 22–26, 1977.
68. V. D. Goppa, Codes on Algebraic Curves, Doklady Akad. Nauk SSSR, vol. 259, pp. 1289–1290, 1981; Soviet Math. Doklady, vol. 24, pp. 170–172, 1981.
69. D. C. Gorenstein and N. Zierler, A Class of Error-Correcting Codes in p m Symbols, Journal of the Society of Industrial and Applied Mechanics, vol. 9, pp. 207–214, 1961.
70. M. W. Green, Two Heuristic Techniques for Block Code Construction, IEEE Transactions on Information Theory, vol. IT-12, p. 273, 1966.
71. V. Guruswami and M. Sudan, Improved Decoding of Reed–Solomon Codes and Algebraic Geometry Codes, IEEE Transactions on Information Theory, vol. IT-45, pp. 1757–1767, 1999.
72. R. W. Hamming, Error Detecting and Error Correcting Codes, Bell System Technical Journal, vol. 29, pp. 147–160, 1950.
73. A. R. Hammons, Jr., P. V. Kumar, A. R. Calderbank, N. J. A. Sloane, and P. Solé, The Z4 -linearity of Kerdock, Preparata, Goethals, and Related Codes, IEEE Transactions on Information Theory, vol. IT-40, pp. 301–319, 1994.
74. J. P. Hansen, Codes from the Klein Quartic, Ideals and Decoding, IEEE Transactions on Information Theory, vol. IT-33, pp. 923–925, 1987.
75. J. P. Hansen and H. Stichtenoth, Group Codes on CertainAlgebraic Curves with Many Rational Points, Proceedings of Applied Algebra Engineering Communications Computing-1, vol. 1, pp. 67–77, 1990.
76. J. P. Hansen, H. E. Jensen, and R. Koetter, Determination of Error Values for Algebraic-Geometric Codes and the Forney Formula, IEEE Transactions on Information Theory, vol. IT-42, pp. 1263–1269, 1996.
77. C. R. P. Hartmann, Decoding Beyond the BCH Bound, IEEE Transactions on Information Theory, vol. IT-18, pp. 441–444, 1972.
78. C. R. P. Hartmann and K. K. Tzeng, Generalizations of the BCH Bound, Information and Control, vol. 20, pp. 489–498, 1972.
79. H. Hasse, Theorie der høheren Differentiale in einem algebraischen Funktionenkørper mit vollkomme-nen Konstantenkørper bei beliebiger Charakteristik, J. Reine & Angewandte Math., vol. 175, pp. 50–54, 1936.
80. C. Heegard, J. H. Little, and K. Saints, Systematic Encoding via Gröbner Bases for a Class ofAlgebraic Geometric Goppa Codes, IEEE Transactions on Information Theory, vol. IT-41, 1995.
81. H. H. Helgert, Alternant Codes, Information and Control, vol. 26, pp. 369–381, 1974.
82. T. Helleseth and T. Klφve, The Newton Radius of Codes, IEEE Transactions on Information Theory, vol. IT-43, pp. 1820–1831, 1997.
83. A. E. Heydtmann and J. M. Jensen, On the Equivalence of the Berlekamp–Massey and the Euclidian Algorithm for Decoding, IEEE Transactions on Information Theory, vol. IT-46, pp. 2614–2624, 2000.
84. D. Hilbert, Über die Theorie der Algebraischen Formen, Mathematische Annalen, vol. 36, pp. 473–534, 1890.
85. D. Hilbert, Über die Vollen Invarientensysteme, Mathematische Annalen, vol. 42, pp. 313–373, 1893.
86. D. Hilbert, Gesammelte Abhandlungen, vol. II (collected works), Springer, Berlin, 1933.
87. J. W. P. Hirschfeld, M. A. Tsfasman, and S. G. Vlâdut, The Weight Hierarchy of Higher Dimensional Hermitian Codes, IEEE Transactions on Information Theory, vol. IT-40, pp. 275–278, 1994.
88. A. Hocquenghem, Codes Correcteurs d’erreurs, Chiffres, vol. 2, pp. 147–156, 1959.
89. T. Høholdt, On (or in) the Blahut Footprint, in Codes, Curves, and Signals: Common Threads in Communication, A. Vardy, editor, Kluwer Academic, Norwell, MA, 1998.
90. T. Hφholdt and R. Pellikaan, On the Decoding of Algebraic-Geometric Codes, IEEE Transactions on Information Theory, vol. IT-41, pp. 1589–1614, 1995.
91. T. Hφholdt, J. H. van Lint, and R. Pellikaan, Algebraic Geometry Codes, Handbook of Coding Theory, V. S. Pless and W. C. Huffman, editors, Elsevier, Amsterdam, pp. 871–961, 1998.
92. T. Horiguchi, High Speed Decoding of BCH Codes Using a New Error Evaluation Algorithm, Elektronics and Communications in Japan, vol. 72, no. 12, part 3, 1989.
93. W. C. Huffman, The Automorphism Group of the Generalized Quadratic Residue Codes, IEEE Transactions on Information Theory, vol. IT-41, pp. 378–386, 1995.
94. T. W. Hungerford, Algebra, Springer-Verlag, 1974.
95. T. Ikai, H. Kosako, and Y. Kojima, On Two-Dimensional Cyclic Codes, Transactions of the Institute of Electronic Communication of Japan, vol. 57A, pp. 279–286, 1974.
96. H. Imai, A Theory of Two-Dimensional Cyclic Codes, Information and Control, vol. 34, pp. 1–21, 1977.
97. C. D. Jensen, Codes and Geometry, Ph.D. Dissertation, Denmarks Teknishe Højskole, Denmark, 1991.
98. J. Justesen, K. J. Larson, H. E. Jensen, A. Havemose, and T. Høholdt, Construction and Decoding of a Class of Algebraic Geometry Codes, IEEE Transactions on Information Theory, vol. IT-35, pp. 811–821, 1989.
99. J. Justesen, K. J. Larsen, H. E. Jensen, and T. Hφholdt, Fast Decoding of Codes from Algebraic Plane Codes, IEEE Transactions on Information Theory, vol. IT-38, pp. 111–119, 1992.
100. W. M. Kantor, On the Inequivalence of Generalized Preparata Codes, IEEE Transactions on Information Theory, vol. IT-29, pp. 345–348, 1983.
101. T. Kasami, S. Lin, and W. W. Peterson, Some Results on Weight Distributions of BCH Codes, IEEE Transactions on Information Theory, vol. IT-12, p. 274, 1966.
102. A. M. Kerdock, AClass of Low-Rate Nonlinear Codes, Information and Control, vol. 20, pp. 182–187, 1972.
103. C. Kirfel and R. Pellikaan, The Minimum Distance of Codes in an Array Coming From Telescopic Semigroups, Coding Theory and Algebraic Geometry: Proceedings of AGCT-4, Luminy, France, 1993.
104. C. Kirfel and R. Pellikaan, The Minimum Distance of Codes in an Array Coming From Telescopic Semigroups, IEEE Transactions on Information Theory, vol. IT-41, pp. 1720–1732, 1995.
105. F. Klein, Über die Transformation Siebenter Ordnung Die Elliptischen Functionen, Mathematics Annals, vol. 14, pp. 428–471, 1879.
106. R. Koetter, A Unified Description of an Error Locating Procedure for Linear Codes, Proceedings: Algebraic and Combinatorial Coding Theory, Voneshta Voda, Bulgaria, 1992.
107. R. Koetter, A Fast Parallel Berlekamp–Massey Type Algorithm for Hermitian Codes, Proceedings: Algebraic and Combinatorial Coding Theory, pp. 125–128, Nogorad, Russia, 1994.
108. R. Koetter, On Algebraic Decoding of Algebraic-Geometric and Cyclic Codes, Ph.D. Dissertation, Linköping University, Linköping, Sweden, 1996.
109. R. Koetter, On the Determination of Error Values for Codes from a Class of Maximal Curves, Proceedings of the 35th Allerton Conference on Communication, Control, and Computing, University of Illinois, Monticello, Illinois, 1997.
110. R. Koetter, A Fast Parallel Implementation of a Berlekamp–Massey Algorithm for Algebraic-Geometric Codes, IEEE Transactions on Information Theory, vol. IT-44, pp. 1353–1368, 1998.
111. P. V. Kumar and K. Yang, On the True Minimum Distance of Hermitian Codes, Coding Theory and Algebraic Geometry: Proceedings of AGCT-3, Lecture Notes in Mathematics, vol. 158, pp. 99–107, Springer, Berlin, 1992.
112. N. Lauritzen, Concrete Abstract Algebra, Cambridge University Press, Cambridge, 2003.
113. D. A. Leonard, Error-Locator Ideals for Algebraic-Geometric Codes, IEEE Transactions on Information Theory, vol. IT-41, pp. 819–824, 1995.
114. D. A. Leonard, A Generalized Forney Formula for Algebraic-Geometric Codes, IEEE Transactions on Information Theory, vol. IT-42, pp. 1263–1269, 1996.
115. R. J. McEliece, The Guruswami-Sudan Decoding Algorithm for Reed–Solomon Codes, IPN Progress Report, pp. 42–153, 2003.
116. F. J. MacWilliams, A Theorem on the Distribution of Weights in a Systematic Code, Bell System Technical Journal, vol. 42, pp. 79–94, 1963.
117. D. M. Mandelbaum, Decoding of Erasures and Errors for Certain Reed–Solomon Codes by Decreased Redundancy, IEEE Transactions on Information Theory, vol. IT-28, pp. 330–336, 1982.
118. Yu. I. Manin, What is the Maximum Number of Points on a Curve Over F2 ? Journal of the Faculty of Science, University of Tokyo, vol. 28, pp. 715–720, 1981.
119. J. L. Massey, Shift-Register Synthesis and BCH Decoding, IEEE Transactions on Information Theory, vol. IT-15, pp. 122–127, 1969.
120. J. L. Massey, Codes and Ciphers: Fourier and Blahut, in Codes, Curves, and Signals: Common Threads in Communication, A. Vardy, editor, Kluwer Academic, Norwell, MA, pp. 1998.
121. H. F. Mattson, Jr. and E. F. Assmus, Jr., Research Program to Extend the Theory of Weight Distribution and Related Problems for Cyclic Error-Correcting Codes, Report AFCRL-64-605, Air Force Cambridge Research Laboratories, Bedford, MA, July 1964.
122. H. F. Mattson, Jr. and G. Solomon, ANew Treatment of Bose–Chaudhuri Codes, Journal of the Society of Industrial and Applied Mathematics, vol. 9, pp. 654–699, 1961.
123. M. Nadler, A 32-Point n equals 12, d equals 5 Code, IRE Transactions on Information Theory, vol. IT-8, p. 58, 1962.
124. A. W. Nordstrom and J. P. Robinson, An Optimum Linear Code, Information and Control, vol. 11, pp. 613–616, 1967.
125. M. E. O’Sullivan, Decoding of Codes Defined by a Single Point on a Curve, IEEE Transactions on Information Theory, vol. IT-41, pp. 1709–1719, 1995.
126. M. E. O’Sullivan, Decoding Hermitian Codes Beyond (dmin − 1)/2, Proceedings of the IEEE International Symposium on Information Theory, Ulm, Germany, 1997.
127. M. E. O’Sullivan, The Key Equation for One-Point Codes and Efficient Evaluation, Journal of Pure and Applied Algebra, vol. 169, pp. 295–320, 2002.
128. R. H. Paschburg, Software Implementation of Error-Correcting Codes, M.S. Thesis, University of Illinois, Urbana, Illinois, 1974.
129. R. Pellikaan, On the Decoding by Error Location and the Number of Dependent Error Positions, Discrete Mathematics, vols. 106–107, pp. 369–381, 1992.
130. R. Pellikaan, The Klein Quartic, the Fano Plane, and Curves Representing Designs, in Codes, Curves, and Signals: Common Threads in Communication, A. Vardy, editor, Kluwer Academic, Norwell, MA, pp. 1998.
131. W. W. Peterson, Encoding and Error-Correction Procedures for the Bose–Chaudhuri Codes, IEEE Transactions on Information Theory, vol. IT-6, pp. 459–470, 1960.
132. V. Pless, On the Uniqueness of the Golay Codes, Journal of Combinatorial Theory, vol. 5, pp. 215–228, 1968.
133. V. Pless and Z. Qian, Cyclic Codes and Quadratic Residue Codes over Z4, IEEE Transactions on Information Theory, vol. IT-42, pp. 1594–1600, 1996.
134. A. Poli and L. Huguet, Error Correcting Codes, Theory and Applications, Mason, Paris, 1989.
135. S. C. Porter, Decoding Codes Arising from Goppa’s Construction on Algebraic Curves, Ph.D. Dissertation, Yale University, New Haven, 1988.
136. S. C. Porter, B.-Z. Shen, and R. Pellikaan, Decoding Geometric Goppa Codes Using an Extra Place, IEEE Transactions on Information Theory, vol. IT-38, no. 6, pp. 1663–1676, 1992.
137. E. Prange, Cyclic Error-Correcting Codes in Two Symbols, Report AFCRC-TN-57-103, Air Force Cambridge Research Center, Cambridge, MA, 1957.
138. E. Prange, Some Cyclic Error-Correcting Codes with Simple Decoding Algorithms, Report AFCRC-TN-58-156, Air Force Cambridge Research Center, Bedford, MA, 1958.
139. F. P. Preparata, A Class of Optimum Nonlinear Double-Error-Correcting Codes, Information and Control, vol. 13, pp. 378–400, 1968.
140. Z. Qian, Cyclic Codes over Z4, Ph.D. Dissertation, University of Illinois, Chicago, 1996.
141. C. M. Rader, Discrete Fourier Transforms When the Number of Data Samples is Prime, Proceedings of the IEEE, vol. 56, pp. 1107–1108, 1968.
142. K. Ranto, Z4 -Goethals Codes, Decoding, and Designs, Ph.D. Dissertation, University of Turku, Finland, 2002.
143. I. S. Reed and G. Solomon, Polynomial Codes Over Certain Finite Fields, Journal of the Society of Industrial and Applied Mathematics, vol. 8, pp. 300–304, 1960.
144. C. Roos, A New Lower Bound for the Minimum Distance of a Cyclic Code, IEEE Transactions on Information Theory, vol. IT-29, pp. 330–332, 1983.
145. R. M. Roth and A. Lempel, Application of Circulant Matrices to the Construction and Decoding of Linear Codes, IEEE Transactions on Information Theory, vol. IT-36, pp. 1157–1163, 1990.
146. R. M. Roth and G. Ruckenstein, Efficient Decoding of Reed–Solomon Codes Beyond Half the Minimum Distance, IEEE Transactions on Information Theory, vol. IT-46, pp. 246–257, 2000.
147. K. Saints and C. Heegard, On Hyperbolic Cascaded Reed–Solomon Codes, Proceedings of Tenth International Symposium on Applied Algebra, Algebraic Algorithms, and Error-Correcting Codes, San Juan, Puerto Rico, 1993.
148. K. Saints and C. Heegard, On Hyperbolic Cascade Reed–Solomon Codes, Proceedings of AAECCC-10, Lecture Notes in Computer Science, vol. 673, pp. 291–393, Springer, Berlin, 1993.
149. K. Saints and C. Heegard, Algebraic-Geometric Codes and Multidimensional Cyclic Codes: AUnified Theory Using Gröbner Bases, IEEE Transactions on Information Theory, vol. IT-41, pp. 1733– 1751, 1995.
150. S. Sakata, Finding a Minimal Set of Linear Recurring Relations Capable of Generating a Given Finite Two-Dimensional Array, Journal of Symbolic Computation, vol. 5, pp. 321–337, 1988.
151. S. Sakata, Extension of the Berlekamp–Massey Algorithm to N Dimensions, Information and Computation, vol. 84, pp. 207–239, 1990.
152. S. Sakata, H. E. Jensen, and T. Høholdt, Generalized Berlekamp–Massey Decoding of Algebraic-Geometric Codes up to Half the Feng–Rao Bound, IEEE Transactions on Information Theory, vol. IT-41, pp. 1762–1768, 1995.
153. S. Sakata, J. Justesen, Y. Madelung, H. E. Jensen, and T. Høholdt, Fast Decoding of Algebraic-Geometric Codes up to the Designed Minimum Distance, IEEE Transactions on Information Theory, vol. IT-41, pp. 1672–1677, 1995.
154. D. V. Sarwate, Semi-fast Fourier Transforms over GF(2 m), IEEE Transactions on Computers, vol. C-27, pp. 283–284, 1978.
155. T. Schaub, A Linear Complexity Approach to Cyclic Codes, Doctor of Technical Sciences Dissertation, ETH Swiss Federal Institute of Technology, 1988.
156. J. Schwartz, Fast Probabilistic Algorithms for Verification of Polynomial Identities, Journal of the Association of Computing Machinery, vol. 27, pp. 701–717, 1980.
157. J. P. Serre, Sur les nombres des points rationnels d’une courbe algebrique sur un corps fini, Comptes Rendus Academy of Science, Paris, vol. 297, serie I, pp. 397–401, 1983.
158. B.-Z. Shen, Algebraic-Geometric Codes and Their Decoding Algorithms, Ph.D. Thesis, Eindhoven University of Technology, 1992.
159. J. Simonis, The [23, 14, 5] Wagner Code is Unique, Report of the Faculty of Technical Mathematics and Informatics Delft University of Technology, Delft, pp. 96–166, 1996.
160. J. Simonis, The [23, 14, 5] Wagner Code Is Unique, Discrete Mathematics, vol. 213, pp. 269–282, 2000.
161. A. N. Skorobogatov and S. G. Vlǎdut, On the Decoding of Algebraic-Geometric Codes, IEEE Transactions on Information Theory, vol. IT-36, pp. 1461–1463, 1990.
162. P. Solé, A Quaternary Cyclic Code, and a Family of Quadriphase Sequences with Low Correlation Properties, Lecture Notes in Computer Science, vol. 388, pp. 193–201, 1989.
163. M. Srinivasan and D. V. Sarwate, Malfunction in the Peterson–Zierler–Gorenstein Decoder, IEEE Transactions on Information Theory, vol. IT-40, pp. 1649–1653, 1994.
164. H. Stichtenoth, A Note on Hermitian Codes over GF(q2), IEEE Transactions on Information Theory, vol. IT-34, pp. 1345–1348, 1988.
165. H. Stichtenoth, On the Dimension of Subfield Subcodes, IEEE Transactions on Information Theory, vol. IT-36, pp. 90–93, 1990.
166. H. Stichtenoth, Algebraic Function Fields and Codes, Springer-Verlag, Berlin, 1993.
167. M. Sudan, Decoding of Reed–Solomon Codes Beyond the Error-Correction Bound, Journal of Complexity, vol. 13, pp. 180–183, 1997.
168. M. Sudan, Decoding of Reed–Solomon Codes Beyond the Error-Correction Diameter, Proceedings of the 35th Annual Allerton Conference on Communication, Control, and Computing, University of Illinois at Urbana-Champaign, 1997.
169. Y. Sugiyama, M. Kasahara, S. Hirasawa, and T. Namekawa, A Method for Solving Key Equations for Decoding Goppa Codes, Information and Control, vol. 27, pp. 87–99, 1975.
170. L. H. Thomas, Using a Computer to Solve Problems in Physics, in Applications of Digital Computers, Ginn and Co., Boston, MA, 1963.
171. H. J. Tiersma, Remarks on Codes From Hermitian Curves, IEEE Transactions on Information Theory, vol. IT-33, pp. 605–609, 1987.
172. M. A. Tsfasman, S. G. Vlădut, and T. Zink, Modular Curves, Shimura Curves and Goppa Codes, Better Than Varshamov–Gilbert Bound, Mathematische Nachrichten, vol. 104, pp. 13–28, 1982.
173. B. L. van der Waerden, Modern Algebra (2 volumes), translated by F. Blum and T. J. Benac, Frederick Ungar, New York, 1950 and 1953.
174. J. H. van Lint and T. A. Springer, Generalized Reed–Solomon Codes From Algebraic Geometry, IEEE Transactions on Information Theory, vol. IT-33, pp. 305–309, 1987.
175. J. H. van Lint and R. M. Wilson, On the Minimum Distance of Cyclic Codes, IEEE Transactions on Information Theory, vol. IT-32, pp. 23–40, 1986.
176. T. J. Wagner, A Remark Concerning the Minimum Distance of Binary Group Codes, IEEE Transactions on Information Theory, vol. IT-11, p. 458, 1965.
177. T. J. Wagner, ASearch Technique for Quasi-Perfect Codes, Information and Control, vol. 9, pp. 94–99, 1966.
178. R. J. Walker, Algebraic Curves, Dover, New York, 1962.
179. L. Welch and E. R. Berlekamp, Error Correction for Algebraic Block Codes, U.S. Patent 4 633 470, 1983.
180. J. K. Wolf, Adding Two Information Symbols to Certain Nonbinary BCH Codes and Some Applications, Bell System Technical Journal, vol. 48, pp. 2405–2424, 1969.
181. J. Wu and D. J. Costello, Jr., New Multi-Level Codes over GF(q), IEEE Transactions on Information Theory, vol. IT-38, pp. 933–939, 1992.
182. C. Xing, On Automorphism Groups of the Hermitian Codes, IEEE Transactions on Information Theory, vol. IT-41, pp. 1629–1635, 1995.
183. T. Yaghoobian and I. F. Blake, Hermitian Codes as Generalized Reed–Solomon Codes, Designs, Codes, and Cryptography, vol. 2, pp. 15–18, 1992.
184. K. Yang and P. V. Kumar, On the True Minimum Distance of Hermitian Codes, in Lecture Notes in Mathematics, H. Stichtenoth and M. A. Tsfasman, editors, vol. 1518, pp. 99–107, Springer, Berlin, 1988.