-
1
-
-
84856043672
-
A mathematical theory of communication
-
Jul
-
C. E. Shannon, "A mathematical theory of communication," Bell Syst. Tech. J., vol. 27, pt. I, pp. 379-423, Jul. 1948.
-
(1948)
Bell Syst. Tech. J
, vol.27
, Issue.PART. I
, pp. 379-423
-
-
Shannon, C.E.1
-
2
-
-
84925405668
-
Low density parity-check codes
-
Jan
-
R. G. Gallager, "Low density parity-check codes," IRE Trans. Inf. Theory, vol. IT-8, no. 1, pp. 21-28, Jan. 1962.
-
(1962)
IRE Trans. Inf. Theory
, vol.IT-8
, Issue.1
, pp. 21-28
-
-
Gallager, R.G.1
-
4
-
-
0030219216
-
Near Shannon limit performance of low density parity-check codes
-
Aug
-
D. J. C. MacKay and R. M. Neal, "Near Shannon limit performance of low density parity-check codes," Electron. Lett., vol. 32, no. 18, pp. 1645-1646, Aug. 1996.
-
(1996)
Electron. Lett
, vol.32
, Issue.18
, pp. 1645-1646
-
-
MacKay, D.J.C.1
Neal, R.M.2
-
5
-
-
0033099611
-
Good error-correcting codes based on very sparse matrices
-
Mar
-
D. J. C. MacKay, "Good error-correcting codes based on very sparse matrices," IEEE Trans. Inf. Theory, vol. 45, no. 2, pp. 399-432, Mar. 1999.
-
(1999)
IEEE Trans. Inf. Theory
, vol.45
, Issue.2
, pp. 399-432
-
-
MacKay, D.J.C.1
-
7
-
-
0035246307
-
The capacity of low-density parity-check codes under message-passing decoding
-
Feb
-
T. J. Richardson and R. L. Urbanke, "The capacity of low-density parity-check codes under message-passing decoding," IEEE Trans. Inf. Theory, vol. 47, no. 2, pp. 599-618, Feb. 2001.
-
(2001)
IEEE Trans. Inf. Theory
, vol.47
, Issue.2
, pp. 599-618
-
-
Richardson, T.J.1
Urbanke, R.L.2
-
8
-
-
0035246127
-
Design of capacity-approaching irregular low density parity-check codes
-
Feb
-
T. J. Richardson, M. A. Shokrollahi, and R. L. Urbanke, "Design of capacity-approaching irregular low density parity-check codes," IEEE Trans. Inf. Theory, vol. 47, no. 2, pp. 619-637, Feb. 2001.
-
(2001)
IEEE Trans. Inf. Theory
, vol.47
, Issue.2
, pp. 619-637
-
-
Richardson, T.J.1
Shokrollahi, M.A.2
Urbanke, R.L.3
-
9
-
-
0019608335
-
A recursive approach to low complexity codes
-
Sep
-
R. M. Tanner, "A recursive approach to low complexity codes," IEEE Trans. Inf. Theory, vol. IT-27, no. 5, pp. 533-547, Sep. 1981.
-
(1981)
IEEE Trans. Inf. Theory
, vol.IT-27
, Issue.5
, pp. 533-547
-
-
Tanner, R.M.1
-
10
-
-
0003846836
-
Codes and Decoding on General Graphs,
-
Ph.D. dissertation, Dept. Elec. Eng, Univ. Linköping, Linköping, Sweden
-
N. Wiberg, "Codes and Decoding on General Graphs," Ph.D. dissertation, Dept. Elec. Eng., Univ. Linköping, Linköping, Sweden, 1996.
-
(1996)
-
-
Wiberg, N.1
-
11
-
-
0035246564
-
Factor graphs and the sum-product algorithm
-
Feb
-
F. R. Kschischang, B. J. Frey, and H.-A. Loeliger, "Factor graphs and the sum-product algorithm," IEEE Trans. Inf. Theory, vol. 47, no. 2, pp. 498-519, Feb. 2001.
-
(2001)
IEEE Trans. Inf. Theory
, vol.47
, Issue.2
, pp. 498-519
-
-
Kschischang, F.R.1
Frey, B.J.2
Loeliger, H.-A.3
-
12
-
-
0035504019
-
Low density parity-check codes based on finite geometries: A discovery and new results
-
Nov
-
Y. Kou, S. Lin, and M. P. C. Fossorier, "Low density parity-check codes based on finite geometries: A discovery and new results," IEEE Trans. Inf. Theory, vol. 47, no. 7, pp. 2711-2736, Nov. 2001.
-
(2001)
IEEE Trans. Inf. Theory
, vol.47
, Issue.7
, pp. 2711-2736
-
-
Kou, Y.1
Lin, S.2
Fossorier, M.P.C.3
-
13
-
-
0034865126
-
Spectral graphs for quasi-cyclic LDPC codes
-
Washington, D.C, Jun
-
R. M. Tanner, "Spectral graphs for quasi-cyclic LDPC codes," in Proc. IEEE Int. Symp. Information Theory, Washington, D.C, Jun. 2001, p. 226.
-
(2001)
Proc. IEEE Int. Symp. Information Theory
, pp. 226
-
-
Tanner, R.M.1
-
14
-
-
1642392439
-
Codes for iterative decoding from partial geometries
-
Feb
-
S. J. Johnson and S. R. Weller, "Codes for iterative decoding from partial geometries," IEEE Trans. Commun, vol. 52, no. 2, pp. 236-243, Feb. 2004.
-
(2004)
IEEE Trans. Commun
, vol.52
, Issue.2
, pp. 236-243
-
-
Johnson, S.J.1
Weller, S.R.2
-
15
-
-
0042092025
-
A class of low-density parity-check codes constructed based on Reed-Solomon codes with two information symbols
-
Jul
-
I. Djurdjevic, J. Xu, K. Abdel-Ghaffar, and S. Lin, "A class of low-density parity-check codes constructed based on Reed-Solomon codes with two information symbols," IEEE Commun. Lett., vol. 7, no. 7, pp. 317-319, Jul. 2003.
-
(2003)
IEEE Commun. Lett
, vol.7
, Issue.7
, pp. 317-319
-
-
Djurdjevic, I.1
Xu, J.2
Abdel-Ghaffar, K.3
Lin, S.4
-
16
-
-
3543037365
-
Near-Shannon limit quasicyclic low-density parity-check codes
-
Jul
-
L. Chen, J. Xu, I. Djurdjevic, and S. Lin, "Near-Shannon limit quasicyclic low-density parity-check codes," IEEE Trans. Commun, vol. 52, no. 7, pp. 1038-1042, Jul. 2004.
-
(2004)
IEEE Trans. Commun
, vol.52
, Issue.7
, pp. 1038-1042
-
-
Chen, L.1
Xu, J.2
Djurdjevic, I.3
Lin, S.4
-
17
-
-
2942659753
-
Combinatorial constructions of low-density parity-check codes for iterative decoding
-
Jun
-
B. Vasic and O. Milenkovic, "Combinatorial constructions of low-density parity-check codes for iterative decoding," IEEE Trans. Inf. Theory vol. 50, no. 6, pp. 1156-1176, Jun. 2004.
-
(2004)
IEEE Trans. Inf. Theory
, vol.50
, Issue.6
, pp. 1156-1176
-
-
Vasic, B.1
Milenkovic, O.2
-
18
-
-
2942640145
-
On algebraic construction of Gallager and circulant low density parity-check codes
-
Jun
-
H. Tang, J. Xu, Y. Kou, S. Lin, and K. Abdel-Ghaffar, "On algebraic construction of Gallager and circulant low density parity-check codes," IEEE Trans. Info. Theory, vol. 50, no. 6, pp. 1269-1279, Jun. 2004.
-
(2004)
IEEE Trans. Info. Theory
, vol.50
, Issue.6
, pp. 1269-1279
-
-
Tang, H.1
Xu, J.2
Kou, Y.3
Lin, S.4
Abdel-Ghaffar, K.5
-
19
-
-
2942661950
-
Construction of low density parity-check codes based on balanced incomplete block designs
-
Jun
-
B. Ammar, B. Honary, Y. Kou, J. Xu, and S. Lin, "Construction of low density parity-check codes based on balanced incomplete block designs," IEEE Trans. Inf. Theory, vol. 50, no. 6, pp. 1257-1268, Jun. 2004.
-
(2004)
IEEE Trans. Inf. Theory
, vol.50
, Issue.6
, pp. 1257-1268
-
-
Ammar, B.1
Honary, B.2
Kou, Y.3
Xu, J.4
Lin, S.5
-
20
-
-
5044244497
-
Construction of quasicyclic LDPC codes based on the minimum weight code-words of Reed-Solomon codes
-
Chicago, IL, Jun
-
L. Chen, I. Djurdjevic, J. Xu, S. Lin, and K. Abdel-Ghaffar, "Construction of quasicyclic LDPC codes based on the minimum weight code-words of Reed-Solomon codes," in Proc. IEEE Int. Symp. Information Theory, Chicago, IL, Jun. 2004, p. 239.
-
(2004)
Proc. IEEE Int. Symp. Information Theory
, pp. 239
-
-
Chen, L.1
Djurdjevic, I.2
Xu, J.3
Lin, S.4
Abdel-Ghaffar, K.5
-
21
-
-
3943064364
-
Quasicyclic low-density parity-check codes from circulant permutation matrices
-
Aug
-
M. P. C. Fossorier, "Quasicyclic low-density parity-check codes from circulant permutation matrices," IEEE Trans. Inf. Theory, vol. 50, no. 8, pp. 1788-1793, Aug. 2004.
-
(2004)
IEEE Trans. Inf. Theory
, vol.50
, Issue.8
, pp. 1788-1793
-
-
Fossorier, M.P.C.1
-
22
-
-
0001813506
-
Array codes as low-density parity-check codes
-
Brest, France, Sep
-
J. L. Fan, "Array codes as low-density parity-check codes," in Proc. 2nd Int. Symp. Turbo Codes and Related Topics, Brest, France, Sep. 2000, pp. 543-546.
-
(2000)
Proc. 2nd Int. Symp. Turbo Codes and Related Topics
, pp. 543-546
-
-
Fan, J.L.1
-
23
-
-
10644247292
-
A class of group-structured LDPC codes
-
Ambleside, U.K, Jul
-
R. M. Tanner, D. Sridhara, and T. Fuja, "A class of group-structured LDPC codes," in Proc. 6th Int. Symp. Communication Theory and Applications, Ambleside, U.K., Jul. 2001, pp. 365-370.
-
(2001)
Proc. 6th Int. Symp. Communication Theory and Applications
, pp. 365-370
-
-
Tanner, R.M.1
Sridhara, D.2
Fuja, T.3
-
24
-
-
33645725165
-
On the girth of Tanner (3, 5) quasi-cyclic LDPC codes
-
Apr
-
S. Kim, J.-S. No, H. Chung, and D.-J. Shin, "On the girth of Tanner (3, 5) quasi-cyclic LDPC codes," IEEE Trans. Inf. Theory, vol. 52, no. 4, pp. 1729-1744, Apr. 2006.
-
(2006)
IEEE Trans. Inf. Theory
, vol.52
, Issue.4
, pp. 1729-1744
-
-
Kim, S.1
No, J.-S.2
Chung, H.3
Shin, D.-J.4
-
25
-
-
27844564305
-
A combining method of quasi-cyclic LDPC codes by the chinese remainder theorem
-
Sep
-
S. Myung and K. Yang, "A combining method of quasi-cyclic LDPC codes by the chinese remainder theorem," IEEE Commun. Lett., vol. 9, pp. 823-825, Sep. 2005.
-
(2005)
IEEE Commun. Lett
, vol.9
, pp. 823-825
-
-
Myung, S.1
Yang, K.2
-
26
-
-
33749436710
-
A class of quasi-cyclic regular LDPC codes from cyclic difference families with girth 8
-
Adelaide, Australia, Sep
-
M. Fujisawa and S. Sakata, "A class of quasi-cyclic regular LDPC codes from cyclic difference families with girth 8," in Proc. IEEE Int. Symp. Information Theory, Adelaide, Australia, Sep. 2005, pp. 2290-2294.
-
(2005)
Proc. IEEE Int. Symp. Information Theory
, pp. 2290-2294
-
-
Fujisawa, M.1
Sakata, S.2
-
27
-
-
31344444084
-
An algebraic method for constructing quasi-cyclic LDPC codes
-
Parma, Italy, Oct
-
L. Chen, L. Lan, I. Djurdjevic, S. Lin, and K. Abdel-Ghaffar, "An algebraic method for constructing quasi-cyclic LDPC codes," in Proc. Int. Symp. Information Theory and Its Applications (ISITA), Parma, Italy, Oct. 2004, pp. 535-539.
-
(2004)
Proc. Int. Symp. Information Theory and Its Applications (ISITA)
, pp. 535-539
-
-
Chen, L.1
Lan, L.2
Djurdjevic, I.3
Lin, S.4
Abdel-Ghaffar, K.5
-
28
-
-
13444301410
-
Codes on finite geometries
-
Feb
-
H. Tang, J. Xu, S. Lin, and K. Abdel-Ghaffar, "Codes on finite geometries," IEEE Trans. Inf. Theory, vol. 51, no. 2, pp. 572-596, Feb. 2005.
-
(2005)
IEEE Trans. Inf. Theory
, vol.51
, Issue.2
, pp. 572-596
-
-
Tang, H.1
Xu, J.2
Lin, S.3
Abdel-Ghaffar, K.4
-
29
-
-
15544386457
-
Construction of low-density parity-check codes by superposition
-
Feb
-
J. Xu, L. Chen, L.-Q. Zeng, L. Lan, and S. Lin, "Construction of low-density parity-check codes by superposition," IEEE Trans. Commun vol. 53, no. 2, pp. 243-251, Feb. 2005.
-
(2005)
IEEE Trans. Commun
, vol.53
, Issue.2
, pp. 243-251
-
-
Xu, J.1
Chen, L.2
Zeng, L.-Q.3
Lan, L.4
Lin, S.5
-
31
-
-
0034850871
-
Weight distributions: How deviant can you be?
-
Washington, DC, Jun
-
C. Di, R. Urbanke, and T. Richardson, "Weight distributions: How deviant can you be?," in Proc. IEEE Int. Symp. Information Theory Washington, DC, Jun. 2001, p. 50.
-
(2001)
Proc. IEEE Int. Symp. Information Theory
, pp. 50
-
-
Di, C.1
Urbanke, R.2
Richardson, T.3
-
32
-
-
15044364240
-
Stopping set distribution of LDPC code ensembles
-
Mar
-
A. Orlitsky, K. Viswanathan, and J. Zhang, "Stopping set distribution of LDPC code ensembles," IEEE Trans. Inf. Theory, vol. 51, no. 3, pp. 929-953, Mar. 2005.
-
(2005)
IEEE Trans. Inf. Theory
, vol.51
, Issue.3
, pp. 929-953
-
-
Orlitsky, A.1
Viswanathan, K.2
Zhang, J.3
-
33
-
-
31344477491
-
Efficient encoding of quasi-cyclic low-density parity-check codes
-
Jan
-
Z.-W. Li, L. Chen, L.-Q. Zeng, S. Lin, and W. H. Fong, "Efficient encoding of quasi-cyclic low-density parity-check codes," IEEE Trans. Commun., vol. 54, no. 1, pp. 71-81, Jan. 2006.
-
(2006)
IEEE Trans. Commun
, vol.54
, Issue.1
, pp. 71-81
-
-
Li, Z.-W.1
Chen, L.2
Zeng, L.-Q.3
Lin, S.4
Fong, W.H.5
-
34
-
-
0035246320
-
Efficient encoding of low-density parity-check codes
-
Feb
-
T. J. Richardson and R. L. Urbanke, "Efficient encoding of low-density parity-check codes," IEEE Trans. Inf. Theory, vol. 47, no. 2, pp. 638-656, Feb. 2001.
-
(2001)
IEEE Trans. Inf. Theory
, vol.47
, Issue.2
, pp. 638-656
-
-
Richardson, T.J.1
Urbanke, R.L.2
-
35
-
-
0000292532
-
Codes correcteurs d'erreurs
-
A. Hocquenghem, "Codes correcteurs d'erreurs," Chiffres, vol. 2, pp. 147-156, 1959.
-
(1959)
Chiffres
, vol.2
, pp. 147-156
-
-
Hocquenghem, A.1
-
36
-
-
50549175697
-
On a class of error correcting binary group codes
-
Mar
-
R. C. Bose and D. K. Ray-Chaudhuri, "On a class of error correcting binary group codes," Inf. Contr., vol. 3, pp. 68-79, Mar. 1960.
-
(1960)
Inf. Contr
, vol.3
, pp. 68-79
-
-
Bose, R.C.1
Ray-Chaudhuri, D.K.2
-
37
-
-
0001174154
-
Polynomial codes over certain finite fields
-
Jun
-
I. S. Reed and G. Solomon, "Polynomial codes over certain finite fields," J. Soc. Ind. Appl. Math, vol. 8, pp. 300-304, Jun. 1960.
-
(1960)
J. Soc. Ind. Appl. Math
, vol.8
, pp. 300-304
-
-
Reed, I.S.1
Solomon, G.2
-
38
-
-
33749437278
-
Constructions of quasi-cyclic LDPC codes for AWGN and binary erasure channels based on finite fields and affine mappings
-
Adelaide, Australia, Sep
-
L. Lan, L.-Q. Zeng, Y. Y. Tai, S. Lin, and K. Abdel-Ghaffar, "Constructions of quasi-cyclic LDPC codes for AWGN and binary erasure channels based on finite fields and affine mappings," in Proc. IEEE Int. Symp. Information Theory, Adelaide, Australia, Sep. 2005, pp. 2285-2289.
-
(2005)
Proc. IEEE Int. Symp. Information Theory
, pp. 2285-2289
-
-
Lan, L.1
Zeng, L.-Q.2
Tai, Y.Y.3
Lin, S.4
Abdel-Ghaffar, K.5
-
39
-
-
33846041992
-
Construction of regular and irregular LDPC codes: Geometry decomposition and masking
-
Jan
-
J. Xu, L. Chen, I. Djurdjevic, S. Lin, and K. Abdel-Ghaffar, "Construction of regular and irregular LDPC codes: Geometry decomposition and masking," IEEE Trans. Inf. Theory, vol. 53, no. 1, pp. 121-134, Jan. 2007.
-
(2007)
IEEE Trans. Inf. Theory
, vol.53
, Issue.1
, pp. 121-134
-
-
Xu, J.1
Chen, L.2
Djurdjevic, I.3
Lin, S.4
Abdel-Ghaffar, K.5
-
40
-
-
33845579484
-
Error floors of LDPC codes
-
Monticello, IL, Oct
-
T. J. Richardson, "Error floors of LDPC codes," in Proc. Allerton Conf. Communications, Control and Computing, Monticello, IL, Oct. 2003, pp. 1426-1435.
-
(2003)
Proc. Allerton Conf. Communications, Control and Computing
, pp. 1426-1435
-
-
Richardson, T.J.1
-
41
-
-
29144494129
-
Improved weighted bit-flipping algorithm for decoding LDPC codes
-
Dec
-
M. Shan, C. Zhao, and M. Jiang, "Improved weighted bit-flipping algorithm for decoding LDPC codes," IEE Proc. Commun., vol. 152, no. 6, pp. 919-922, Dec. 2005.
-
(2005)
IEE Proc. Commun
, vol.152
, Issue.6
, pp. 919-922
-
-
Shan, M.1
Zhao, C.2
Jiang, M.3
-
42
-
-
4143058324
-
On the computation of the minimum distance of low-density parity-check codes
-
Paris, France, Jun
-
X.-Y. Hu, M. P. C. Fossorier, and E. Eleftheriou, "On the computation of the minimum distance of low-density parity-check codes," in Proc. 2004 IEEE Int. Conf. Communications (ICC), Paris, France, Jun. 2004, pp. 767-771.
-
(2004)
Proc. 2004 IEEE Int. Conf. Communications (ICC)
, pp. 767-771
-
-
Hu, X.-Y.1
Fossorier, M.P.C.2
Eleftheriou, E.3
-
43
-
-
12544253129
-
Regular and irregular progressive edge-growth Tanner graphs
-
Jan
-
X.-Y. Hu, E. Eleftheriou, and D. M. Arnold, "Regular and irregular progressive edge-growth Tanner graphs," IEEE Trans. Inf. Theory, vol. 51, no. 1, pp. 386-398, Jan. 2005.
-
(2005)
IEEE Trans. Inf. Theory
, vol.51
, Issue.1
, pp. 386-398
-
-
Hu, X.-Y.1
Eleftheriou, E.2
Arnold, D.M.3
-
44
-
-
3543017339
-
A trellis-based method for removing cycles from bipartite graphs and construction of low density parity check codes
-
Jul
-
L. Lan, Y. Y. Tai, L. Chen, S. Lin, and K. Abdel-Ghaffar, "A trellis-based method for removing cycles from bipartite graphs and construction of low density parity check codes," IEEE Commun. Lett vol. 8, pp. 443-445, Jul. 2004.
-
(2004)
IEEE Commun. Lett
, vol.8
, pp. 443-445
-
-
Lan, L.1
Tai, Y.Y.2
Chen, L.3
Lin, S.4
Abdel-Ghaffar, K.5
-
45
-
-
0037972830
-
Construction of irregular LDPC codes with low error floors
-
Anchorage, AK, May
-
T. Tian, C. Jones, J. D. Villasenor, and R. D. Wesel, "Construction of irregular LDPC codes with low error floors," in IEEE Int. Conf. Communications (ICC), Anchorage, AK, May 2003, pp. 3125-3129.
-
(2003)
IEEE Int. Conf. Communications (ICC)
, pp. 3125-3129
-
-
Tian, T.1
Jones, C.2
Villasenor, J.D.3
Wesel, R.D.4
-
46
-
-
33846629974
-
Protograph based LDPC codes with minimum distance linearly growing with block size
-
St. Louis, MO, Nov
-
D. Divsalar, C. Jones, S. Dolinar, and J. Thorpe, "Protograph based LDPC codes with minimum distance linearly growing with block size," in Proc. IEEE GlobeCom, St. Louis, MO, Nov. 2005, pp. 1152-1156.
-
(2005)
Proc. IEEE GlobeCom
, pp. 1152-1156
-
-
Divsalar, D.1
Jones, C.2
Dolinar, S.3
Thorpe, J.4
-
47
-
-
34447527355
-
Design of LDPC codes: A survey and new results
-
Sep
-
G. Liva, S. Song, L. Lan, Y. Zhang, W. Ryan, and S. Lin, "Design of LDPC codes: A survey and new results," J. Comm. Software Syst., vol. 2, no. 3, pp. 191-211, Sep. 2006.
-
(2006)
J. Comm. Software Syst
, vol.2
, Issue.3
, pp. 191-211
-
-
Liva, G.1
Song, S.2
Lan, L.3
Zhang, Y.4
Ryan, W.5
Lin, S.6
-
48
-
-
34447528943
-
LDPC performance vs. number of iterations
-
Athens, Greece, Apr. 13, JPL Report
-
K. Andrews, C. Jones, S. Dolinar, and F. Pollara, "LDPC performance vs. number of iterations," in Proc. The Consultative Committee for Space Data Systems (CCSDS) Meet., Athens, Greece, Apr. 13, 2005, JPL Report.
-
(2005)
Proc. The Consultative Committee for Space Data Systems (CCSDS) Meet
-
-
Andrews, K.1
Jones, C.2
Dolinar, S.3
Pollara, F.4
-
49
-
-
0035246316
-
Efficient erasure correcting codes
-
Feb
-
M. G. Luby,M.Mitzenmacher,M.A. Shokrollahi, and D. A. Spielman, "Efficient erasure correcting codes," IEEE Trans. Inf. Theory, vol. 47, no. 2, pp. 569-584, Feb. 2001.
-
(2001)
IEEE Trans. Inf. Theory
, vol.47
, Issue.2
, pp. 569-584
-
-
Luby, M.G.1
Mitzenmacher, M.2
Shokrollahi, M.A.3
Spielman, D.A.4
-
50
-
-
0036612281
-
Finite-length analysis of low-density parity-check codes on the binary erasure channel
-
Jun
-
C. Di, D. Proietti, I. E. Teletar, T. J. Richardson, and R. L. Urbanke, "Finite-length analysis of low-density parity-check codes on the binary erasure channel," IEEE Trans. Inf. Theory, vol. 48, no. 6, pp. 1570-1579, Jun. 2002.
-
(2002)
IEEE Trans. Inf. Theory
, vol.48
, Issue.6
, pp. 1570-1579
-
-
Di, C.1
Proietti, D.2
Teletar, I.E.3
Richardson, T.J.4
Urbanke, R.L.5
-
51
-
-
0036354005
-
Stopping sets and the girth of Tanner graphs
-
Lausanne, Switzerland, Jun
-
A. Orlitsky, R. Urbanke, K. Viswanathan, and J. Zhang, "Stopping sets and the girth of Tanner graphs," in Proc. Int. Symp. Information Theory, Lausanne, Switzerland, Jun. 2002, p. 2.
-
(2002)
Proc. Int. Symp. Information Theory
, pp. 2
-
-
Orlitsky, A.1
Urbanke, R.2
Viswanathan, K.3
Zhang, J.4
-
52
-
-
84949237019
-
Design of LDPC codes for two-state fading channel models
-
Honolulu, HI, Oct
-
M. Yang and W. E. Ryan, "Design of LDPC codes for two-state fading channel models," in Proc. Int. Symp. Wireless Personal Multimedia Communication, Honolulu, HI, Oct. 2002, vol. 3, pp. 986-990.
-
(2002)
Proc. Int. Symp. Wireless Personal Multimedia Communication
, vol.3
, pp. 986-990
-
-
Yang, M.1
Ryan, W.E.2
-
53
-
-
2342598509
-
Performance of efficiently encodable low-density parity-check codes in noise bursts on the EPR4 channel
-
Mar
-
M. Yang and W. E. Ryan, "Performance of efficiently encodable low-density parity-check codes in noise bursts on the EPR4 channel," IEEE Trans. Magn., vol. 40, no. 2, pp. 507-512, Mar. 2004.
-
(2004)
IEEE Trans. Magn
, vol.40
, Issue.2
, pp. 507-512
-
-
Yang, M.1
Ryan, W.E.2
-
54
-
-
0037767621
-
Low-density parity-check codes over Gaussian channels with erasures
-
Jul
-
J. Ha and S. W. McLaughlin, "Low-density parity-check codes over Gaussian channels with erasures," IEEE Trans. Inf. Theory, vol. 49, no. 7, pp. 1801-1809, Jul. 2003.
-
(2003)
IEEE Trans. Inf. Theory
, vol.49
, Issue.7
, pp. 1801-1809
-
-
Ha, J.1
McLaughlin, S.W.2
|