DocumentCode
932511
Title
Graph decomposition: A new key to coding theorems
Author
Csiszár, Imre ; Körner, János
Volume
27
Issue
1
fYear
1981
fDate
1/1/1981 12:00:00 AM
Firstpage
5
Lastpage
12
Abstract
A new and simple method is proposed for finding good encoders both for channels and for sources with side information. This method relies on the continuous version of a graph decomposition result of Lovász. The presently known best exponential error bounds for both problems follow in a unified manner with an improvement on the source coding bound. The previous bounds for universal codes of the authors and Marton are also improved.
Keywords
Coding; Graph theory; Codes; Decoding; Error analysis; Graph theory; Information theory; Joining processes; Matrix decomposition; Source coding; Statistics; Stochastic processes;
fLanguage
English
Journal_Title
Information Theory, IEEE Transactions on
Publisher
ieee
ISSN
0018-9448
Type
jour
DOI
10.1109/TIT.1981.1056281
Filename
1056281
Link To Document