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.
Supplemental Material
Available for Download
Supplemental movie, appendix, image and software files for, Linear-time decoding of regular expander codes
- Barg, A. and Zémor, G. 2002. Error exponents of expander codes. IEEE Trans. Inf. Theory 48, 6, 1725--1729. Google Scholar
Digital Library
- 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. Google Scholar
Digital Library
- 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. Google Scholar
Digital Library
- 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. Google Scholar
Digital Library
- 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. Google Scholar
Digital Library
- Feldman, J. 2003. Decoding error-correcting codes via linear programming. Ph.D. dissertation. http://hdl.handle.net/1721.1/42831. Google Scholar
Digital Library
- 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.Google Scholar
- 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. Google Scholar
Digital Library
- 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. Google Scholar
Digital Library
- Gallager, R. G. 1963. Low-Density Parity-Check Codes. The M.I.T. Press, Cambridge, MA.Google Scholar
- Gallager, R. G. 1968. Information Theory and Reliable Communication. Wiley, New York. Google Scholar
Digital Library
- 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. Google Scholar
Digital Library
- 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. Google Scholar
Digital Library
- 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?genre=article& issn=0302-9743& volume=3142& spage=695.Google Scholar
- 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. Google Scholar
Digital Library
- Lubotzky, A., Phillips, R., and Sarnak, P. 1988. Ramanujan graphs. Combinatorica 8, 3, 261--277.Google Scholar
Cross Ref
- 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?genre=article&issn=0302-9743&volume=1025&spage=100. Google Scholar
Digital Library
- 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.Google Scholar
Cross Ref
- Margulis, G. A. 1982. Explicit constructions of graphs without short cycles and low density codes. Combinatorica 2, 1, 71--78. DOI: http://dx.doi.org/10.1007/BF02579283.Google Scholar
Cross Ref
- Pearl, J. 1988. Probabilistic Inference in Intelligent Systems. Networks of Plausible Inference. Morgan Kaufmann, San Mateo, CA. Google Scholar
Digital Library
- Reingold, O., Vadhan, S., and Wigderson, A. 2002. Entropy waves, the zig-zag graph product, and new constant-degree expanders. ANNALSMTH: Ann. Math. 155.Google Scholar
- 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. Google Scholar
Digital Library
- Richardson, T. J. and Urbanke, R. L. 2001b. Efficient encoding of low-density parity-check codes. IEEE Trans. Inf. Theory 47, 2, 638--656. Google Scholar
Digital Library
- 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?arnumber=1216740.Google Scholar
- 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. Google Scholar
Digital Library
- Sipser, M. and Spielman, D. A. 1996. Expander codes. IEEE Trans. Inf. Theory 42, 6, 1710--1722. Google Scholar
Cross Ref
- Spielman, D. A. 1996. Linear-time encodable and decodable error-correcting codes. IEEE Trans. Inf. Theory 42, 6, 1723--1731. Google Scholar
Cross Ref
- Sudan, M. 2000. List decoding: algorithms and applications. SIGACT News 31, 1, 16--27. http://doi.acm.org/10.1145/346048.346049. Google Scholar
Digital Library
- 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. Google Scholar
Digital Library
- Tanner, R. M. 1981. A recursive approach to low complexity codes. IEEE Trans. Inf. Theory 27, 5, 533--547. Google Scholar
Digital Library
- 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.Google Scholar
- Vontobel, P. O. 2008. Interior-point algorithms for linear-programming decoding. CoRR abs/0802.1369. http://arxiv.org/abs/0802.1369. informal publication.Google Scholar
- Zémor, G. 2001. On expander codes. IEEE Trans. Inf. Theory 47, 2, 835--837. Google Scholar
Digital Library
- 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.Google Scholar
Index Terms
Linear-time decoding of regular expander codes
Recommendations
Linear time decoding of regular expander codes
ITCS '12: Proceedings of the 3rd Innovations in Theoretical Computer Science ConferenceSipser 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 ...
Local correctability of expander codes
ICALP'13: Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part IIn 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 ...
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