research-article

Linear-time decoding of regular expander codes

Author:

Michael VidermanAuthors Info & Claims

ACM Transactions on Computation Theory (TOCT), Volume 5, Issue 3

Article No.: 10, Pages 1 - 25

https://doi.org/10.1145/2493252.2493255

Published: 22 August 2013 Publication History

Abstract

Sipser and Spielman (IEEE IT, [1996]) showed that any c,d)-regular expander code with expansion parameter >¾ is decodable in linear time from a constant fraction of errors. Feldman et al. (IEEE IT, [2007]) proved that expansion parameter >⅔ + 1/3c is sufficient to correct a constant fraction of errors in polynomial time using LP decoding.

In this work, we give a simple combinatorial algorithm that achieves even better parameters. In particular, our algorithm runs in linear time and works for any expansion parameter >⅔ − 1/6c. We also prove that our decoding algorithm can be executed in logarithmic time on a linear number of parallel processors.

Supplementary Material

a10-viderman-apndx.pdf (viderman.zip)

Supplemental movie, appendix, image and software files for, Linear-time decoding of regular expander codes

Download
25.95 KB

References

[1]

Barg, A. and Zémor, G. 2002. Error exponents of expander codes. IEEE Trans. Inf. Theory 48, 6, 1725--1729.

Digital Library

[2]

Barg, A. and ZÉmor, G. 2006. Distance properties of expander codes. IEEE Trans. Inf. Theory 52, 1, 78--90. http://doi.ieeecomputersociety.org/10.1109/TIT.2005.860415.

Digital Library

[3]

Bennatan, A. and Burshtein, D. 2004. On the application of LDPC codes to arbitrary discrete-memoryless channels. IEEE Trans. Inf. Theory 50, 3, 417--438.

Digital Library

[4]

Burshtein, D. 2009. Iterative approximate linear programming decoding of LDPC codes with linear complexity. IEEE Trans. Inf. Theory 55, 11, 4835--4859. http://dx.doi.org/10.1109/TIT.2009.2030477.

Digital Library

[5]

Capalbo, M., Reingold, O., Vadhan, S., and Wigderson, A. 2002. Randomness conductors and constant-degree lossless expanders. In Proceedings of the 34th Annual ACM Symposium on Theory of Computing STOC'02). ACM, New York, 659--668.

Digital Library

[6]

Feldman, J. 2003. Decoding error-correcting codes via linear programming. Ph.D. dissertation. http://hdl.handle.net/1721.1/42831.

Digital Library

[7]

Feldman, J. 2008. LP decoding. In Encyclopedia of Algorithms, Ming-Yang Kao, Ed., Springer. http://dx.doi.org/10.1007/978-0-387-30162-4_216.

[8]

Feldman, J. and Karger, D. R. 2004. Decoding turbo-like codes via linear programming. J. Comput. Syst. Sci. 68, 4, 733--752. http://dx.doi.org/10.1016/j.jcss.2003.11.005.

Digital Library

[9]

Feldman, J., Malkin, T., Servedio, R. A., Stein, C., and Wainwright, M. J. 2007. LP decoding corrects a constant fraction of errors. IEEE Trans. Inf. Theory 53, 1, 82--89. http://dx.doi.org/10.1109/TIT.2006.887523.

Digital Library

[10]

Gallager, R. G. 1963. Low-Density Parity-Check Codes. The M.I.T. Press, Cambridge, MA.

[11]

Gallager, R. G. 1968. Information Theory and Reliable Communication. Wiley, New York.

Digital Library

[12]

Guruswami, V. and Indyk, P. 2002. Near-optimal linear-time codes for unique decoding and new list-decodable codes over smaller alphabets. In Proceedings of the STOC. 812--821. http://doi.acm.org/10.1145/509907.510023.

Digital Library

[13]

Guruswami, V. and Indyk, P. 2003. Linear time encodable and list decodable codes. In Proceedings of the STOC. ACM, 126--135. http://doi.acm.org/10.1145/780542.780562.

Digital Library

[14]

Guruswami, V. and Indyk, P. 2004. Linear-time list decoding in error-free settings. In Proceedings of the 31st International Colloquium on Automata, Languages and Programming (ICALP'04), Lecture Notes in Computer Science, J. Díaz, J. Karhumäki, A. Lepistö, and D. Sannella, Eds., vol. 3142, Springer, 695--707. http://springerlink.metapress.com/openurl.asp&quest;genre=article& issn=0302-9743& volume=3142& spage=695.

[15]

Guruswami, V. and Indyk, P. 2005. Linear-time encodable/decodable codes with near-optimal rate. IEEE Trans. Inf. Theory 51, 10, 3393--3400. http://doi.ieeecomputersociety.org/10.1109/TIT.2005.855587.

Digital Library

[16]

Lubotzky, A., Phillips, R., and Sarnak, P. 1988. Ramanujan graphs. Combinatorica 8, 3, 261--277.

[17]

MacKay, D. J. C. and Neal, R. M. 1995. Good codes based on very sparse matrices. In Proceedings of the 5th IMA Conference on Cryptography and Coding, C. Boyd, Ed., Lecture Notes in Computer Science, vol. 1025, Springer-Verlag, Berlin, 100--111. http://springerlink.metapress.com/openurl.asp&quest;genre=article&issn=0302-9743&volume=1025&spage=100.

Digital Library

[18]

MacKay, D. J. C. and Neal, R. M. 1996. Near Shannon limit performance of low density parity check codes. Electron. Lett. 32, 18, 1645--1646.

[19]

Margulis, G. A. 1982. Explicit constructions of graphs without short cycles and low density codes. Combinatorica 2, 1, 71--78.

[20]

Pearl, J. 1988. Probabilistic Inference in Intelligent Systems. Networks of Plausible Inference. Morgan Kaufmann, San Mateo, CA.

Digital Library

[21]

Reingold, O., Vadhan, S., and Wigderson, A. 2002. Entropy waves, the zig-zag graph product, and new constant-degree expanders. ANNALSMTH: Ann. Math. 155.

[22]

Richardson, T. J. and Urbanke, R. L. 2001a. The capacity of low-density parity-check codes under message-passing decoding. IEEE Trans. Inf. Theory 47, 2, 599--618.

Digital Library

[23]

Richardson, T. J. and Urbanke, R. L. 2001b. Efficient encoding of low-density parity-check codes. IEEE Trans. Inf. Theory 47, 2, 638--656.

Digital Library

[24]

Roth, R. M. and Skachek, V. 2003. Generalized minimum distance iterative decoding of expander codes. In Proceedings of the Information Theory Workshop. 245--248. http://ieeexplore.ieee.org/xpl/freeabs_all.jsp&quest;arnumber=1216740.

[25]

Roth, R. M. and Skachek, V. 2006. Improved nearly-MDS expander codes. IEEE Trans. Inf. Theory 52, 8, 3650--3661. http://doi.ieeecomputersociety.org/10.1109/TIT.2006.878232.

Digital Library

[26]

Sipser, M. and Spielman, D. A. 1996. Expander codes. IEEE Trans. Inf. Theory 42, 6, 1710--1722.

[27]

Spielman, D. A. 1996. Linear-time encodable and decodable error-correcting codes. IEEE Trans. Inf. Theory 42, 6, 1723--1731.

Digital Library

[28]

Sudan, M. 2000. List decoding: algorithms and applications. SIGACT News 31, 1, 16--27. http://doi.acm.org/10.1145/346048.346049.

Digital Library

[29]

Taghavi, M. H., Shokrollahi, A., and Siegel, P. H. 2009. Efficient implementation of linear programming decoding. CoRR abs/0902.0657. http://arxiv.org/abs/0902.0657. informal publication.

Digital Library

[30]

Tanner, R. M. 1981. A recursive approach to low complexity codes. IEEE Trans. Inf. Theory 27, 5, 533--547.

Digital Library

[31]

Trevisan, L. 2004. Some applications of coding theory in computational complexity. In Electronic Colloquium on Computational Complexity (ECCC) 043. http://eccc.hpi-web.de/eccc-reports/2004/TR04-043/index.html.

[32]

Vontobel, P. O. 2008. Interior-point algorithms for linear-programming decoding. CoRR abs/0802.1369. http://arxiv.org/abs/0802.1369. informal publication.

[33]

Zémor, G. 2001. On expander codes. IEEE Trans. Inf. Theory 47, 2, 835--837.

Digital Library

[34]

Zyablov, V. V. and Pinsker, M. S. 1976. Estimation of the error-correction complexity of gallger low-density codes. Prob. Inf. Trans. 11, 1, 18--28.

Cited By

Chen XCheng KLi XOuyang M(2023)Improved Decoding of Expander CodesIEEE Transactions on Information Theory10.1109/TIT.2023.323916369:6(3574-3589)Online publication date: 1-Jun-2023
https://dl.acm.org/doi/10.1109/TIT.2023.3239163
Dowling MGao S(2018)Fast Decoding of Expander CodesIEEE Transactions on Information Theory10.1109/TIT.2017.272606464:2(972-978)Online publication date: 1-Feb-2018
https://dl.acm.org/doi/10.1109/TIT.2017.2726064

Index Terms

Linear-time decoding of regular expander codes
1. Software and its engineering
  1. Software creation and management
    1. Software development techniques
      1. Error handling and recovery

Recommendations

Linear time decoding of regular expander codes
ITCS '12: Proceedings of the 3rd Innovations in Theoretical Computer Science Conference

Sipser and Spielman (IEEE IT, 1996) showed that any (c, d)-regular expander code with expansion parameter > 3/4 is decodable in linear time from a constant fraction of errors. Feldman et al. (IEEE IT, 2007) proved that expansion parameter > 2/3 + 1/3c ...
Decoding of Expander Codes at Rates Close to Capacity

The decoding error probability of codes is studied as a function of their block length. It is shown that the existence of codes with a polynomially small decoding error probability implies the existence of codes with an exponentially small decoding ...
Local correctability of expander codes

In this work, we present the first local-decoding algorithm for expander codes. This yields a new family of constant-rate codes that can recover from a constant fraction of errors in the codeword symbols, and where any symbol of the codeword can be ...

Comments

Information & Contributors

Information

Published In

cover image ACM Transactions on Computation Theory

ACM Transactions on Computation Theory Volume 5, Issue 3

Special issue on innovations in theoretical computer science 2012

August 2013

94 pages

ISSN:1942-3454

EISSN:1942-3462

DOI:10.1145/2493252

Issue’s Table of Contents

Copyright © 2013 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 22 August 2013

Accepted: 01 March 2013

Received: 01 May 2012

Published in TOCT Volume 5, Issue 3

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Research-article
Research
Refereed

Funding Sources

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

2
Total Citations
View Citations
275
Total Downloads

Downloads (Last 12 months)30
Downloads (Last 6 weeks)5

Reflects downloads up to 15 Feb 2025

Other Metrics

View Author Metrics

Citations

Cited By

Chen XCheng KLi XOuyang M(2023)Improved Decoding of Expander CodesIEEE Transactions on Information Theory10.1109/TIT.2023.323916369:6(3574-3589)Online publication date: 1-Jun-2023
https://dl.acm.org/doi/10.1109/TIT.2023.3239163
Dowling MGao S(2018)Fast Decoding of Expander CodesIEEE Transactions on Information Theory10.1109/TIT.2017.272606464:2(972-978)Online publication date: 1-Feb-2018
https://dl.acm.org/doi/10.1109/TIT.2017.2726064

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Article

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Figures

Tables

Media

View Issue’s Table of Contents