Presentation 2011-09-30
Second-Order Source Coding Theorem for Slepian-Wolf Coding Problem
Ryo NOMURA,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) The second-order achievable rate region in Slepian-Wolf source coding problem is determined. The second-order achievable rate, which enables us a finer evaluation of the achievable rate, has been introduced and analyzed for general sources in the single source coding problem. Analogously, in this paper, we first define the second-order achievable rate region for the Slepian-Wolf coding problem and establish the source coding theorem in the second-order sense. The Slepian-Wolf coding problem for the correlated source is one of the typical problems in the multi-terminal information theory. Miyake and Kanaya, and Han have established the first-order source coding theorems for general correlated sources. On the other hand, there are few researches on the second-order achievable rates for the Slepian-Wolf coding problem. Our analysis concerning the second-order achievable rates for general sources is on the basis of the information-spectrum methods. Moreover, we compute the explicit second-order achievable rate region for i.i.d. correlated sources using the relevant asymptotic normality.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) Second-Order achievability / Correlated Sources
Paper # IT2011-31
Date of Issue

Conference Information
Committee IT
Conference Date 2011/9/22(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 ENG
Title (in Japanese) (See Japanese page)
Sub Title (in Japanese) (See Japanese page)
Title (in English) Second-Order Source Coding Theorem for Slepian-Wolf Coding Problem
Sub Title (in English)
Keyword(1) Second-Order achievability
Keyword(2) Correlated Sources
1st Author's Name Ryo NOMURA
1st Author's Affiliation School of Network and Information, Senshu University()
Date 2011-09-30
Paper # IT2011-31
Volume (vol) vol.111
Number (no) 220
Page pp.pp.-
#Pages 6
Date of Issue