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)
Analysis of algorithms and problem complexity (68Q25) Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Other types of codes (94B60) Decoding (94B35)
Related Items (12)
Linear-time list recovery of high-rate expander codes ⋮ Explicit construction of \(q+1\) regular local Ramanujan graphs, for all prime-powers \(q\) ⋮ Some combinatorial aspects of constructing bipartite-graph codes ⋮ On codes from hypergraphs. ⋮ On the sizes of expander graphs and minimum distances of graph codes ⋮ The Minimum Distance of Graph Codes ⋮ Eigenvalues and expansion of bipartite graphs ⋮ Unnamed Item ⋮ Low-complexity error correction of Hamming-code-based LDPC codes ⋮ Decoding concatenated codes with inner convolutional codes ⋮ Local correctability of expander codes ⋮ Asymptotic bounds on the decoding error probability for two ensembles of LDPC codes
This page was built for publication: Error exponents of expander codes
