Error exponents of expander codes

DOI10.1109/TIT.2002.1003853MaRDI QIDQ4674540zbMATH OpenFDO

Authors Alexander Barg, Gilles Zémor

Publication date 11 May 2005

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

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

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Decoding (94B35) Other types of codes (94B60)

Recommendations

• Error Exponents of Expander Codes under Linear-Complexity Decoding
• Error Exponents of Typical Random Codes
• The expansion factor of error-control codes
• Error Exponents of Typical Random Trellis Codes
• Publication:4886128
• Error exponents for product convolutional codes
• Error exponents in scalable source coding
• scientific article; zbMATH DE number 1029231
• On the Error Exponent of Trellis Source Coding
• The exponent of error probability in various modulation and coding systems

Cited in

(24)

• Error correcting codes from sub-exceeding functions
• Eigenvalues and expansion of bipartite graphs
• Asymptotic bounds on the decoding error probability for two ensembles of LDPC codes
• scientific article; zbMATH DE number 3920367 (Why is no real title available?)
• Low-complexity error correction of Hamming-code-based LDPC codes
• Average and reliability error exponents in low-density parity-check codes
• The minimum distance of graph codes
• Decoding concatenated codes with inner convolutional codes
• Explicit construction of \(q+1\) regular local Ramanujan graphs, for all prime-powers \(q\)
• Error exponents for maximum-likelihood and successive decoders for the Gaussian CDMA channel
• scientific article; zbMATH DE number 515917 (Why is no real title available?)
• scientific article; zbMATH DE number 3478752 (Why is no real title available?)
• Local correctability of expander codes
• On codes from hypergraphs.
• Eigenvalue bounds on the pseudocodeword weight of expander codes
• Decoding of Expander Codes at Rates Close to Capacity
• On the sizes of expander graphs and minimum distances of graph codes
• Some combinatorial aspects of constructing bipartite-graph codes
• Exact Random Coding Error Exponents of Optimal Bin Index Decoding
• On expander codes
• Code Offset in the Exponent.
• Explicit rateless codes for memoryless binary-input output-symmetric channels
• scientific article; zbMATH DE number 1029231 (Why is no real title available?)
• Error Exponents of Expander Codes under Linear-Complexity Decoding

This page was built for publication: Error exponents of expander codes

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