Graph decomposition: A new key to coding theorems

DOI10.1109/TIT.1981.1056281zbMath0474.94022OpenAlexW2057756383MaRDI QIDQ3931313

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

side informationuniversal codesexponential error boundsgood encoders

Mathematics Subject Classification ID

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

Related Items

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