Abstract
We introduce and analyze a new statistical ensemble of lowdensity parity-check convolutional (LDC) codes. The result of the analysis are bounds, such as a lower bound for the free distance and upper bounds for the burst error probability of the LDC codes.
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
C. Berrou, A. Glavieux and P. Thitimajshima, “Near Shannon Limit Error Correcting Coding and Decoding: Turbo-Codes”, Proceedings ICC-93, pp. 1064–1070.
R. G. Gallager, Low-Density Parity-Check Codes, M.I.T. Press, Cambridge, Massachusetts, 1963.
A. Jimenez and K. Sh. Zigangirov, “Periodic Time-Varying Convolutional Codes with Low-Density Parity-Check Matrices”, IEEE Trans. on Inform. Theory, vol. IT-45, no. 5, Sept. 1999.
K. Engdahl and K. Sh. Zigangirov, “On the Statistical Theory of Turbo-Codes”, Proceedings ACCT-98, pp. 108–111.
K. Engdahl and K. Sh. Zigangirov, “On Low-Density Parity-Check Convolutional Codes”, Proceedings WCC-99, pp. 379–392.
K. Engdahl and K. Sh. Zigangirov, “On the Theory of Low-Density Convolutional Codes I”, Probl. Peredach. Inform., vol. 35, no. 4, Oct-Nov-Dec 1999.
R. Johannesson and K. Sh. Zigangirov, Fundamentals of Convolutional Coding, IEEE Press, 1999.
K. Engdahl, M. Lentmaier and K. Sh. Zigangirov, “On the Theory of Low-Density Convolutional Codes II”, in preparation.
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
Engdahl, K., Lentmaier, M., Zigangirov, K.S. (1999). On the Theory of Low-Density Convolutional Codes. 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_8
Download citation
DOI: https://doi.org/10.1007/3-540-46796-3_8
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