Graph Decomposition: A New Key to Coding Theorems

I. Csiszár, JáNos KöRner

Research output: Contribution to journalArticle

111 Citations (Scopus)

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 Lovasz. 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.

Original languageEnglish
Pages (from-to)5-12
Number of pages8
JournalIEEE Transactions on Information Theory
Volume27
Issue number1
DOIs
Publication statusPublished - 1981

Fingerprint

coding
Decomposition

ASJC Scopus subject areas

  • Computer Science Applications
  • Information Systems
  • Library and Information Sciences
  • Electrical and Electronic Engineering

Cite this

Graph Decomposition : A New Key to Coding Theorems. / Csiszár, I.; KöRner, JáNos.

In: IEEE Transactions on Information Theory, Vol. 27, No. 1, 1981, p. 5-12.

Research output: Contribution to journalArticle

@article{be9967dd3a97404fb9c0bc843824e427,
title = "Graph Decomposition: A New Key to Coding Theorems",
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 Lovasz. 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.",
author = "I. Csisz{\'a}r and J{\'a}Nos K{\"o}Rner",
year = "1981",
doi = "10.1109/TIT.1981.1056281",
language = "English",
volume = "27",
pages = "5--12",
journal = "IEEE Transactions on Information Theory",
issn = "0018-9448",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "1",

}

TY - JOUR

T1 - Graph Decomposition

T2 - A New Key to Coding Theorems

AU - Csiszár, I.

AU - KöRner, JáNos

PY - 1981

Y1 - 1981

N2 - 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 Lovasz. 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.

AB - 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 Lovasz. 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.

UR - http://www.scopus.com/inward/record.url?scp=0019393959&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0019393959&partnerID=8YFLogxK

U2 - 10.1109/TIT.1981.1056281

DO - 10.1109/TIT.1981.1056281

M3 - Article

AN - SCOPUS:0019393959

VL - 27

SP - 5

EP - 12

JO - IEEE Transactions on Information Theory

JF - IEEE Transactions on Information Theory

SN - 0018-9448

IS - 1

ER -