Performance of low-density parity-check codes with linear minimum distance

Author

Pishro-Nik, Hossein ; Fekri, Faramarz

Author_Institution

Sch. of Electr. & Comput. Eng., Georgia Inst. of Technol., USA

fYear

2004

fDate

27 June-2 July 2004

Firstpage

206

Abstract

This paper studies the performance of the iterative decoding of LDPC code ensembles that have linear typical minimum distance and stopping set size. We first obtain a lower bound on the achievable rates of these ensembles over MBIOS channels. Then, we give upper bounds on the rate of LDPC codes with linear minimum distance, given their right degree distribution over the BEC.

Keywords

binary codes; channel capacity; iterative decoding; memoryless systems; parity check codes; LDPC; binary erasure channel; iterative decoding; linear minimum distance; low-density parity-check code ensemble; memoryless binary-input output-symmetric channel; Bit error rate; Channel capacity; Degradation; Distribution functions; Error analysis; Iterative decoding; Parity check codes; Upper bound;

fLanguage

English

Publisher

ieee

Conference_Titel

Information Theory, 2004. ISIT 2004. Proceedings. International Symposium on

Print_ISBN

0-7803-8280-3

Type

conf

DOI

10.1109/ISIT.2004.1365245

Filename

1365245

Link To Document

https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=2054726