Good codes based on very sparse matrices

DOI10.1007/3-540-60693-9_13zbMath1398.94240OpenAlexW1572884776MaRDI QIDQ4608503

David J. C. MacKay, Radford M. Neal

Publication date: 21 March 2018

Published in: Cryptography and Coding (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-60693-9_13

Mathematics Subject Classification ID

Other types of codes (94B60) Decoding (94B35)

Related Items

On encoding symbol degrees of array BP-XOR codes, Complexity-compression tradeoffs in lossy compression via efficient random codebooks and databases, Good codes based on very sparse matrices, Adaptive Soft-Decision Iterative Decoding Using Edge Local Complementation, LDPC Codes Based on Algebraic Graphs, Reduced complexity iterative decoding of 3D-product block codes based on genetic algorithms, Convergence of a belief propagation algorithm for biological networks

Cites Work

• A Mathematical Theory of Communication
• Fast correlation attacks on certain stream ciphers
• Algebraic-geometric codes and asymptotic problems
• Arithmetic Coding
• Good codes based on very sparse matrices
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item