Error exponents of expander codes
From MaRDI portal
Publication:4674540
DOI10.1109/TIT.2002.1003853zbMath1061.94078MaRDI QIDQ4674540
Publication date: 11 May 2005
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
68Q25: Analysis of algorithms and problem complexity
68Q30: Algorithmic information theory (Kolmogorov complexity, etc.)
94B60: Other types of codes
94B35: Decoding
Related Items
Asymptotic bounds on the decoding error probability for two ensembles of LDPC codes, Eigenvalues and expansion of bipartite graphs, Low-complexity error correction of Hamming-code-based LDPC codes, Decoding concatenated codes with inner convolutional codes, On codes from hypergraphs., Linear-time list recovery of high-rate expander codes, Some combinatorial aspects of constructing bipartite-graph codes, Local correctability of expander codes, On the sizes of expander graphs and minimum distances of graph codes, The Minimum Distance of Graph Codes