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

DOI10.1109/TIT.2005.860439MaRDI QIDQ3547496zbMATH OpenFDO

Authors Hossein Pishro-Nik, Faramarz Fekri

Publication date 21 December 2008

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/TIT.2005.860439

Mathematics Subject Classification ID

Decoding (94B35)

Recommendations

• Parity-Check Density Versus Performance of Binary Linear Block Codes: New Bounds and Applications
• Upper bounds on the rate of LDPC codes as a function of minimum distance
• Upper bounds on the rate of LDPC codes
• Parity-check density versus performance of binary linear block codes over memoryless symmetric channels
• The capacity of low-density parity-check codes under message-passing decoding

Cited in

(21)

• Distance properties of short LDPC codes and their impact on the BP, ML and near-ML decoding performance
• Effect of one redundant parity-check equation on the stopping distance
• On the minimum distance of low-density parity-check codes with parity-check matrices constructed from permutation matrices
• Asymptotic bounds on the decoding error probability for two ensembles of LDPC codes
• On the stopping distance of LDPC codes based on symplectic space over finite fields
• scientific article; zbMATH DE number 1714649 (Why is no real title available?)
• Upper bounds on the rate of LDPC codes as a function of minimum distance
• Asymptotic Enumeration Methods for Analyzing LDPC Codes
• Stopping Set Distribution of LDPC Code Ensembles
• On Decoding of Low-Density Parity-Check Codes Over the Binary Erasure Channel
• Parity-check density versus performance of binary linear block codes over memoryless symmetric channels
• Constrained Information Combining: Theory and Applications for LDPC Coded Systems
• Parity-Check Density Versus Performance of Binary Linear Block Codes: New Bounds and Applications
• On Achievable Rates and Complexity of LDPC Codes Over Parallel Channels: Bounds and Applications
• On ensembles of low-density parity-check codes: asymptotic distance distributions
• Finite-length analysis of low-density parity-check codes on the binary erasure channel
• Average spectra and minimum distances of low-density parity-check codes over Abelian groups
• scientific article; zbMATH DE number 3251924 (Why is no real title available?)
• Typical performance of regular low-density parity-check codes over general symmetric channels
• Rate amplification and query-efficient distance amplification for linear LCC and LDC
• Minimum distance and pseudodistance lower bounds for generalised LDPC codes

This page was built for publication: Performance of low-density parity-check codes with linear minimum distance

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3547496)