IEEE transactions on information theory, 2007-12, Vol.53 (12), p.4537-4555
2007
Volltextzugriff (PDF)
Details
- Autor(en) / Beteiligte
- Titel
- Distance Bounds for an Ensemble of LDPC Convolutional Codes
- Ist Teil von
- IEEE transactions on information theory, 2007-12, Vol.53 (12), p.4537-4555
- Ort / Verlag
- New York: IEEE
- Erscheinungsjahr
- 2007
- Quelle
- IEEE Xplore
- Beschreibungen/Notizen
- An ensemble of (J, K) -regular low-density parity-check (LDPC) convolutional codes is introduced and existence-type lower bounds on the minimum distance d L , of code segments of finite length L and on the free distance d free are derived. For sufficiently large constraint lengths v, the distances are shown to grow linearly with v and the ratio d L /v approaches the ratio dfee/ v for large L. Moreover, the ratio of free distance to constraint length is several times larger than the ratio of minimum distance to block length for Gallager's ensemble of (J, K) -regular LDPC block codes.
- Sprache
- Englisch
- Identifikatoren
- ISSN: 0018-9448eISSN: 1557-9654DOI: 10.1109/TIT.2007.909113Titel-ID: cdi_proquest_miscellaneous_1671528199
- Format
- –
- Schlagworte
- Block codes, Blocking, Codes, Computational complexity, Convolutional codes, Data encryption, Electrical engineering, Electrical Engineering, Electronic Engineering, Information Engineering, Elektroteknik och elektronik, Engineering and Technology, Free distance lower bounds, Information theory, Iterative decoding, LDPC codes, LDPC convolutional codes, low-density parity-check (LDPC) codes, Lower bounds, Mathematical analysis, minimum-distance lower bounds, Parity check codes, Segments, Sparse matrices, spatial coupling, Teknik