Linear-time encodable and decodable error-correcting codes

Ab,stract-We present a new class of asymptotically good, linear error-correcting codes. These codes can be both encoded and decoded in linear time. They can also be encoded by logarithmicdepth circuits of linear size and decoded by logarithmic depth circuits of size 0 (n log n) . We present both randomized and explicit constructions of these codes. Zndex Terms- Asymptotically good error-correcting code, linear-time, expander graph, superconcentrators.

[1]  F. MacWilliams,et al.  The Theory of Error-Correcting Codes , 1977 .

[2]  Daniel A. Spielman,et al.  Expander codes , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.

[3]  Zvi Galil,et al.  Explicit Constructions of Linear-Sized Superconcentrators , 1981, J. Comput. Syst. Sci..

[4]  Noga Alon,et al.  Eigenvalues and expanders , 1986, Comb..

[5]  Moshe Morgenstern,et al.  Natural bounded concentrators , 1995, Comb..

[6]  Hideki Imai.  Essentials of Error-Control Coding Techniques , 1990 .

[7]  H. Heilbronn,et al.  Über den Primzahlsatz von Herrn Hoheisel , 1933 .

[8]  Lars-Ake Levin,et al.  Problems of Information Transmission , 1973 .

[9]  V. A. Uspenski,et al.  On the Definition of an Algorithm , 1963 .

[10]  Nicholas Pippenger,et al.  Self-routing superconcentrators , 1993, J. Comput. Syst. Sci..

[11]  Leslie G. Valiant,et al.  Graph-Theoretic Properties in computational Complexity , 1976, J. Comput. Syst. Sci..

[12]  Jørn Justesen,et al.  On the complexity of decoding Reed-Solomon codes (Corresp.) , 1976, IEEE Trans. Inf. Theory.

[13]  Noga Alon,et al.  Explicit construction of linear sized tolerant networks , 1988, Discret. Math..

[14]  JOHN E. SAVAGE.  The complexity of decoders-II: Computational work and decoding time , 1971, IEEE Trans. Inf. Theory.

[15]  Dilip V. Sarwate,et al.  On the complexity of decoding goppa codes , 1977 .

[16]  Moshe Morgenstern,et al.  Existence and Explicit Constructions of q + 1 Regular Ramanujan Graphs for Every Prime Power q , 1994, J. Comb. Theory, Ser. B.

[17]  Arnold Schönhage.  Storage Modification Machines , 1980, SIAM J. Comput..

[18]  Alfred V. Aho,et al.  The Design and Analysis of Computer Algorithms , 1974 .

[19]  F. Bien.  Constructions of telephone networks by group representations , 1989 .

[20]  O. Antoine,et al.  Theory of Error-correcting Codes , 2022 .

[21]  Dilip V. Sarwate.  On the complexity of decoding Goppa codes (Corresp.) , 1977, IEEE Trans. Inf. Theory.

[22]  János Komlós,et al.  Deterministic simulation in LOGSPACE , 1987, STOC.

[23]  Nicholas Pippenger.  Self-Routing Superconcentrators , 1996, J. Comput. Syst. Sci..

[24]  D. Spielman,et al.  Expander codes , 1996 .

[25]  Nabil Kahale,et al.  On the second eigenvalue and linear expansion of regular graphs , 1992, Proceedings., 33rd Annual Symposium on Foundations of Computer Science.

[26]  R. M. Tanner.  Explicit Concentrators from Generalized N-Gons , 1984 .

[27]  Jacob Ziv.  Asymptotic performance and complexity of a coding scheme for memoryless channels , 1967, IEEE Trans. Inf. Theory.

[28]  M. Murty.  Ramanujan Graphs , 1965 .

[29]  Robert G. Gallager,et al.  Low-density parity-check codes , 1962, IRE Trans. Inf. Theory.

[30]  J.L. Massey,et al.  Theory and practice of error control codes , 1986, Proceedings of the IEEE.