The asymptotic distance distribution of regular low-density parity-check (LDPC) codes derived by Litsin and Sherlev (2002) is generalised for the case of irregular LDPC codes with constant check node degree. Numerical analysis of simple irregular LDPC codes with weight-two variable nodes shows that their minimum Hamming distance can be increased linearly with the code length when the maximum variable node degree of the code is kept below a critical value. This result is consistent with the stability condition of the LDPC codes, at least for the simple irregular case.
Inspec keywords: parity check codes; Hamming codes
Other keywords:
Subjects: Codes
References
-
-
1)
- Chung, S.-Y.: `On the construction of some capacity-approaching coding schemes', 2000, PhD, Massachusetts Institute of Technology, Cambridge MA, USA.
-
2)
- D.G. Luenberger . (1989) Linear and nonlinear programming.
-
3)
- D.J.C. MacKay . Good error-correcting codes based on very sparse matrices. IEEE Trans. Inf. Theory , 2 , 399 - 431
-
4)
- R.G. Gallager . (1963) Low density parity check codes' Research Monograph Series, No. 21.
-
5)
- M. Luby . Improved low-density parity-check codes using irregular graphs. IEEE Trans. Inf. Theory , 2 , 585 - 598
-
6)
- M. Rashidpour , S.H. Jamali . Design and analysis of simple irregular LDPC codes with finite-lengths and their application in CDMA systems. Wirel. Commun. Mob. Comput. , 1 - 14
-
7)
- T.J. Richardson , M.A. Shokrollahi , R.L. Urbanke . Design of capacity-approaching irregular low-density parity-check codes. IEEE Trans. Inf. Theory , 619 - 637
-
8)
- E. Zeidler , L.F. Boron . (1985) Nonlinear functional analysis and its applications III: Variational methods and optimization.
-
9)
- I. Sason , S. Shamai . Improved upper bounds on the ensemble performance of ML decoded low density parity check codes. IEEE Commun. Let. , 3 , 89 - 91
-
10)
- ‘Squeezing (sandwich) theorem’: http://mathworld.wolfram.com/Squeezing Theorem.html.
-
11)
- P. Oswald , A. Shokrollahi . Capacity-achieving sequences for the erasure channel. IEEE Trans. Inf. Theory , 12 , 3017 - 3028
-
12)
- S. Litsyn , V. Shevlev . Distance distribution in ensembles of irregular low-density parity-check codes. IEEE Trans. Inf. Theory , 3140 - 3159
-
13)
- S.-Y. Chung , T.J. Richardson , R.L. Urbanke . Analysis of sum-product decoding of low-density parity-check codes using a Gaussian approximation. IEEE Trans. Inf. Theory , 657 - 670
-
14)
- P.E. O'Neil . Asymptotics and random matrices with row-sum and column-sum restrictions. Bull. Am. Math. Soc. , 1276 - 1282
-
15)
- D.J.C. MacKay , R.M. Neal . Near Shannon limit performance of low density parity check codes. Electron. Lett. , 8 , 1645 - 1646
-
16)
- Haghighat, J., Jamali, S.H., Behroozi, H., Nasiri-Kenari, M.: `High-performance LDPC codes for CDMA applications', Proc. IEEE 4th Int. Workshop on Mobile and Wireless Communications Networks, 9–11 September 2002, Stockholm, Sweden, p. 105–109.
-
17)
- S. Litsyn , V. Shevlev . On ensembles of low-density parity-check codes: asymptotic distance distributions. IEEE Trans. Inf. Theory , 887 - 908
-
18)
- I. Sason , R. Urbanke . Parity-check density versus performance of binary linear block codes over memoryless symmetric channels. IEEE Trans. Inf. Theory , 1611 - 1635
-
19)
- V. Sorokine , F.R. Kschishang , S. Pasupathy . Gallager codes for CDMA applications II. Implementations, complexity, and system capacity. IEEE Trans. Commun. , 11 , 1818 - 1828
-
1)
Related content