Presentation	2003/12/8 Coding Problem of Correlated Sources and Its Applications Jun MURAMATSU,
PDF Download Page	PDF download Page Link
Abstract(in Japanese)	(See Japanese page)
Abstract(in English)	This paper deals with the coding problem of correlated sources, where they are separately encoded and codewords are decoded by a single decoder with an arbitrarily small decoding error. In 1973, Slepian and Wolf determined necessary and sufficient conditions for the coding rate of this problem. The purpose of this paper is to introduce theorems stating that such a code can be applied to a channel coding problem, a generation problem of independent random sequences, and a secret key agreement problem.
Keyword(in Japanese)	(See Japanese page)
Keyword(in English)	multi-terminal information theory / coding of correlated sources / coding of correlated channels generating independent random sequences / secret key agreement from correlated random sequences
Paper #	IT2003-53
Date of Issue

Conference Information
Committee	IT
Conference Date	2003/12/8(1days)
Place (in Japanese)	(See Japanese page)
Place (in English)
Topics (in Japanese)	(See Japanese page)
Topics (in English)
Chair
Vice Chair
Secretary
Assistant

Paper Information
Registration To	Information Theory (IT)
Language	JPN
Title (in Japanese)	(See Japanese page)
Sub Title (in Japanese)	(See Japanese page)
Title (in English)	Coding Problem of Correlated Sources and Its Applications
Sub Title (in English)
Keyword(1)	multi-terminal information theory
Keyword(2)	coding of correlated sources
Keyword(3)	coding of correlated channels generating independent random sequences
Keyword(4)	secret key agreement from correlated random sequences
1st Author's Name	Jun MURAMATSU
1st Author's Affiliation	NTT Communication Science Laboratories, NTT Corporation()
Date	2003/12/8
Paper #	IT2003-53
Volume (vol)	vol.103
Number (no)	498
Page	pp.pp.-
#Pages	6
Date of Issue