Introduction to coding theory

Introduction to Coding Theory

Volumn 9780521845045, Issue , 2006, Pages 1-566

  Roth, Ron M ^a  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

BLOCK CODES; CONVOLUTIONAL CODES; DIGITAL STORAGE; REED-SOLOMON CODES;

CODING THEORY; DECODING ALGORITHM; DEGREE OF RELIABILITY; ERROR CORRECTING CODE; FINITE FIELDS; LINEAR CODES; STORAGE SYSTEMS; THEORETICAL FOUNDATIONS;

CONCATENATED CODES;

EID: 84924094672     PISSN: None     EISSN: None     Source Type: Book    
DOI: 10.1017/CBO9780511808968     Document Type: Book

References (406)

1. L.M. Adleman, The function field sieve, Proc. 1st Int'l Symp. Algorithmic Number Theory (ANTS-I), Ithaca, New York (1994), L.M. Adleman, M.- D. A. Huang (Editors), Lecture Notes in Computer Science, Volume 877, Springer, Berlin, 1994, pp. 108-121 [3].
2. R.L. Adler, D. Coppersmith, M. Hassner, Algorithms for sliding block codes-an application of symbolic dynamics to information theory, IEEE Trans. Inform. Theory, 29 (1983), 5-22 [14].
3. S.S. Agaian, Hadamard Matrices and Their Applications, Lecture Notes in Mathematics, Volume 1168, Springer, Berlin, 1985 [2].
4. M. Agrawal, S. Biswas, Primality and identity testing via Chinese remaindering, J. ACM, 50 (2003), 429-443 [3].
5. M. Agrawal, N. Kayal, N. Saxena, PRIMES is in P, Ann. Math., 160 (2004), 781-793 [3].
6. A.V. Aho, J.E. Hopcroft, J.D. Ullman, The Design and Analysis of Computer Algorithms, Addison-Wesley, Reading, Massachusetts, 1974 [3, 5, 6].
7. M. Alekhnovich, Linear Diophantine equations over polynomials and soft decoding of Reed-Solomon codes, IEEE Trans. Inform. Theory, 51 (2005), 2257-2265 [9].
8. N. Alon, Eigenvalues and expanders, Combinatorica, 6 (1986), 83-96 [13].
9. N. Alon, Eigenvalues, geometric expanders, sorting in rounds, and Ramsey theory, Combinatorica, 6 (1986), 207-219 [13].
10. N. Alon, J. Bruck, J. Naor, M. Naor, R.M. Roth, Construction of asymptotically good low-rate error-correcting codes through pseudo-random graphs, IEEE Trans. Inform. Theory, 38 (1992), 509-516 [12, 13].
11. N. Alon, F.R.K. Chung, Explicit construction of linear sized tolerant networks, Discrete Math., 72 (1988), 15-19 [13].
12. N. Alon, M. Luby, A linear time erasure-resilient code with nearly optimal recovery, IEEE Trans. Inform. Theory, 42 (1996), 1732-1736 [13].
13. N. Alon, V.D. Milman, Eigenvalues, expanders, and superconcentrators, Proc. 25th Annual IEEE Symp. Foundations of Computer Science (FOCS'1984), Singer Island, Florida (1984), IEEE Computer Society Press, Los Alamitos, California, 1984, pp. 320-322 [13].
14. N. Alon, V.D. Milman, λ1, isoperimetric inequalities for graphs, and superconcentrators, J. Comb. Theory B, 38 (1985), 73-88 [13].
15. N. Alon, Y. Roichman, Random Cayley graphs and expanders, Random Struct. Algorithms, 5 (1994), 271-284 [13].
16. N. Alon, J.H. Spencer, The Probabilistic Method, Second Edition, Wiley, New York, 2000 [13].
17. S. Arora, L. Babai, J. Stern, Z. Sweedyk, The hardness of approximate optima in lattices, codes, and systems of linear equations, J. Comput. Syst. Sci., 54 (1997), 317-331 [2].
18. E.F. Assmus, Jr., J.D. Key, Designs and their Codes, Cambridge Tracts in Mathematics, Volume 103, Cambridge University Press, Cambridge, 1992 [2, 5, 8].
19. J. Astola, On the non-existence of certain perfect Lee-error-correcting codes, Ann. Univ. Turku A 1, 167 (1975), 1-13 [10].
20. J. Astola, On perfect codes in the Lee metric, Ann. Univ. Turku A 1, 176 (1978), 1-56 [10].
21. J. Astola, A note on perfect Lee-codes over small alphabets, Discrete Appl. Math., 4 (1982), 227-228 [10].
22. J.T. Astola, An Elias-type bound for Lee-codes over large alphabets and its application to perfect codes, IEEE Trans. Inform. Theory, 28 (1982), 111-113 [10].
23. J.T. Astola, Concatenated codes for the Lee metric, IEEE Trans. Inform. Theory, 28 (1982), 778-779 [10].
24. J. Astola, On the asymptotic behaviour of Lee-codes, Discrete Appl. Math., 8 (1984), 13-23 [10].
25. D. Augot, L. Pecquet, A Hensel lifting to replace factorization in listdecoding of algebraic-geometric and Reed-Solomon codes, IEEE Trans. Inform. Theory, 46 (2000), 2605-2614 [9].
26. L. Babai, Spectra of Cayley graphs, J. Comb. Theory B, 27 (1979), 180-189 [13].
27. L. Babai, H. Oral, K.T. Phelps, Eulerian self-dual codes, SIAM J. Discrete Math., 7 (1994), 325-330 [2].
28. A. Barg, G.D. Forney, Jr., Random codes: minimum distances and error exponents, IEEE Trans. Inform. Theory, 48 (2002), 2568-2573 [4].
29. A. Barg, J. Justesen, C. Thommesen, Concatenated codes with fixed inner code and random outer code, IEEE Trans. Inform. Theory, 47 (2001), 361-365 [12].
30. A. Barg, G. Zémor, Error exponents of expander codes, IEEE Trans. Inform. Theory, 48 (2002), 1725-1729 [13].
31. A. Barg, G. Zémor, Concatenated codes: serial and parallel, IEEE Trans. Inform. Theory, 51 (2005), 1625-1634 [13].
32. L.A. Bassalygo, A necessary condition for the existence of perfect codes in the Lee metric, Math. Notes, 15 (1974), 178-181 [10].
33. M. Ben-Or, Probabilistic algorithms in finite fields, Proc. 22nd Annual IEEE Symp. Foundations of Computer Science (FOCS'1981), Nashville, Tennessee (1981), IEEE Computer Society Press, Los Alamitos, California, 1981, pp. 394-398 [3].
34. C. Berge, Hypergraphs: Combinatorics of Finite Sets, North-Holland, Amsterdam, 1989 [13].
35. E.R. Berlekamp, Factoring polynomials over large finite fields, Math. Comput., 24 (1970), 713-735 [3].
36. E.R. Berlekamp, Long primitive binary BCH codes have distance d ∼ 2n lnR-1/log n · · ·, IEEE Trans. Inform. Theory, 18 (1972), 415-426 [5, 8].
37. E.R. Berlekamp, Algebraic Coding Theory, Revised Edition, Aegean Park Press, Laguna Hills, California, 1984 [Prf., 2, 3, 5, 6, 8, 10].
38. E.R. Berlekamp, Bounded distance +1 soft-decision Reed-Solomon decoding, IEEE Trans. Inform. Theory, 42 (1996), 704-720 [6, 9].
39. E.R. Berlekamp, R.J. McEliece, H.C.A. van Tilborg, On the inherent intractability of certain coding problems, IEEE Trans. Inform. Theory, 24 (1978), 384-386 [2].
40. E.R. Berlekamp, H. Rumsey, G. Solomon, On the solution of algebraic equations over finite fields, Inform. Control, 10 (1967), 553-564 [3].
41. S.D. Berman, On the theory of group codes, Cybernetics, 3 (1967), 25-31 [8].
42. C. Berrou, A. Glavieux, Near optimum error correcting coding and decoding: turbo-codes, IEEE Trans. Commun., 44 (1996), 1261-1271 [14].
43. C. Berrou, A. Glavieux, P. Thitimajshima, Near Shannon limit errorcorrecting coding and decoding: turbo-codes, Conf. Record 1993 IEEE Int'l Conf. Communications (ICC'1993), Geneva, Switzerland (1993), pp. 1064- 1070 [14].
44. A. Bhattacharyya, On a measure of divergence between two statistical populations defined by their probability distributions, Bull. Calcutta Math. Soc., 35 (1943), 99-110 [1].
45. N.L. Biggs, Discrete Mathematics, Second Edition, Oxford University Press, Oxford, 2002 [11].
46. S.R. Blackburn, Fast rational interpolation, Reed-Solomon decoding, and the linear complexity profile of sequences, IEEE Trans. Inform. Theory, 43 (1997), 537-548 [9].
47. R.E. Blahut, Theory and Practice of Error Control Codes, Addison-Wesley, Reading, Massachusetts, 1983 [Prf., 3, 6, 14].
48. R.E. Blahut, A universal Reed-Solomon decoder, IBM J. Res. Develop., 28 (1984), 150-158 [3, 6].
49. R.E. Blahut, Algebraic Methods for Signal Processing and Communications Coding, Springer, New York, 1992 [3].
50. I.F. Blake, R.C. Mullin, The Mathematical Theory of Coding, Academic Press, New York, 1975 [Prf.].
51. M. Blaum, J. Brady, J. Bruck, J. Menon, EVENODD: an efficient scheme for tolerating double disk failures in RAID architectures, IEEE Trans. Comput., 445 (1995), 192-202 [11].
52. M. Blaum, J. Bruck, MDS array codes for correcting a single criss-cross error, IEEE Trans. Inform. Theory, 46 (2000), 1068-1077 [11].
53. M. Blaum, J. Bruck, A. Vardy, MDS array codes with independent parity symbols, IEEE Trans. Inform. Theory, 42 (1996), 529-542 [11].
54. M. Blaum, R.M. Roth, New array codes for multiple phased burst correction, IEEE Trans. Inform. Theory, 39 (1993), 66-77 [11].
55. M. Blaum, R.M. Roth, On lowest density MDS codes, IEEE Trans. Inform. Theory, 45 (1999), 46-59 [11].
56. V.M. Blinovskii, Covering the Hamming space with sets translated by linear code vectors, Probl. Inform. Transm., 26 (1990), 196-201 [4].
57. E.L. Blokh, V.V. Zyablov, Existence of linear concatenated binary codes with optimal correcting properties, Probl. Inform. Transm., 9 (1973), 271- 276 [12].
58. E.L. Blokh, V.V. Zyablov, Coding of generalized concatenated codes, Probl. Inform. Transm., 10 (1974), 218-222 [5, 12].
59. E.L. Blokh, V.V. Zyablov, Linear Concatenated Codes, Nauka, Moscow, 1982 (in Russian) [5, 12].
60. M.A. de Boer, Almost MDS codes, Designs Codes Cryptogr., 9 (1996), 143-155 [11].
61. B. Bollobás, Modern Graph Theory, Springer, New York, 1998 [13].
62. R.C. Bose, D.K. Ray-Chaudhuri, On a class of error correcting binary group codes, Inform. Control, 3 (1960), 68-79 [5].
63. R.C. Bose, D.K. Ray-Chaudhuri, Further results on error correcting binary group codes, Inform. Control, 3 (1960), 279-290 [5].
64. P.A.H. Bours, Construction of fixed-length insertion/deletion correcting runlength-limited codes, IEEE Trans. Inform. Theory, 40 (1994), 1841-1856 [10].
65. D.W. Boyd, On a problem of Byrnes concerning polynomials with restricted coefficients, Math. Comput., 66 (1997), 1697-1703 [10].
66. D.W. Boyd, On a problem of Byrnes concerning polynomials with restricted coefficients, II, Math. Comput., 71 (2002), 1205-1217 [10].
67. D. Le Brigand, On computational complexity of some algebraic curves over finite fields, Proc. 3rd Int'l Conf. Algebraic Algorithms and Error Correcting Codes (AAECC-3), Grenoble, France (1985), J. Calmet (Editor), Lecture Notes in Computer Science, Volume 229, Springer, Berlin, 1986, pp. 223-227 [4].
68. R.A. Brualdi, H.J. Ryser, Combinatorial Matrix Theory, Cambridge University Press, Cambridge, 1991 [11, 13].
69. J. Bruck, M. Naor, The hardness of decoding linear codes with preprocessing, IEEE Trans. Inform. Theory, 36 (1990), 381-385 [2].
70. D. Burshtein, M. Krivelevich, S. Litsyn, G. Miller, Upper bounds on the rate of LDPC codes, IEEE Trans. Inform. Theory, 48 (2002), 2437- 2449 [13].
71. D. Burshtein, G. Miller, Expander graph arguments for message-passing algorithms, IEEE Trans. Inform. Theory, 47 (2001), 782-790 [13].
72. D. Burshtein, G. Miller, Bounds on the performance of belief propagation decoding, IEEE Trans. Inform. Theory, 48 (2002), 112-122 [13].
73. K.A. Bush, Orthogonal arrays of index unity, Ann. Math. Stat., 23 (1952) 426-434 [5].
74. L. Carlitz, S. Uchiyama, Bounds for exponential sums, Duke Math. J., 24 (1957), 37-41 [5].
75. L.R.A. Casse, A solution to Beniamino Segre's "Problem Ir, q" for q even, Atti Accad. Naz. Lincei Rend., 46 (1969), 13-20 [11].
76. L.R.A. Casse, D.G. Glynn, The solution to Beniamino Segre's problem Ir, q, r = 3, q = 2h, Geom. Dedic., 13 (1982), 157-163 [11].
77. G. Castagnoli, J.L. Massey, P.A. Schoeller, N. von Seemann, On repeated-root cyclic codes, IEEE Trans. Inform. Theory, 37 (1991), 337-342 [8].
78. U. Cheng, On the continued fraction and Berlekamp's algorithm, IEEE Trans. Inform. Theory, 30 (1984), 541-544 [6].
79. J.C.-Y. Chiang, J.K. Wolf, On channels and codes for the Lee metric, Inform. Control, 19 (1971), 159-173 [10].
80. R.T. Chien, Cyclic decoding procedures for Bose-Chaudhuri-Hocquenghem codes, IEEE Trans. Inform. Theory, 10 (1964), 357-363 [6].
81. D.V. Chudnovsky, G.V. Chudnovsky, Algebraic complexity and algebraic curves over finite fields, J. Complexity, 4 (1988), 285-316 [3].
82. G. Cohen, I. Honkala, S. Litsyn, A. Lobstein, Covering Codes, North- Holland, Amsterdam, 1997 [4].
83. G.D. Cohen, M.G. Karpovsky, H.F. Mattson, Jr., J.R. Schatz, Covering radius-survey and recent results, IEEE Trans. Inform. Theory, 31 (1985), 328-343 [4].
84. G.D. Cohen, A.C. Lobstein, N.J.A. Sloane, Further results on the covering radius of codes, IEEE Trans. Inform. Theory, 32 (1986), 680-694 [4].
85. C.J. Colbourn, J.H. Dinitz (Editors), The CRC Handbook of Combinatorial Designs, CRC Press, New York, 1996 [11].
86. D. Coppersmith, Fast evaluation of logarithms in fields of characteristic two, IEEE Trans. Inform. Theory, 30 (1984), 587-594 [3].
87. D. Coppersmith, A.M. Odlyzko, R. Schroeppel, Discrete logarithms in GF(p), Algorithmica, 1 (1986), 1-15 [3].
88. T.M. Cover, J.A. Thomas, Elements of Information Theory, Wiley, New York, 1991 [1, 4].
89. I. Csiszár, J. Körner, Information Theory: Coding Theorems for Discrete Memoryless Systems, Second Edition, Akadémiai Kiadó, Budapest, 1997 [1, 4].
90. D. Dabiri, I.F. Blake, Fast parallel algorithms for decoding Reed-Solomon codes based on remainder polynomials, IEEE Trans. Inform. Theory, 41 (1995), 873-885 [9].
91. H. Davenport, Multiplicative Number Theory, Third Edition, revised by H.L. Montgomery, Springer, New York, 2000 [13].
92. P.J. Davis, Circulant Matrices, Second Edition, Chelsea, New York, 1994 [10].
93. V.A. Davydov, Codes correcting errors in the modulus metric, Lee metric, and operator errors, Probl. Inform. Transm., 29 (1993), 208-216 [10].
94. P. Delsarte, Bounds for unrestricted codes, by linear programming, Philips Res. Rep., 27 (1972), 272-289 [4].
95. P. Delsarte, An algebraic approach to the association schemes of coding theory, Philips Res. Rep. Suppl., 10 (1973) [4].
96. P. Delsarte, Four fundamental parameters of a code and their combinatorial significance, Inform. Control, 23 (1973), 407-438 [4].
97. P. Delsarte, On subfield subcodes of modified Reed-Solomon codes, IEEE Trans. Inform. Theory, 21 (1975), 575-576 [5].
98. P. Delsarte, Bilinear forms over a finite field, with applications to coding theory, J. Comb. Theory A, 25 (1978), 226-241 [11].
99. P. Delsarte, J.-M. Goethals, Alternating bilinear forms over GF(q), J. Comb. Theory A, 19 (1975), 26-50 [10].
100. P. Delsarte, P. Piret, Algebraic constructions of Shannon codes for regular channels, IEEE Trans. Inform. Theory, 28 (1982), 593-599 [12].
101. P. Delsarte, P. Piret, Do most binary linear codes achieve the Goblick bound on the covering radius?, IEEE Trans. Inform. Theory, 32 (1986), 826- 828 [4].
102. J. Dénes, A.D. Keedwell, Latin Squares and their Applications, Academic Press, New York, 1974 [11].
103. J. Dénes, A.D. Keedwell, Latin Squares-New Developments in the Theory and Applications, Annals of Discrete Mathematics, Volume 46, North- Holland, Amsterdam, 1991 [11].
104. O. Deutsch, Decoding methods for Reed-Solomon codes over polynomial rings, M.Sc. dissertation, Computer Science Department, Technion, Haifa, Israel, 1994 (in Hebrew) [6, 11].
105. R. Diestel, Graph Theory, Second Edition, Springer, New York, 2000 [13].
106. C. Ding, T. Helleseth, W. Shan, On the linear complexity of Legendre sequences, IEEE Trans. Inform. Theory, 44 (1998), 1276-1278 [7].
107. S.M. Dodunekov, I.N. Landjev, On near-MDS codes, J. Geom., 54 (1995), 30-43 [11].
108. S.M. Dodunekov, I.N. Landjev, Near-MDS codes over some small fields, Discrete Math., 213 (2000), 55-65 [11].
109. J.L. Dornstetter, On the equivalence between Berlekamp's and Euclid's algorithms, IEEE Trans. Inform. Theory, 33 (1987), 428-431 [6].
110. I. Dumer, Concatenated codes and their multilevel generalizations, in Handbook of Coding Theory, Volume II, V.S. Pless, W.C. Huffman (Editors), North-Holland, Amsterdam, 1998, pp. 1911-1988 [12].
111. I. Dumer, D. Micciancio, M. Sudan, Hardness of approximating the minimum distance of a linear code, IEEE Trans. Inform. Theory, 49 (2003), 22-37 [2].
112. A. Dür, The automorphism groups of Reed-Solomon codes, J. Comb. Theory A, 44 (1987), 69-82 [5].
113. A. Dür, On linear MDS codes of length q+1 over GF(q) for even q, J. Comb. Theory A, 49 (1988), 172-174 [8].
114. E. Eleftheriou, R. Cideciyan, On codes satisfying Mth-order running digital sum constraints, IEEE Trans. Inform. Theory, 37 (1991), 1294-1313 [10].
115. P. Elias, Error-free coding, IRE Trans. Inform. Theory, 4 (1954), 29-37 [5].
116. P. Elias, Coding for noisy channels, IRE Int'l Conv. Rec., 1955, 37-46 [14].
117. P. Elias, Error-correcting codes for list decoding, IEEE Trans. Inform. Theory, 37 (1991), 5-12 [9].
118. T. Etzion, A. Vardy, Perfect binary codes: constructions, properties, and enumeration, IEEE Trans. Inform. Theory, 40 (1994), 754-763 [4].
119. A. Faldum, W. Willems, Codes of small defect, Designs Codes Cryptogr., 10 (1997), 341-350 [11].
120. G. Falkner, W. Heise, B. Kowol, E. Zehendner, On the existence of cyclic optimal codes, Atti. Sem. Mat. Fis. Univ. Modena, 28 (1979), 326-341 [8].
121. R.M. Fano, A heuristic discussion of probabilistic decoding, IEEE Trans. Inform. Theory, 9 (1963), 64-74 [14].
122. P.G. Farrell, A survey of array error control codes, Eur. Trans. Telecommun. Relat. Technol., 3 (1992), 441-454 [5].
123. U. Feige, D. Micciancio, The inapproximability of lattice and coding problems with preprocessing, Proc. 17th Annual IEEE Conf. Computational Complexity (CCC'2002), Montréal, Québec (2002), IEEE Computer Society Press, Los Alamitos, California, 2002, pp. 44-52 [2].
124. G.-L. Feng, Two fast algorithms in the Sudan decoding procedure, 37th Annual Allerton Conf. Communication, Control, and Computing, Urbana- Champaign, Illinois (1999), pp. 545-554 [9].
125. G.-L. Feng, K.K. Tzeng, A generalized Euclidean algorithm for multisequence shift-register synthesis, IEEE Trans. Inform. Theory, 35 (1989) 584- 594 [6].
126. G.-L. Feng, K.K. Tzeng, A generalization of the Berlekamp-Massey algorithm for multisequence shift-register synthesis with applications to decoding cyclic codes, IEEE Trans. Inform. Theory, 37 (1991) 1274-1287 [6].
127. P. Fitzpatrick, G.H. Norton, Finding a basis for the characteristic ideal of an n-dimensional linear recurring sequence, IEEE Trans. Inform. Theory, 36 (1990), 1480-1487 [6].
128. P. Fitzpatrick, G.H. Norton, The Berlekamp-Massey algorithm and linear recurring sequences over a factorial domain, Appl. Algebra Eng. Commun. Comput., 6 (1995) 309-323 [6].
129. G.D. Forney, Jr., On decoding BCH codes, IEEE Trans. Inform. Theory, 11 (1965) 549-557 [6].
130. G.D. Forney, Jr., Concatenated Codes, MIT Press, Cambridge, Massachusetts, 1966 [4, 5, 12].
131. G.D. Forney, Jr., Generalized minimum distance decoding, IEEE Trans. Inform. Theory, 12 (1966) 125-131 [12].
132. G.D. Forney, Jr., Convolutional codes I: algebraic structure, IEEE Trans. Inform. Theory, 16 (1970), 720-738 (see the correction in IEEE Trans. Inform. Theory, 17 (1971), 360) [14].
133. G.D. Forney, Jr., Convolutional codes II: maximum-likelihood decoding, Inform. Control, 25 (1974), 222-266 [14].
134. G.D. Forney, Jr., Convolutional codes III: sequential decoding, Inform. Control, 25 (1974), 267-297 [14].
135. G. Freiman, S. Litsyn, Asymptotically exact bounds on the size of highorder spectral-null codes, IEEE Trans. Inform. Theory, 45 (1999), 1798-1807 [10].
136. E.M. Gabidulin, Theory of codes with maximum rank distance, Probl. Inform. Transm., 21 (1985), 1-12 [11].
137. E.M. Gabidulin, Optimum codes correcting lattice errors, Problemy Peredachi Informatsii, 21 No. 2 (April-June 1985), 103-108 (in Russian) [11].
138. E.M. Gabidulin, V.I. Korzhik, Codes correcting lattice-pattern errors, Izvestiya VUZ Radioelektronika, 15 (1972), 492-498 (in Russian) [11].
139. R.G. Gallager, Low-density parity-check codes, IRE Trans. Inform. Theory, 8 (1962), 21-28 [13].
140. R.G. Gallager, Low-Density Parity-Check Codes, MIT Press, Cambridge, Massachusetts, 1963 [13].
141. R.G. Gallager, Information Theory and Reliable Communication, Wiley, New York, 1968 [1, 4].
142. F.R. Gantmacher, Matrix Theory, Volume II, Chelsea, New York, 1960 [13].
143. S. Gao, M.A. Shokrollahi, Computing roots of polynomials over function fields of curves, in Coding Theory and Cryptography: from Enigma and Geheimschreiber to Quantum Theory, D. Joyner (Editor), Springer, Berlin, 2000, pp. 214-228 [9].
144. M.R. Garey, D.S. Johnson, Computers and Intractability: a Guide to the Theory of NP-Completeness, Freeman, New York, 1979 [2].
145. J. von zur Gathen, J. Gerhard, Modern Computer Algebra, Cambridge University Press, Cambridge, 1999 [3, 5, 6].
146. J. Georgiades, Cyclic (q+1, k)-codes of odd order q and even dimension k are not optimal, Atti. Sem. Mat. Fis. Univ. Modena, 30 (1982), 284-285 [8].
147. E.N. Gilbert, A comparison of signalling alphabets, Bell Syst. Tech. J., 31 (1952), 504-522 [4].
148. D.G. Glynn, The non-classical 10-arc of PG(4, 9), Discrete Math., 59 (1986), 43-51 [11].
149. T.J. Goblick, Jr., Coding for a discrete information source with a distortion measure, Ph.D. dissertation, Department of Electrical Engineering, Massachusetts Institute of Technology, Cambridge, Massachusetts, 1962 [4].
150. M.J.E. Golay, Notes on digital coding, Proc. IEEE, 37 (1949), 657 [2, 4].
151. M.J.E. Golay, Anent codes, priorities, patents, etc., Proc. IEEE, 64 (1976), 572 [2].
152. O. Goldreich, R. Rubinfeld, M. Sudan, Learning polynomials with queries: the highly noisy case, SIAM J. Discrete Math., 13 (2000), 535-570 [4, 9].
153. S.W. Golomb, Shift Register Sequences, Revised Edition, Aegean Park Press, Laguna Hills, California, 1982 [3, 6, 7].
154. S.W. Golomb, E.C. Posner, Rook domains, Latin squares, affine planes, and error-distribution codes, IEEE Trans. Inform. Theory, 10 (1964), 196- 208 [11].
155. S.W. Golomb, L.R. Welch, Algebraic coding and the Lee metric, in Error Correcting Codes, H.B. Mann (Editor), Wiley, New York, 1968, pp. 175-194 [10].
156. S.W. Golomb, L.R. Welch, Perfect codes in the Lee metric and the packing of polyominoes, SIAM J. Appl. Math., 18 (1970), 302-317 [10].
157. V.D. Goppa, A new class of linear correcting codes, Probl. Inform. Transm., 6 (1970), 207-212 [5, 12].
158. V.D. Goppa, A rational representation of codes and (L, g)-codes, Probl. Inform. Transm., 7 (1971), 223-229 [5, 12].
159. V.D. Goppa, Binary symmetric channel capacity is attained with irreducible codes, Probl. Inform. Transm., 10 (1974), 89-90 [5, 12].
160. D.M. Gordon, Discrete logarithms in GF(p) using the number field sieve, SIAM J. Discrete Math., 6 (1993), 124-138 [3].
161. D.C. Gorenstein, N. Zierler, A class of error-correcting codes in pm symbols, J. Soc. Ind. Appl. Math., 9 (1961), 207-214 [5, 6].
162. R.L. Graham, N.J.A. Sloane, On the covering radius of codes, IEEE Trans. Inform. Theory, 31 (1985), 385-401 [4].
163. S. Gravier, M. Mollard, C. Payan, On the non-existence of 3- dimensional tiling in the Lee metric, Europ. J. Combinatorics, 19 (1998), 567-572 [10].
164. J.H. Griesmer, A bound for error-correcting codes, IBM J. Res. Develop., 4 (1960), 532-542 [4].
165. B.R. Gulati, E.G. Kounias, On bounds useful in the theory of symmetrical factorial designs, J. Roy. Statist. Soc. B, 32 (1970), 123-133 [11].
166. V. Guruswami, P. Indyk, Expander-based constructions of efficiently decodable codes, Proc. 42nd Annual IEEE Symp. Foundations of Computer Science (FOCS'2001), Las Vegas, Nevada (2001), IEEE Computer Society Press, Los Alamitos, California, 2001, pp. 658-667 [13].
167. V. Guruswami, P. Indyk, Linear-time codes to correct a maximum possible fraction of errors, 39th Annual Allerton Conf. Communication, Control, and Computing, Urbana-Champaign, Illinois (2001) [13].
168. V. Guruswami, P. Indyk, Near-optimal linear-time codes for unique decoding and new list-decodable codes over smaller alphabets, Proc. 34th Annual ACM Symp. Theory of Computing (STOC'2002), Montréal, Québec (2002), ACM, New York, 2002, pp. 812-821 [13].
169. V. Guruswami, M. Sudan, Improved decoding of Reed-Solomon and algebraic-geometry codes, IEEE Trans. Inform. Theory, 45 (1999), 1757- 1767 [9].
170. R.W. Hamming, Error detecting and error correcting codes, Bell Syst. Tech. J., 26 (1950), 147-160 [2, 4].
171. A.R. Hammons, Jr., P.V. Kumar, A.R. Calderbank, N.J.A. Sloane, P. Solé, The Z4-linearity of Kerdock, Preparata, Goethals, and related codes, IEEE Trans. Inform. Theory, 40 (1994), 301-319 [10].
172. G.H. Hardy, E.M. Wright, An Introduction to the Theory of Numbers, Fifth Edition, Oxford University Press, Oxford, 1979 [10, 13].
173. C.R.P. Hartmann, K.K. Tzeng, Generalizations of the BCH bound, Inform. Control, 20 (1972), 489-498 [8].
174. A. Hasan, V.K. Bhargava, T. Le-Ngoc, Algorithms and architectures for the design of a VLSI Reed-Solomon codec, in Reed-Solomon Codes and their Applications, S.B. Wicker, V.K. Bhargava (Editors), IEEE Press, New York, 1994, 60-107 [6].
175. H.J. Helgert, Alternant codes, Inform. Control, 26 (1974), 369-380 [5].
176. A.E. Heydtmann, J.M. Jensen, On the equivalence of the Berlekamp- Massey and the Euclidean algorithms for decoding, IEEE Trans. Inform. Theory, 46 (2000), 2614-2624 [6].
177. H.M. Hilden, D.G. Howe, E.J. Weldon, Jr., Shift error correcting modulation codes, IEEE Trans. Magn., 27 (1991), 4600-4605 [10].
178. F.S. Hillier, G.J. Lieberman, Introduction to Operations Research, Seventh Edition, McGraw-Hill, Boston, Massachusetts, 2001 [14].
179. S. Hirasawa, M. Kasahara, Y. Sugiyama, T. Namekawa, Certain generalizations of concatenated codes-exponential error bounds and decoding complexity, IEEE Trans. Inform. Theory, 26 (1980), 527-534 [5, 12].
180. S. Hirasawa, M. Kasahara, Y. Sugiyama, T. Namekawa, An improvement of error exponents at low rates for the generalized version of concatenated codes, IEEE Trans. Inform. Theory, 27 (1981), 350-352 [5, 12].
181. S. Hirasawa, M. Kasahara, Y. Sugiyama, T. Namekawa, Modified product codes, IEEE Trans. Inform. Theory, 30 (1984), 299-306 [5].
182. J.W.P. Hirschfeld, Projective Geometries over Finite Fields, Second Edition, Oxford University Press, Oxford, 1998 [11].
183. J.W.P. Hirschfeld, G. Korchmáros, On the embedding of an arc into a conic in a finite plane, Finite Fields Appl., 2 (1996), 274-292 [11].
184. J.W.P. Hirschfeld, G. Korchmáros, On the number of rational points on an algebraic curve over a finite field, Bull. Belg. Math. Soc. Simon Stevin, 5 (1998), 313-340 [11].
185. J.W.P. Hirschfeld, L. Storme, The packing problem in statistics, coding theory, and finite projective spaces, J. Statist. Planning Infer., 72 (1998), 355-380 [11].
186. J.W.P. Hirschfeld, L. Storme, The packing problem in statistics, coding theory and finite projective spaces: update 2001, in Finite Geometries: Proc. 4th Isle of Thorns Conference, Chelwood Gate, UK (2000), A. Blokhuis, J.W.P. Hirschfeld, D. Jungnickel, J.A. Thas (Editors), Developments in Mathematics, Volume 3, Kluwer, Dordrecht, 2001, pp. 201-246 [11].
187. J.W.P. Hirschfeld, J.A. Thas, General Galois Geometries, Oxford University Press, Oxford, 1991 [2, 11].
188. A. Hocquenghem, Codes correcteurs d'erreurs, Chiffres, 2 (1959), 147-156 [5].
189. J.E. Hopcroft, R. Motwani, J.D. Ullman, Introduction to Automata Theory, Languages, and Computation, Second Edition, Addison-Wesley, Boston, Massachusetts, 2001 [14].
190. L.-K. Hua, Introduction to Number Theory, Springer, Berlin, 1982 [10].
191. M.N. Huxley, The Distribution of Prime Numbers, Oxford University Press, London, 1972 [13].
192. I. Iizuka, M. Kasahara, T. Namekawa, Block codes capable of correcting both additive and timing errors, IEEE Trans. Inform. Theory, 26 (1980), 393-400 [10].
193. K.A.S. Immink, Coding Techniques for Digital Recorders, Prentice-Hall, New York, 1991 [5, 10].
194. K.A.S. Immink, Codes for Mass Data Storage Systems, Second Edition, Shannon Foundation Publishers, Eindhoven, The Netherlands, 2004 [10].
195. K.A.S. Immink, G.F.M. Beenker, Binary transmission codes with higher order spectral zeros at zero frequency, IEEE Trans. Inform. Theory, 33 (1987), 452-454 [10].
196. K. Ireland, M. Rosen, A Classical Introduction to Modern Number Theory, Second Edition, Springer, New York, 1990 [13].
197. F. Jelinek, Fast sequential decoding algorithm using a stack, IBM J. Res. Develop., 13 (1969), 675-685 [14].
198. R. Johannesson, K.S. Zigangirov, Fundamentals of Convolutional Coding, IEEE Press, New York, 1999 [14].
199. S.M. Johnson, A new upper bound for error-correcting codes, IRE Trans. Inform. Theory, 8 (1962), 203-207 [4].
200. J. Justesen, A class of constructive asymptotically good algebraic codes, IEEE Trans. Inform. Theory, 18 (1972), 652-656 [12].
201. J. Justesen, On the complexity of decoding Reed-Solomon codes, IEEE Trans. Inform. Theory, 22 (1976), 237-238 [6].
202. J. Justesen, T. Hoholdt, Bounds on list decoding of MDS codes, IEEE Trans. Inform. Theory, 47 (2001), 1604-1609 [9].
203. T. Kailath, Linear Systems, Prentice-Hall, Englewood Cliffs, New Jersey, 1980 [14].
204. M. Kaminski, D.G. Kirkpatrick, N.H. Bshouty, Addition requirements for matrix and transposed matrix products, J. Algorithms, 9 (1988), 354-364 [6].
205. R. Karabed, P.H. Siegel, Matched spectral-null codes for partial-response channels, IEEE Trans. Inform. Theory, 37 (1991), 818-855 [10].
206. M. Kasahara, Y. Sugiyama, S. Hirasawa, T. Namekawa, New classes of binary codes constructed on the basis of concatenated codes and product codes, IEEE Trans. Inform. Theory, 22 (1976), 462-468 [5, 12].
207. T. Kasami, An upper bound on k/n for affine-invariant codes with fixed d/n, IEEE Trans. Inform. Theory, 15 (1969), 174-176 [12].
208. T. Kasami, S. Lin, W.W. Peterson, New generalizations of the Reed- Muller codes-part I: primitive codes, IEEE Trans. Inform. Theory, 14 (1968), 189-199 [8].
209. G.L. Katsman, M.A. Tsfasman, S.G. Vlădut, Modular curves and codes with a polynomial construction, IEEE Trans. Inform. Theory, 30 (1984), 353-355 [4].
210. A.M. Kerdock, A class of low-rate nonlinear codes, Inform. Control, 20 (1972), 182-187 [10].
211. O. Keren, S.N. Litsyn, A class of array codes correcting multiple column erasures, IEEE Trans. Inform. Theory, 43 (1997), 1843-1851 [11].
212. O. Keren, S.N. Litsyn, Codes correcting phased burst erasures, IEEE Trans. Inform. Theory, 44 (1998), 416-420 [11].
213. L. Khachiyan, On the complexity of approximating extremal determinants in matrices, J. Complexity, 11 (1995), 138-153 [2, 5].
214. J.-H. Kim, H.-Y. Song, Trace representation of Legendre sequences, Designs Codes Cryptogr., 24 (2001), 343-348 [7].
215. J.F.C. Kingman, The exponential decay of Markov transition probabilities, Proc. Lond. Math. Soc., 13 (1963), 337-358 [10].
216. D.E. Knuth, The Art of Computer Programming, Volume 2: Seminumerical Algorithms, Third Edition, Addison-Wesley, Reading, Massachusetts, 1998 [3].
217. R. Koetter, A. Vardy, Algebraic soft-decision decoding of Reed-Solomon codes, IEEE Trans. Inform. Theory, 49 (2003), 2809-2825 [9]
218. Z. Kohavi, Switching and Finite Automata Theory, Second Edition, Mc- Graw-Hill, New York, 1978 [14].
219. V.D. Kolesnik, E.T. Mironchikov, Cyclic Reed-Muller codes and their decoding, Probl. Inform. Transm., 4 (1968), 15-19 [8].
220. M. Krawtchouk, Sur une généralisation des polynomes d'Hermite, Comptes Rendus, 189 (1929), 620-622 [4].
221. A.V. Kuznetsov, A.J.H. Vinck, A coding scheme for single peak-shift correction in (d, k)-constrained channels, IEEE Trans. Inform. Theory, 39 (1993), 1444-1450 [10].
222. H. Kwakernaak, R. Sivan, Modern Signals and Systems, Prentice-Hall, Englewood Cliffs, New Jersey, 1991 [14].
223. C.Y. Lee, Some properties of nonbinary error-correcting codes, IRE Trans. Inform. Theory, 4 (1958), 77-82 [10].
224. T. Lepistö, A modification of Elias-bound and nonexistence theorem for perfect codes in the Lee-metric, Inform. Control, 49 (1981), 109-124 [10].
225. T. Lepistö, A note on perfect Lee-codes over small alphabets, Discrete Appl. Math., 3 (1981), 73-74 [10].
226. V.I. Levenshtein, Binary codes capable of correcting deletions, insertions, and reversals, Soviet Physics-Doklady, 10 (1966), 707-710 [10].
227. V.I. Levenshtein, One method of constructing quasilinear codes providing synchronization in the presence of errors, Probl. Inform. Transm., 7 (1971), 215-222 [10].
228. V.I. Levenshtein, On perfect codes in deletion and insertion metric, Discrete Math. Appl., 2 (1992), 241-258 [10].
229. V.I. Levenshtein, A.J.H. Vinck, Perfect (d, k)-codes capable of correcting single peak-shifts, IEEE Trans. Inform. Theory, 39 (1993), 656-662 [10].
230. R. Lidl, H. Niederreiter, Finite Fields, Second Edition, Cambridge University Press, Cambridge, 1997 [3, 5, 7, 10].
231. S. Lin, D.J. Costello, Jr., Error Control Coding: Fundamentals and Applications, Prentice-Hall, Englewood Cliffs, New Jersey, 1983 [Prf., 4, 5, 14].
232. S. Lin, E.J. Weldon, Jr., Long BCH codes are bad, Inform. Control, 11 (1967), 445-451 [5, 8].
233. D. Lind, B. Marcus, An Introduction to Symbolic Dynamics and Coding, Cambridge University Press, Cambridge, 1995 [14].
234. J.H. van Lint, A survey of perfect codes, Rocky Mountain J. Math., 5 (1975), 199-224 [4].
235. J.H. van Lint, Repeated-root cyclic codes, IEEE Trans. Inform. Theory, 37 (1991), 343-345 [8].
236. S. Litsyn, V. Shevelev, On ensembles of low-density parity-check codes: asymptotic distance distributions, IEEE Trans. Inform. Theory, 48 (2002), 887-908 [13].
237. A. Lobstein, The hardness of solving subset sum with preprocessing, IEEE Trans. Inform. Theory, 36 (1990), 943-946 [2].
238. E. Louidor, Lowest-density MDS codes over super-alphabets, M.Sc. dissertation, Computer Science Department, Technion, Haifa, Israel, 2004 [11].
239. E. Louidor, R.M. Roth, Lowest density MDS codes over extension alphabets, IEEE Trans. Inform. Theory, 52 (2006), 3186-3197 [11].
240. L. Lovász, Spectra of graphs with transitive groups, Period. Math. Hungar., 6 (1975), 191-195 [13].
241. A. Lubotzky, R. Phillips, P. Sarnak, Ramanujan graphs, Combinatorica, 8 (1988), 261-277 [13].
242. M.G. Luby, M. Mitzenmacher, M.A. Shokrollahi, D.A. Spielman, Improved low-density parity-check codes using irregular graphs, IEEE Trans. Inform. Theory, 47 (2001), 585-598 [13].
243. D.G. Luenberger, Linear and Nonlinear Programming, Second Edition, Addison-Wesley, Reading, Massachusetts, 1984 [4].
244. H. Lüneburg, Translation Planes, Springer, Berlin, 1980 [11].
245. X. Ma, X.-M. Wang, On the minimal interpolation problem and decoding RS codes, IEEE Trans. Inform. Theory, 46 (2000), 1573-1580 [9].
246. D.J.C. MacKay, Good error-correcting codes based on very sparse matrices, IEEE Trans. Inform. Theory, 45 (1999), 399-431 [13].
247. S. MacLane, G. Birkhoff, Algebra, Third Edition, Chelsea, New York, 1967 [3].
248. F.J. MacWilliams, Combinatorial problems of elementary group theory, Ph.D. dissertation, Department of Mathematics, Harvard University, Cambridge, Massachusetts, 1962 [4].
249. F.J. MacWilliams, A theorem on the distribution of weights in a systematic code, Bell Syst. Tech. J., 42 (1963), 79-94 [4].
250. F.J. MacWilliams, N.J.A. Sloane, The Theory of Error-Correcting Codes, North-Holland, Amsterdam, 1977 [Prf., 2, 3, 4, 5, 8, 11, 12].
251. S. Marcugini, A. Milani, F. Pambianco, NMDS codes of maximal length over Fq, 8 ≤ q ≤ 11, IEEE Trans. Inform. Theory, 48 (2002), 963-966 [11]
252. B.H. Marcus, R.M. Roth, P.H. Siegel, Constrained systems and coding for recording channels, in Handbook of Coding Theory, Volume II, V.S. Pless, W.C. Huffman (Editors), North-Holland, Amsterdam, 1998, pp. 1635-1764 [14].
253. G.A. Margulis, Explicit group-theoretical constructions of combinatorial schemes and their application to the design of expanders and concentrators, Probl. Inform. Transm., 24 (1988), 39-46 [13].
254. J.L. Massey, Threshold Decoding, MIT Press, Cambridge, Massachusetts, 1963 [12].
255. J.L. Massey, Shift-register synthesis and BCH decoding, IEEE Trans. Inform. Theory, 15 (1969), 122-127 [6].
256. J.L. Massey, D.J. Costello, Jr., J. Justesen, Polynomial weights and code constructions, IEEE Trans. Inform. Theory, 19 (1973), 101-110 [8].
257. J.L. Massey, M.K. Sain, Inverses of linear sequential circuits, IEEE Trans. Comput., 17 (1968), 330-337 [14].
258. L.E. Mazur, Codes correcting errors of large weight in Lee metric, Probl. Inform. Transm., 9 (1973), 277-281 [10].
259. R.J. McEliece, The algebraic theory of convolutional codes, in Handbook of Coding Theory, Volume I, V.S. Pless, W.C. Huffman (Editors), North- Holland, Amsterdam, 1998, pp. 1067-1138 [14].
260. R.J. McEliece, The Theory of Information and Coding, Second Edition, Cambridge University Press, Cambridge, 2002 [Prf., 1, 4, 14].
261. R.J. McEliece, E.R. Rodemich, H. Rumsey, Jr., L.R. Welch, New upper bounds on the rate of a code via the Delsarte-MacWilliams inequalities, IEEE Trans. Inform. Theory, 23 (1977), 157-166 [4].
262. G. Miller, D. Burshtein, Bounds on the maximum-likelihood decoding error probability of low-density parity-check codes, IEEE Trans. Inform. Theory, 47 (2001), 2696-2710 [13].
263. W. Mills, Continued fractions and linear recurrences, Math. Comput., 29 (1975), 173-180 [6].
264. H. Minc, Nonnegative Matrices, Wiley, New York, 1988 [13].
265. C.M. Monti, G.L. Pierobon, Codes with a multiple spectral null at zero frequency, IEEE Trans. Inform. Theory, 35 (1989), 463-472 [10].
266. D.E. Muller, Application of Boolean algebra to switching circuit design and to error detection, IRE Trans. Comput., 3 (1954), 6-12 [2].
267. K. Nakamura, A class of error-correcting codes for DPSK channels, Conf. Record 1979 IEEE Int'l Conf. Communications (ICC'1979), Boston, Massachusetts (1979), pp. 45.4.1-45.4.5 [10].
268. J. Naor, M. Naor, Small-bias probability spaces: efficient constructions and applications, SIAM J. Comput., 22 (1993), 838-856 [13].
269. G.L. Nemhauser, L.A. Wolsey, Integer and Combinatorial Optimization, Wiley, New York, 1988 [4].
270. R.R. Nielsen, T. Hoholdt, Decoding Reed-Solomon codes beyond half the minimum distance, in Coding Theory, Cryptography and Related Areas, J. Buchmann, T. Hoholdt, H. Stichtenoth, H. Tapia-Recillas (Editors), Springer, Berlin, 2000, pp. 221-236 [9].
271. A.F. Nikiforov, S.K. Suslov, V.B. Uvarov, Classical Orthogonal Polynomials of a Discrete Variable, Springer, Berlin, 1991 [4].
272. A. Nilli, On the second eigenvalue of a graph, Discrete Math., 91 (1991), 207-210 [13].
273. J.-S. No, H.-K. Lee, H. Chung, H.-Y. Song, K. Yang, Trace representation of Legendre sequences of Mersenne prime period, IEEE Trans. Inform. Theory, 42 (1996), 2254-2255 [7].
274. A. Odlyzko, Discrete logarithms: the past and the future, Designs Codes Cryptogr., 19 (2000), 129-145 [3].
275. H. O'Keeffe, P. Fitzpatrick, Gröbner basis solution of constrained interpolation problems, Linear Algebra Appl., 351-352 (2002), 533-551 [9].
276. V. Olshevsky, M.A. Shokrollahi, A displacement approach to efficient decoding of algebraic-geometric codes, Proc. 31st ACM Symp. Theory of Computing (STOC'1999), Atlanta, Georgia (1999), ACM, New York, 1999, pp. 235-244 [9].
277. A. Orlitsky, Interactive communication of balanced distributions and of correlated files, SIAM J. Discrete Math., 6 (1993), 548-564 [10].
278. W.W. Peterson, Encoding and error-correction procedures for the Bose- Chaudhuri codes, IRE Trans. Inform. Theory, 6 (1960), 459-470 [6].
279. W.W. Peterson, E.J. Weldon, Jr., Error-Correcting Codes, Second Edition, MIT Press, Cambridge, Massachusetts, 1972 [Prf., 2, 4].
280. E. Petrank, R.M. Roth, Is code equivalence easy to decide?, IEEE Trans. Inform. Theory, 43 (1997), 1602-1604 [2].
281. V. Pless, Introduction to the Theory of Error Correcting Codes, Third Edition, Wiley, New York, 1998 [Prf., 4].
282. V.S. Pless, W.C. Huffman (Editors), Handbook of Coding Theory, Volumes I-II, North-Holland, Amsterdam, 1998 [Prf.].
283. M. Plotkin, Binary codes with specified minimum distances, IRE Trans. Inform. Theory, 6 (1960), 445-450 [4].
284. K.C. Pohlmann, The Compact Disc Handbook, Second Edition, A-R Editions, Madison, Wisconsin, 1992 [5].
285. K.A. Post, Nonexistence theorems on perfect Lee codes over large alphabets, Inform. Control, 29 (1975), 369-380 [10].
286. F.P. Preparata, A class of optimum nonlinear double-error-correcting codes, Inform. Control, 13 (1968), 378-400 [10].
287. M.O. Rabin, Probabilistic algorithms in finite fields, SIAM J. Comput., 9 (1980), 273-280 [3].
288. S.M. Reddy, J.P. Robinson, Random error and burst correction by iterated codes, IEEE Trans. Inform. Theory, 18 (1972), 182-185 [12].
289. I.S. Reed, A class of multiple-error-correcting codes and the decoding scheme, IRE Trans. Inform. Theory, 4 (1954), 38-49 [2].
290. I.S. Reed, G. Solomon, Polynomial codes over certain finite fields, J. SIAM, 8 (1960), 300-304 [5].
291. J.A. Reeds, N.J.A. Sloane, Shift-register synthesis (modulo m), SIAM J. Comput., 14 (1985), 505-513 [6].
292. O. Regev, Improved inapproximability of lattice and coding problems with preprocessing, Proc. 18th Annual IEEE Conf. Computational Complexity (CCC'2003), Århus, Denmark (2003), IEEE Computer Society Press, Los Alamitos, California, 2003, pp. 363-370 [2].
293. S.H. Reiger, Codes for the correction of "clustered" errors, IRE Trans. Inform. Theory, 6 (1960), 16-21 [4].
294. T.J. Richardson, M.A. Shokrollahi, R.L. Urbanke, Design of capacity- approaching irregular low-density parity-check codes, IEEE Trans. Inform. Theory, 47 (2001), 619-637 [13].
295. T.J. Richardson, R.L. Urbanke, The capacity of low-density paritycheck codes under message-passing decoding, IEEE Trans. Inform. Theory, 47 (2001), 599-618 [13].
296. A.I. Riihonen, A note on perfect Lee-code, Discrete Appl. Math., 2 (1980), 259-260 [10].
297. C. Roos, A new lower bound for the minimum distance of a cyclic code, IEEE Trans. Inform. Theory, 29 (1983), 330-332 [8].
298. R.M. Roth, Maximum-rank array codes and their application to crisscross error correction, IEEE Trans. Inform. Theory, 37 (1991), 328-336 [11].
299. R.M. Roth, Spectral-null codes and null spaces of Hadamard submatrices, Designs Codes Cryptogr., 9 (1996), 177-191 [10].
300. R.M. Roth, Tensor codes for the rank metric, IEEE Trans. Inform. Theory, 42 (1996), 2146-2157 [11].
301. R.M. Roth, A. Lempel, A construction of non-Reed-Solomon type MDS codes, IEEE Trans. Inform. Theory, 35 (1989), 655-657 [5].
302. R.M. Roth, A. Lempel, On MDS codes via Cauchy matrices, IEEE Trans. Inform. Theory, 35 (1989), 1314-1319 [5, 11].
303. R.M. Roth, G. Ruckenstein, Efficient decoding of Reed-Solomon codes beyond half the minimum distance, IEEE Trans. Inform. Theory, 46 (2000), 246-257 [6, 9].
304. R.M. Roth, G. Seroussi, On generator matrices of MDS codes, IEEE Trans. Inform. Theory, 31 (1985), 826-830 [5].
305. R.M. Roth, G. Seroussi, On cyclic MDS codes of length q over GF(q), IEEE Trans. Inform. Theory, 32 (1986), 284-285 [8].
306. R.M. Roth, G. Seroussi, Reduced-redundancy product codes for burst error correction, IEEE Trans. Inform. Theory, 44 (1998), 1395-1406 [5].
307. R.M. Roth, P.H. Siegel, Lee-metric BCH codes and their application to constrained and partial-response channels, IEEE Trans. Inform. Theory, 40 (1994), 1083-1096 [10].
308. R.M. Roth, P.H. Siegel, A. Vardy, High-order spectral-null codes- constructions and bounds, IEEE Trans. Inform. Theory, 40 (1994), 1826- 1840 [10].
309. R.M. Roth, V. Skachek, Improved nearly-MDS expander codes, IEEE Trans. Inform. Theory, 52 (2006), 3650-3661 [13].
310. G. Ruckenstein, Error decoding strategies for algebraic codes, Ph.D. dissertation, Computer Science Department, Technion, Haifa, Israel, 2002 [9].
311. G. Ruckenstein, R.M. Roth, Bounds on the list-decoding radius of Reed- Solomon codes, SIAM J. Discrete Math., 17 (2003), 171-195 [9].
312. G.E. Sacks, Multiple error correction by means of parity checks, IRE Trans. Inform. Theory, 4 (1958), 145-147 [4].
313. Y. Saitoh, Theory and design of error-control codes for byte-organized/input- restricted storage devices where unidirectional/peak-shift errors are predominant, Ph.D. dissertation, Division of Electrical and Computer Engineering, Yokohama National University, Yokohama, Japan, 1993 [10].
314. Y. Saitoh, T. Ohno, H. Imai, Construction techniques for error-control runlength-limited block codes, IEICE Trans. Fundamentals, E76-A (1993), 453-458 [10].
315. S. Sakata, Finding a minimal set of linear recurring relations capable of generating a given finite two-dimensional array, J. Symb. Comput., 5 (1988), 321-337 [6].
316. S. Sakata, Extension of the Berlekamp-Massey algorithm to N dimensions, Inform. Comput., 1990 (84), 207-239 [6].
317. S. Sakata, Y. Numakami, M. Fujisawa, A fast interpolation method for list decoding of RS and algebraic-geometric codes, Proc. 2000 IEEE Int'l Symp. Inform. Theory (ISIT'2000), Sorrento, Italy (2000), p. 479 [9].
318. D.V. Sarwate, On the complexity of decoding Goppa codes, IEEE Trans. Inform. Theory, 23 (1977), 515-516 [6].
319. I. Sason, R. Urbanke, Parity-check density versus performance of binary linear block codes over memoryless symmetric channels, IEEE Trans. Inform. Theory, 49 (2003), 1611-1635 [13].
320. C. Satyanarayana, Lee metric codes over integer residue rings, IEEE Trans. Inform. Theory, 25 (1979), 250-254 [10].
321. O. Schirokauer, Discrete logarithms and local units, Philos. Trans. R. Soc. Lond. A, 345 (1993), 409-423 [3].
322. O. Schirokauer, Using number fields to compute logarithms in finite fields, Math. Comput., 69 (2000), 1267-1283 [3].
323. A. Schönhage, Schnelle Multiplikation von Polynomen über Körpern der Charakteristik 2, Acta Informatica, 7 (1977), 395-398 [3].
324. A. Schönhage, V. Strassen, Schnelle Multiplikation grosser Zahlen, Computing, 7 (1971), 281-292 [3].
325. A. Schrijver, Theory of Linear and Integer Programming, Wiley, New York, 1986 [4].
326. B. Segre, Ovals in a finite projective plane, Canad. J. Math., 7 (1955), 414-416 [11].
327. B. Segre, Introduction to Galois Geometries, Atti Accad. Naz. Lincei Mem., 8 (1967), 133-236 [11].
328. N. Sendrier, Finding the permutation between equivalent linear codes: the support splitting algorithm, IEEE Trans. Inform. Theory, 46 (2000), 1193- 1203 [2].
329. E. Seneta, Non-negative Matrices and Markov Chains, Second Edition, Springer, New York, 1980 [10, 13].
330. G. Seroussi, R.M. Roth, On MDS extensions of generalized Reed-Solomon codes, IEEE Trans. Inform. Theory, 32 (1986), 349-354 [11]
331. C.E. Shannon, A mathematical theory of communication, Bell Syst. Tech. J., 27 (1948), 379-423 and 623-656 [1, 4].
332. C.E. Shannon, R.G. Gallager, E.R. Berlekamp, Lower bounds to error probability for coding on discrete memoryless channels, Inform. Control, 10 (1967), 65-103 and 522-552 [4].
333. B.D. Sharma, R.K. Khanna, On m-ary Gray codes, Inform. Sci., 15 (1978), 31-43 [10].
334. B.-Z. Shen, A Justesen construction of binary concatenated codes that asymptotically meet the Zyablov bound for low rate, IEEE Trans. Inform. Theory, 39 (1993), 239-242 [12].
335. V. Shoup, New algorithms for finding irreducible polynomials over finite fields, Math. Comput., 54 (1990), 435-447 [3].
336. V. Shoup, Fast construction of irreducible polynomials over finite fields, J. Symb. Comput., 17 (1994), 371-391 [3].
337. V. Shoup, A new polynomial factorization algorithm and its implementation, J. Symb. Comput., 20 (1995), 363-397 [3].
338. N. Shulman, M. Feder, Improved error exponent for time-invariant and periodically time-variant convolutional codes, IEEE Trans. Inform. Theory, 46 (2000), 97-103 [14].
339. K.W. Shum, I. Aleshnikov, P.V. Kumar, H. Stichtenoth, V. Deolalikar, A low-complexity algorithm for the construction of algebraicgeometric codes better than the Gilbert-Varshamov bound, IEEE Trans. Inform. Theory, 47 (2001), 2225-2241 [4].
340. R.C. Singleton, Maximum distance q-nary codes, IEEE Trans. Inform. Theory, 10 (1964), 116-118 [4].
341. M. Sipser, D.A. Spielman, Expander codes, IEEE Trans. Inform. Theory, 42 (1996), 1710-1722 [13].
342. V. Skachek, T. Etzion, R.M. Roth, Efficient encoding algorithm for third-order spectral-null codes, IEEE Trans. Inform. Theory, 44 (1998), 846- 851 [10].
343. V. Skachek, R.M. Roth, Generalized minimum distance iterative decoding of expander codes, Proc. IEEE Information Theory Workshop, Paris, France (April 2003), pp. 245-248 [13].
344. D.A. Spielman, Linear-time encodable and decodable error-correcting codes, IEEE Trans. Inform. Theory, 42 (1996), 1723-1731 [13].
345. L. Storme, J.A. Thas, Generalized Reed-Solomon codes and normal rational curves: an improvement of results by Seroussi and Roth, in Advances in Finite Geometries and Designs: Proc. 3rd Isle of Thorns Conference, Chelwood Gate, UK (1990), J.W.P. Hirschfeld, D.R. Hughes, J.A. Thas (Editors), Oxford University Press, Oxford, 1991, pp. 369-389 [11].
346. L. Storme, J.A. Thas, M.D.S. codes and arcs in PG(n, q) with q even: an improvement of the bounds of Bruen, Thas, and Blokhuis, J. Comb. Theory A, 62 (1993), 139-154 [11].
347. M. Sudan, Decoding of Reed-Solomon codes beyond the error-correction bound, J. Complexity, 13 (1997), 180-193 [9].
348. Y. Sugiyama, M. Kasahara, S. Hirasawa, T. Namekawa, A modification of the constructive asymptotically good codes of Justesen for low rates, Inform. Control, 25 (1974), 341-350 [12].
349. Y. Sugiyama, M. Kasahara, S. Hirasawa, T. Namekawa, A method for solving key equation for decoding Goppa codes, Inform. Control, 27 (1975), 87-99 [6].
350. Y. Sugiyama, M. Kasahara, S. Hirasawa, T. Namekawa, A new class of asymptotically good codes beyond the Zyablov bound, IEEE Trans. Inform. Theory, 24 (1978), 198-204 [12].
351. Y. Sugiyama, M. Kasahara, S. Hirasawa, T. Namekawa, Superimposed concatenated codes, IEEE Trans. Inform. Theory, 26 (1980), 735-736 [5, 12].
352. G. Szegő, Orthogonal Polynomials, Fourth Edition, Amer. Math. Soc. Colloq. Publ., Volume 23, AMS, Providence, Rhode Island, 1975 [4].
353. I. Tal, List decoding of Lee metric codes, M.Sc. dissertation, Computer Science Department, Technion, Haifa, Israel, 2003 [10].
354. I. Tal, R.M. Roth, On list decoding of alternant codes in the Hamming and Lee metrics, Proc. 2003 IEEE Int'l Symp. Inform. Theory (ISIT'2003), Yokohama, Japan (2003), p. 364 [9, 10].
355. L.G. Tallini, B. Bose, On efficient high-order spectral-null codes, IEEE Trans. Inform. Theory, 45 (1999), 2594-2601 [10].
356. E. Tanaka, T. Kasai, Synchronization and substitution error-correcting codes for the Levenshtein metric, IEEE Trans. Inform. Theory, 22 (1976), 156-162 [10].
357. R.M. Tanner, A recursive approach to low-complexity codes, IEEE Trans. Inform. Theory, 27 (1981), 533-547 [13].
358. R.M. Tanner, Explicit concentrators from generalized N-gons, SIAM J. Algebr. Discrete Methods, 5 (1984), 287-293 [13].
359. G.M. Tenengolts, Class of codes correcting bit loss and errors in the preceding bit, Autom. Remote Control, 37 (1976), 797-802 [10].
360. G. Tenengolts, Nonbinary codes, correcting single deletion or insertion, IEEE Trans. Inform. Theory, 30 (1984), 766-769 [10].
361. J.A. Thas, Complete arcs and algebraic curves in PG(2, q), J. Algebra, 106 (1987), 451-464 [11].
362. J.A. Thas, Projective geometry over a finite field, in Handbook of Incidence Geometry: Buildings and Foundations, F. Buekenhout (Editor), Elsevier Science, Amsterdam, 1995, 295-347 [2, 11].
363. C. Thommesen, The existence of binary linear concatenated codes with Reed-Solomon outer codes which asymptotically meet the Gilbert-Varshamov bound, IEEE Trans. Inform. Theory, 29 (1983), 850-853 [12].
364. C. Thommesen, Error-correcting capabilities of concatenated codes with MDS outer codes on memoryless channels with maximum-likelihood decoding, IEEE Trans. Inform. Theory, 33 (1987), 632-640 [12].
365. A. Tietäväinen, On the nonexistence of perfect codes over finite fields, SIAM J. Appl. Math., 24 (1973), 88-96 [4].
366. M.A. Tsfasman, S.G. Vlădut, T. Zink, Modular curves, Shimura curves, and Goppa codes, better than Varshamov-Gilbert bound, Math. Nachr., 109 (1982), 21-28 [4].
367. J.D. Ullman, Near-optimal, single-synchronization-error-correcting code, IEEE Trans. Inform. Theory, 12 (1966), 418-424 [10].
368. J.D. Ullman, On the capabilities of codes to correct synchronization errors, IEEE Trans. Inform. Theory, 13 (1967), 95-105 [10].
369. W. Ulrich, Non-binary error correction codes, Bell Syst. Tech. J., 36 (1957), 1341-1387 [10].
370. T. Uyematsu, E. Okamoto, A construction of codes with exponential error bounds on arbitrary discrete memoryless channels, IEEE Trans. Inform. Theory, 43 (1997), 992-996 [12].
371. A. Vardy, The intractability of computing the minimum distance of a code, IEEE Trans. Inform. Theory, 43 (1997), 1757-1766 [2, 5].
372. R.S. Varga, Matrix Iterative Analysis, Prentice-Hall, Englewood Cliffs, New Jersey, 1962 [13].
373. R.R. Varshamov, Estimate of the number of signals in error correcting codes, Dokl. Akad. Nauk SSSR, 117 (1957), 739-741 [4].
374. A.J. Viterbi, Error bounds for convolutional codes and an asymptotically optimum decoding algorithm, IEEE Trans. Inform. Theory, 13 (1967), 260- 269 [14].
375. A.J. Viterbi, J.K. Omura, Principles of Digital Communication and Coding, McGraw-Hill, New York, 1979 [4, 14].
376. J.F. Voloch, Arcs in projective planes over prime fields, J. Geom., 38 (1990), 198-200 [11].
377. J.F. Voloch, Complete arcs in Galois planes of non-square order, in Advances in Finite Geometries and Designs: Proc. 3rd Isle of Thorns Conference, Chelwood Gate, UK (1990), J.W.P. Hirschfeld, D.R. Hughes, J.A. Thas (Editors), Oxford University Press, Oxford, 1991, pp. 401-406 [11].
378. B.L. van der Waerden, Algebra, Volume 1, Seventh Edition, Ungar, New York, 1970, and Springer, New York, 1991 [10].
379. W.D. Wallis, A.P. Street, J.S. Wallis, Combinatorics: Room Squares, Sum-Free Sets, Hadamard Matrices, Lecture Notes in Mathematics, Volume 292, Springer, Berlin, 1972 [2].
380. A. Weil, On some exponential sums, Proc. Nat. Acad. Sci. USA, 34 (1948), 204-207 [5].
381. L.R. Welch, E.R. Berlekamp, Error correction for algebraic block codes, US Patent 4,633,470 (1986) [6, 9].
382. L.R. Welch, R.A. Scholtz, Continued fractions and Berlekamp's algorithm, IEEE Trans. Inform. Theory, 25 (1979), 19-27 [6].
383. E.J. Weldon, Jr., Decoding binary block codes on Q-ary output channels, IEEE Trans. Inform. Theory, 17 (1971), 713-718 [12].
384. E.J. Weldon, Jr., Justesen's construction-the low-rate case, IEEE Trans. Inform. Theory, 19 (1973), 711-713 [12].
385. E.J. Weldon, Jr., Some results on the problem of constructing asymptotically good error-correcting codes, IEEE Trans. Inform. Theory, 21 (1975), 412-417 [12].
386. D.B. West, Introduction to Graph Theory, Second Edition, Prentice-Hall, Upper Saddle River, New Jersey, 2001 [13].
387. S. Winograd, Arithmetic Complexity of Computations, CBMS-NSF Regional Conference Series in Applied Mathematics, Volume 33, SIAM, Philadelphia, Pennsylvania, 1980 [3].
388. J.M. Wozencraft, Sequential decoding for reliable communication, IRE Nat. Conv. Rec., 5 (1957), 11-25 [14].
389. J.M. Wozencraft, B. Reiffen, Sequential Decoding, MIT Press and Wiley, New York, 1961 [14].
390. A.D. Wyner, R.B. Ash, Analysis of recurrent codes, IEEE Trans. Inform. Theory, 9 (1963), 143-156 [14].
391. A.D. Wyner, R.L. Graham, An upper bound on minimum distance for a k-ary code, Inform. Control, 13 (1968), 46-52 [10].
392. R.K. Yarlagadda, J.E. Hershey, Hadamard Matrix Analysis and Synthesis, with Applications to Communications and Signal/Image Processing, Kluwer, Boston, Massachusetts, 1996 [2].
393. G.V. Zaitsev, V.A. Zinov'ev, N.V. Semakov, Minimum-check-density codes for correcting bytes of errors, erasures, or defects, Probl. Inform. Transm., 19 (1983), 197-204 [11].
394. E. Zehendner, A non-existence theorem for cyclic MDS-codes, Atti. Sem. Mat. Fis. Univ. Modena, 32 (1983), 203-205 [8].
395. G. Zémor, On expander codes, IEEE Trans. Inform. Theory, 47 (2001), 835-837 [13].
396. K.S. Zigangirov, Some sequential decoding procedures, Probl. Inform. Transm., 2 (1966), 1-10 [14].
397. K.S. Zigangirov, On the error probability of sequential decoding on the BSC, IEEE Trans. Inform. Theory, 18 (1972), 199-202 [14].
398. V.A. Zinov'ev, Generalized cascade codes, Probl. Inform. Transm., 12 (1976), 2-9 [5, 12].
399. V.A. Zinov'ev, Generalized concatenated codes for channels with error bursts and independent errors, Probl. Inform. Transm., 17 (1981), 254-260 [5, 12].
400. V.A. Zinov'ev, V.K. Leont'ev, The nonexistence of perfect codes over Galois fields, Probl. Control Inform. Theory, 2 No. 2 (1973), English supplement, 16-24 [4].
401. V.A. Zinov'ev, V.V. Zyablov, Decoding of nonlinear generalized cascade codes, Probl. Inform. Transm., 14 (1978), 110-114 [5, 12].
402. V.A. Zinov'ev, V.V. Zyablov, Correction of error bursts and independent errors using generalized cascaded codes, Probl. Inform. Transm., 15 (1979), 125-134 [5, 12].
403. V.A. Zinov'ev, V.V. Zyablov, Codes with unequal protection of information symbols, Probl. Inform. Transm., 15 (1979), 197-205 [5, 12].
404. R. Zippel, Effective Polynomial Computation, Kluwer, Boston, Massachusetts, 1993 [3, 9].
405. V.V. Zyablov, An estimate of the complexity of constructing binary linear cascade codes, Probl. Inform. Transm., 7 (1971), 3-10 [12].
406. V.V. Zyablov, Optimization of concatenated decoding algorithms, Probl. Inform. Transm., 9 (1973), 19-24 [12].