Cryptography Reference
In-Depth Information
[8.13] L.E. Nazarov and V.M. Smolyaninov. Use of fast walsh-hadamard trans-
formation for optimal symbol-by-symbol binary block-code decoding.
Electronics Letters
, 34:261-262, 1998.
[8.14] R. Pyndiah, A. Glavieux, A. Picart, and S. Jacq. Near optimum decod-
ing of product codes. In
Proceedings of IEEE Global Communications
Conference (GLOBECOM'94)
, San Francisco, 1994.
[8.15] S. M. Reddy and J. P. Robinson. Random error and burst corrections
by iterated codes.
IEEE Transactions on Information Theory
, 18(1):182-
185, 1972.
[8.16] N. Sendrier.
Codes correcteurs à haut pouvoir de correction
.PhDthesis,
Université Paris VI, 1991.
[8.17] V. Sorokine, F.R. Kschischang, and V. Durand. Trellis based decoding of
binary linear block codes.
Lecture Notes in Computer Science
, 793:270-
286, 1994.
[8.18] M. Sudan. Decoding of reed-solomon codes beyond the error correction
bound.
Journal of Complexity
, 12:180-193, 1997.
[8.19] J. Wolf. Ecient maximum likelihood decoding of linear block codes using
a trellis.
IEEE Transactions on Information Theory
, 24:76-80, 1978.
