Second-Order Slepian-Wolf Coding Theorems for Non-Mixed and Mixed Sources
From MaRDI portal
Publication:2986168
DOI10.1109/TIT.2014.2339231zbMATH Open1360.94210arXiv1207.2505OpenAlexW1970369586MaRDI QIDQ2986168FDOQ2986168
Authors: Ryo Nomura, Te Sun Han 
Publication date: 16 May 2017
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
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 multi-terminal 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 Verdu. Moreover, we establish the explicit second-order achievable rate region for i.i.d. correlated sources with countably infinite alphabets and mixed correlated sources, respectively, using the relevant asymptotic normality.
Full work available at URL: https://arxiv.org/abs/1207.2505
Recommendations
- First- and Second-Order Coding Theorems for Mixed Memoryless Channels With General Mixture
- Second-order noiseless source coding theorems
- On the Duality Between Slepian–Wolf Coding and Channel Coding Under Mismatched Decoding
- Second-Order Resolvability, Intrinsic Randomness, and Fixed-Length Source Coding for Mixed Sources: Information Spectrum Approach
- Second-Order Rate Region of Constant-Composition Codes for the Multiple-Access Channel
- Second Order Analysis for Joint Source-Channel Coding With General Channel and Markovian Source
- Second-Order Asymptotics in Fixed-Length Source Coding and Intrinsic Randomness
- Coding theorems for hybrid channels. II
- Nonasymptotic and Second-Order Achievability Bounds for Coding With Side-Information
- Information Spectrum Approach to Second-Order Coding Rate in Channel Coding
Cited In (2)
This page was built for publication: Second-Order Slepian-Wolf Coding Theorems for Non-Mixed and Mixed Sources
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2986168)
