Cryptography Reference
In-Depth Information
[9.25] D. Haley, A. Grant, and J. Buetefuer. Iterative encoding of low-density
parity-check codes. In
Proceedings of IEEE Global Telecommunications
Conference (GLOBECOM'02)
, Nov. 2002.
[9.26] X.-Y. Hu, M.P.C. Fossorier, and E. Eleftheriou. On the computation of
the minimum distance of low-density parity-check codes. In
Proceedings
of IEEE International Conference on Communications (ICC'04)
, 2004.
[9.27] X.-Y. Hu and R. Mittelholzer. An ordered-statistics-based approxima-
tion of the sum-product algorithm. In
Proceedings of IEEE International
Telecommunications Symposium
, Natal, Brazil, 8-12 Sept. 2002.
[9.28] X.-Y. Hu and R. Mittelholzer. A sorting-based approximation of the sum-
product algorithm.
Journal of the Brazilian Telecommunications Society
,
18:54-60, June 2003.
[9.29] X.Y. Hu, E. Eleftheriou, and D.-M. Arnold. Progressive edge-growth
tanner graphs. In
Proceedings of IEEE Global Telecommunications Con-
ference (GLOBECOM'01)
, Nov. 2001.
[9.30] S.J. Johnson and S.R. Weller. Construction of low-density parity-check
codes from kirkman triple systems. In
Proceedings of IEEE Global
Telecommunication Conference (GLOBECOM'01)
, volume 2, pages 970-
974, 25-29 Nov. 2001.
[9.31] S.J. Johnson and S.R. Weller. Regular low-density parity-check codes from
combinatorial designs. In
Proceedings of Information Theory Workshop
,
pages 90-92, Sept. 2001.
[9.32] C. Jones, E. Vallés, M. Smith, and J. Villasenor. Approximate min*
constraint node updating for ldpc code decoding. In
Proceedings of IEEE
Military Communications Conference (MILCOM'03)
, 13-16 Oct. 2003.
[9.33] R. Koetter and P.O. Vontobel. Graph-covers and the iterative decoding
of finite length codes. In
Proceedings of 3rd International Symposium on
turboCodes & Related Topics
, Sept. 2003.
[9.34] Y. Kou, S. Lin, and M.P.C. Fossorier. Low-density parity-check codes
based on finite geometries: A rediscovery and new results.
IEEE Trans-
actions on Information Theory
, 47:2711-2736, Nov. 2001.
[9.35] F.R. Kschischang and B.J. Frey. Iterative decoding of compound codes by
probability propagation in graphical models.
IEEE Journal on Selected
Areas in Commununications
, 16:219-230, 1998.
[9.36] D. J. C. MacKay. Good error-correcting codes based on very sparse ma-
trices.
IEEE Transactions on Information Theory
, 45(2):399-431, March
1999.
