Abstract
We will introduce a new class of erasure codes built from irregular bipartite graphs that have linear time encoding and decoding algorithms and can transmit over an erasure channel at rates arbitrarily close to the channel capacity. We also show that these codes are close to optimal with respect to the trade-off between the proximity to the channel capacity and the running time of the recovery algorithm.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
N. Alon and M. Luby. A linear time erasure-resilient code with nearly optimal recovery.IEEE Trans. Inform. Theory, 42:1732–1736, 1996.
R.E. Blahut. Theory and Practice of Error Control Codes. Addison Wesley, Reading, MA, 1983.
P. Elias. Coding for two noisy channels. In Information Theory, Third London Symposium, pages 61–76, 1955.
R. G. Gallager. Low Density Parity-Check Codes. MIT Press, Cambridge, MA, 1963.
R.L. Graham, D.E. Knuth, and P. Patashnik. Concrete Mathematics. Addison-Wesley, 1994.
M. Luby, M. Mitzenmacher, and M.A. Shokrollahi. Analysis of random processes via and-or tree evaluation. In Proceedings of the 9th Annual ACM-SIAM Symposium on Discrete Algorithms, page 364–373, 1998.
M. Luby, M. Mitzenmacher, M.A. Shokrollahi, and D. Spielman. Analysis of low density codes and improved designs using irregular graphs. In Proceedings of the 30th Annual ACM Symposium on Theory of Computing, pages 249–258, 1998.
M. Luby, M. Mitzenmacher, M.A. Shokrollahi, D. Spielman, and V. Stemann. Practical loss-resilient codes. In Proceedings of the 29th annual ACM Symposium on Theory of Computing, pages 150–159, 1997.
M. Luby and M.A. Shokrollahi. Right regular erasure codes. Unpublished, 1998.
F.J. MacWilliams and N.J.A. Sloane. The Theory of Error-Correcting Codes. North-Holland, 1988.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Shokrollahi, M.A. (1999). New Sequences of Linear Time Erasure Codes Approaching the Channel Capacity. In: Fossorier, M., Imai, H., Lin, S., Poli, A. (eds) Applied Algebra, Algebraic Algorithms and Error-Correcting Codes. AAECC 1999. Lecture Notes in Computer Science, vol 1719. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-46796-3_7
Download citation
DOI: https://doi.org/10.1007/3-540-46796-3_7
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-66723-0
Online ISBN: 978-3-540-46796-0
eBook Packages: Springer Book Archive