On the minimum distance of low-density parity-check codes with parity-check matrices constructed from permutation matrices

DOI10.1007/s11122-005-0008-4zbMath1078.94038OpenAlexW2075239581MaRDI QIDQ2577283

A. Sridharan, M. Lentmaier, K. Sh. Zigangirov, Dmitri Truhachev, Daniel J. jun. Costello

Publication date: 19 December 2005

Published in: Problems of Information Transmission (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11122-005-0008-4

zbMATH Keywords

minimum distance

Mathematics Subject Classification ID

Other types of codes (94B60) Prefix, length-variable, comma-free codes (94A45)

Related Items

Decoding of low-density codes with parity-check matrices composed of permutation matrices in an erasure channel, Vectorizing computations at decoding of nonbinary codes with small density of checks, On the error-correcting capability of LDPC codes

Cites Work

• LDPC Block and Convolutional Codes Based on Circulant Matrices
• Distance Bounds for an Ensemble of LDPC Convolutional Codes
• Unnamed Item
• Unnamed Item
• Unnamed Item