Second-order slepian-wolf coding theorems for non-mixed and mixed sources

Ryo Nomura, Te Sun Han

Research output: Contribution to journalArticle

18 Citations (Scopus)

Abstract

The second-order achievable rate region in Slepian-Wolf source coding systems is investigated. The concept of second-order achievable rates, which enables us to make a finer evaluation of achievable rates, has already been introduced and analyzed for general sources in the single-user source coding problem. Analogously, in this paper, we first define the second-order achievable rate region for the Slepian-Wolf coding system to establish the source coding theorem in the second-order sense. The Slepian-Wolf coding problem for correlated sources is one of typical problems in the multiterminal information theory. In particular, Miyake and Kanaya, and Han have established the first-order source coding theorems for general correlated sources. On the other hand, in general, the second-order achievable rate problem for the Slepian-Wolf coding system with general sources remains still open up to present. In this paper, we present the analysis concerning the second-order achievable rates for general sources, which are based on the information spectrum methods developed by Han and Verdú. Moreover, we establish the explicit second-order achievable rate region for independently and identically distributed (i.i.d.) correlated sources with countably infinite alphabets and mixtures of i.i.d. correlated sources, respectively, using the relevant asymptotic normality.

Original languageEnglish
Article number6856169
Pages (from-to)5553-5572
Number of pages20
JournalIEEE Transactions on Information Theory
Volume60
Issue number9
DOIs
Publication statusPublished - 2014 Jan 1
Externally publishedYes

Fingerprint

Information theory
coding
information theory
normality
evaluation

Keywords

  • Asymptotic normality
  • correlated sources
  • second-order achievability
  • Slepian-Wolf data compression system

ASJC Scopus subject areas

  • Information Systems
  • Computer Science Applications
  • Library and Information Sciences

Cite this

Second-order slepian-wolf coding theorems for non-mixed and mixed sources. / Nomura, Ryo; Han, Te Sun.

In: IEEE Transactions on Information Theory, Vol. 60, No. 9, 6856169, 01.01.2014, p. 5553-5572.

Research output: Contribution to journalArticle

@article{17bfeca7c267444ba5e26b9e00c4d3b7,
title = "Second-order slepian-wolf coding theorems for non-mixed and mixed sources",
abstract = "The second-order achievable rate region in Slepian-Wolf source coding systems is investigated. The concept of second-order achievable rates, which enables us to make a finer evaluation of achievable rates, has already been introduced and analyzed for general sources in the single-user source coding problem. Analogously, in this paper, we first define the second-order achievable rate region for the Slepian-Wolf coding system to establish the source coding theorem in the second-order sense. The Slepian-Wolf coding problem for correlated sources is one of typical problems in the multiterminal information theory. In particular, Miyake and Kanaya, and Han have established the first-order source coding theorems for general correlated sources. On the other hand, in general, the second-order achievable rate problem for the Slepian-Wolf coding system with general sources remains still open up to present. In this paper, we present the analysis concerning the second-order achievable rates for general sources, which are based on the information spectrum methods developed by Han and Verd{\'u}. Moreover, we establish the explicit second-order achievable rate region for independently and identically distributed (i.i.d.) correlated sources with countably infinite alphabets and mixtures of i.i.d. correlated sources, respectively, using the relevant asymptotic normality.",
keywords = "Asymptotic normality, correlated sources, second-order achievability, Slepian-Wolf data compression system",
author = "Ryo Nomura and Han, {Te Sun}",
year = "2014",
month = "1",
day = "1",
doi = "10.1109/TIT.2014.2339231",
language = "English",
volume = "60",
pages = "5553--5572",
journal = "IEEE Transactions on Information Theory",
issn = "0018-9448",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "9",

}

TY - JOUR

T1 - Second-order slepian-wolf coding theorems for non-mixed and mixed sources

AU - Nomura, Ryo

AU - Han, Te Sun

PY - 2014/1/1

Y1 - 2014/1/1

N2 - The second-order achievable rate region in Slepian-Wolf source coding systems is investigated. The concept of second-order achievable rates, which enables us to make a finer evaluation of achievable rates, has already been introduced and analyzed for general sources in the single-user source coding problem. Analogously, in this paper, we first define the second-order achievable rate region for the Slepian-Wolf coding system to establish the source coding theorem in the second-order sense. The Slepian-Wolf coding problem for correlated sources is one of typical problems in the multiterminal information theory. In particular, Miyake and Kanaya, and Han have established the first-order source coding theorems for general correlated sources. On the other hand, in general, the second-order achievable rate problem for the Slepian-Wolf coding system with general sources remains still open up to present. In this paper, we present the analysis concerning the second-order achievable rates for general sources, which are based on the information spectrum methods developed by Han and Verdú. Moreover, we establish the explicit second-order achievable rate region for independently and identically distributed (i.i.d.) correlated sources with countably infinite alphabets and mixtures of i.i.d. correlated sources, respectively, using the relevant asymptotic normality.

AB - The second-order achievable rate region in Slepian-Wolf source coding systems is investigated. The concept of second-order achievable rates, which enables us to make a finer evaluation of achievable rates, has already been introduced and analyzed for general sources in the single-user source coding problem. Analogously, in this paper, we first define the second-order achievable rate region for the Slepian-Wolf coding system to establish the source coding theorem in the second-order sense. The Slepian-Wolf coding problem for correlated sources is one of typical problems in the multiterminal information theory. In particular, Miyake and Kanaya, and Han have established the first-order source coding theorems for general correlated sources. On the other hand, in general, the second-order achievable rate problem for the Slepian-Wolf coding system with general sources remains still open up to present. In this paper, we present the analysis concerning the second-order achievable rates for general sources, which are based on the information spectrum methods developed by Han and Verdú. Moreover, we establish the explicit second-order achievable rate region for independently and identically distributed (i.i.d.) correlated sources with countably infinite alphabets and mixtures of i.i.d. correlated sources, respectively, using the relevant asymptotic normality.

KW - Asymptotic normality

KW - correlated sources

KW - second-order achievability

KW - Slepian-Wolf data compression system

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

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

U2 - 10.1109/TIT.2014.2339231

DO - 10.1109/TIT.2014.2339231

M3 - Article

AN - SCOPUS:84906708536

VL - 60

SP - 5553

EP - 5572

JO - IEEE Transactions on Information Theory

JF - IEEE Transactions on Information Theory

SN - 0018-9448

IS - 9

M1 - 6856169

ER -