Abstract
The recent invention of turbo codes and the rediscovery of LDPC codes have brought back into favour the theoretical limits of transmission which were reputed to be inaccessible until now. This chapter provides the conceptual bases necessary to understand and compute these limits, in particular those that correspond to real transmission situations with messages of finite length and binary modulations.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Bibliography
C. Berrou, E. Maury, and H. Gonzalez. Which minimum hamming distance do we really need? In Proceedings of the 3rd International Symposium on Turbo Codes & related topics (ISTC 2003), pages 141–148, Brest, France, Sept. 2003.
R.E. Gallager. Information Theory and Reliable Communications. John Wiley & Sons, 1968.
C.E. Shannon. A mathematical theory of communication. Bell Systems Technical Journal, 27, July-Oct. 1948.
C.E. Shannon. Probability of error for optimal codes in a gaussian channel. Bell Systems Technical Journal, 38, 1959.
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag France, Paris
About this chapter
Cite this chapter
(2010). Theoretical limits. In: Berrou, C. (eds) Codes and Turbo Codes. Collection IRIS. Springer, Paris. https://doi.org/10.1007/978-2-8178-0039-4_3
Download citation
DOI: https://doi.org/10.1007/978-2-8178-0039-4_3
Publisher Name: Springer, Paris
Print ISBN: 978-2-8178-0038-7
Online ISBN: 978-2-8178-0039-4
eBook Packages: Computer ScienceComputer Science (R0)