Cryptography Reference
In-Depth Information
[7.23] C. Douillard and C. Berrou. Turbo codes with rate-m/(m+1) constituent
convolutional codes.
IEEE Trans. Commun.
, 53(10):1630-1638, Oct.
2005.
[7.24] L. Duan and B. Rimoldi. The iterative turbo decoding algorithm has fixed
points.
IEEE Transactions on Information Theory
, 47(7):2993-2995, Nov.
2001.
[7.25] P. Elias. Error-free coding.
IEEE Transactions on Information Theory
,
4(4):29-39, Sept. 1954.
[7.26] R. G. Gallager. Low-density parity-check codes.
IRE Transactions on
Information Theory
, IT-8:21-28, Jan. 1962.
[7.27] R. Garello and A. Vila Casado. The all-zero iterative decoding algo-
rithm for turbo code minimum distance computation. In
Proceedings of
IEEE International Conference on Communications (ICC'2004)
, pages
361-364, Paris, France, 2004.
[7.28] R. Garello, P. Pierloni, and S. Benedetto. Computing the free distance of
turbo codes and serially concatened codes with interleavers: Algorithms
and applications.
IEEE Journal on Selected Areas in Communications
,
May 2001.
[7.29] K. Gracie and M.-H. Hamon. Turbo and turbo-like codes: Principles
and applications in telecommunications. In
Proceedings of the IEEE
,vol-
ume 95, pages 1228-1254, June 2007.
[7.30] J. Hagenauer and P. Hoeher. Concatenated viterbi-decoding. In
Proceed-
ings of International Workshop on Information Theory
, pages 136-139,
Gotland, Sweden, Aug.-Sept. 1989.
[7.31] J. Hagenauer and P. Hoeher. A viterbi algorithm with soft-decision out-
puts and its applications. In
Proceedings of IEEE Global Communications
Conference (Globecom'89)
, pages 1680-1686, Dallas, Texas, USA, Nov.
1989.
[7.32] J. Hagenauer and P. Hoeher. Turbo decoding with tail-biting trellises. In
Proceedings of Signals, Systems and Electronics, URSI Int'l Symposium
,
pages 343-348, Sept.-Oct. 1998.
[7.33] G. H. Hardy and E. M. Wright.
An Introduction to the Theory of Numbers
.
Oxford Univ. Press, Oxford, UK, 1979.
[7.34] C. Heegard and S. B. Wicker. Chapter 3. In
Turbo coding
.KluwerAca-
demic Publishers, 1999.
