Article
To read the full-text of this research, you can request a copy directly from the author.

Abstract

In 1973, D. Slepian and J. K. Wolf proved a theorem on the coding problem of correlated sources. The history of this theorem is reviewed from the viewpoint of achievability proofs (code construction). This article is written in Japanese.

No full-text available

Request Full-text Paper PDF

To read the full-text of this research,
you can request a copy directly from the author.

ResearchGate has not been able to resolve any citations for this publication.
ResearchGate has not been able to resolve any references for this publication.