-
1
-
-
0036612281
-
-
C. Di, D. Proietti, T. Richardson, E. Telatar, and R. Urbanke, Finite length analysis of low-density parity-check codes on the binary erasure channel, IEEE Trans. Inform. Theory, 48, pp. 1570-1579.
-
C. Di, D. Proietti, T. Richardson, E. Telatar, and R. Urbanke, "Finite length analysis of low-density parity-check codes on the binary erasure channel," IEEE Trans. Inform. Theory, vol. (48), pp. 1570-1579.
-
-
-
-
2
-
-
0036285016
-
Low density parity check codes for digital subscriber lines
-
New York, NY
-
E. Eleftheriou and S. Ölçer, "Low density parity check codes for digital subscriber lines", Proc. of the IEEE Int. Conf. on Commun., New York, NY, 2002, pp. 1752-1757.
-
(2002)
Proc. of the IEEE Int. Conf. on Commun
, pp. 1752-1757
-
-
Eleftheriou, E.1
Ölçer, S.2
-
3
-
-
0001813506
-
Array-codes as low-density parity-check codes
-
Brest, France, pp, Sept
-
J. L. Fan, "Array-codes as low-density parity-check codes," Second Int. Symp. on Turbo Codes, Brest, France, pp. 543-46, Sept. 2000.
-
(2000)
Second Int. Symp. on Turbo Codes
, pp. 543-546
-
-
Fan, J.L.1
-
4
-
-
15044355718
-
-
J. Feldman, M. J. Wainwright and D. R. Karger, Using linear programming to decode binary linear codes, IEEE Trans. Inform. Theory, 51, pp. 954-972.
-
J. Feldman, M. J. Wainwright and D. R. Karger, "Using linear programming to decode binary linear codes", IEEE Trans. Inform. Theory, vol. (51), pp. 954-972.
-
-
-
-
5
-
-
0035246123
-
-
G. D. Forney, Codes on graphs: normal realizations, IEEE Trans. Inform. Theory, 47, pp. 520-548, Feb. 2001.
-
G. D. Forney, "Codes on graphs: normal realizations", IEEE Trans. Inform. Theory, vol. (47), pp. 520-548, Feb. 2001.
-
-
-
-
6
-
-
23844506274
-
Weaknesses of Margulis and Ramanujan-Margulis low-density parity-check codes
-
D. MacKay and M. Postol, "Weaknesses of Margulis and Ramanujan-Margulis low-density parity-check codes," Elec. Notes in Theo. Comp. Sci., vol. 74, 2003.
-
(2003)
Elec. Notes in Theo. Comp. Sci
, vol.74
-
-
MacKay, D.1
Postol, M.2
-
9
-
-
0346707318
-
On the minimum distance of array codes as LDPC codes
-
Dec
-
K. Yang and T. Helleseth, "On the minimum distance of array codes as LDPC codes", IEEE Trans. Inform. Theory, vol. 49(12), pp. 3268-3271, Dec. 2003.
-
(2003)
IEEE Trans. Inform. Theory
, vol.49
, Issue.12
, pp. 3268-3271
-
-
Yang, K.1
Helleseth, T.2
-
10
-
-
50949097623
-
Investigation of error floors of structured low-density parity-check codes via hardware simulation
-
San Francisco, CA, Nov.-Dec
-
Z. Zhang, L. Doleèek, B. Nikolic, V. Anantharam and M. Wainwright, "Investigation of error floors of structured low-density parity-check codes via hardware simulation", Proc. GLOBECOM 2006, San Francisco, CA, Nov.-Dec. 2006.
-
(2006)
Proc. GLOBECOM 2006
-
-
Zhang, Z.1
Doleèek, L.2
Nikolic, B.3
Anantharam, V.4
Wainwright, M.5
|