Graph decomposition: A new key to coding theorems

DOI10.1109/TIT.1981.1056281MaRDI QIDQ3931313zbMATH OpenOpenAlexFDO

Authors Imre Csiszár, János Körner

Publication date 1981

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

Full work available at URL https://doi.org/10.1109/tit.1981.1056281

zbMATH Keywords

exponential error boundsgood encodersside informationuniversal codes

Mathematics Subject Classification ID

Graph theory (05C99) Coding theorems (Shannon theory) (94A24) Source coding (94A29)

Cited in

(8)

• Properties of noncommutative Rényi and Augustin information
• On the capacity of the arbitrarily varying channel for maximum probability of error
• A lower bound on the quantum capacity of channels with correlated errors
• Vertex partition of hypergraphs and maximum degenerate subhypergraphs
• A toolbox for refined information-theoretic analyses
• Achieving positive rates with predetermined dictionaries
• Graph factors and factorization: 1985--2003: a survey
• Distributing vertices along a Hamiltonian cycle in Dirac graphs

This page was built for publication: Graph decomposition: A new key to coding theorems

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