The theoretical capacity of the Parity Source Coder

DOI10.1088/1742-5468/2005/10/P10003zbMath1459.68058arXivcond-mat/0506652MaRDI QIDQ4968799

Stefano Ciliberti, Marc Mézard

Publication date: 9 July 2019

Published in: Journal of Statistical Mechanics: Theory and Experiment (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/cond-mat/0506652

zbMATH Keywords

networksrandom graphssource and channel coding

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Source coding (94A29)

Cites Work

• Unnamed Item
• Unnamed Item
• Two solutions to diluted \(p\)-spin models and XORSAT problems
• Random-energy model: An exactly solvable model of disordered systems
• Instability of one-step replica-symmetry-broken phase in satisfiability problems
• Factor graphs and the sum-product algorithm
• Statistical Mechanical Approach to Error Exponents of Lossy Data Compression
• Survey propagation: An algorithm for satisfiability
• One step RSB scheme for the rate distortion function

This page was built for publication: The theoretical capacity of the Parity Source Coder