Universal coding for correlated sources with complementary delivery

@article{Kimura2007UniversalCF,
  title={Universal coding for correlated sources with complementary delivery},
  author={Akisato Kimura and Tomohiko Uyematsu and Shigeaki Kuzuoka},
  journal={2007 IEEE International Symposium on Information Theory},
  year={2007},
  pages={1756-1760}
}
This report deals with a universal coding problem for a certain kind of multiterminal source coding system that we call the complementary delivery coding system. Both fixed-to- fixed length and fixed-to-variable length lossless coding schemes are considered. Explicit constructions of universal codes and the bounds of the error probabilities are clarified via type-theoretical and graph-theoretical analyses. 
Universal Source Coding Over Generalized Complementary Delivery Networks
TLDR
This paper deals with a universal coding problem for a certain kind of multiterminal source coding network called a generalized complementary delivery network, and explicit constructions of universal codes and the bounds of the error probabilities are clarified by using methods of types and graph-theoretical analysis.
Universal coding for lossy complementary delivery problem
This paper deals with a universal lossy coding problem for a certain kind of multiterminal source coding network called a complementary delivery system. A universal coding scheme based on Wyner-Ziv
Multiterminal source coding with complementary delivery
TLDR
A coding problem for correlated information sources is investigated and the rate-distortion function for the coding problem and its interesting properties are clarified.
Universal Coding for Lossless and Lossy Complementary Delivery Problems
TLDR
It is shown that a universal lossless complementary delivery code can be constructed by only combining two Slepian-Wolf codes, for which error probability is exponentially tight, and a universal complementary delivery coding scheme based on Wyner-Ziv codes is proposed.
Broadcast Function Computation with Complementary Side Information
  • Jithin Ravi, B. Dey
  • Mathematics, Computer Science
    2016 IEEE Globecom Workshops (GC Wkshps)
  • 2016
TLDR
It is shown that the cut-set bound is achievable under $\epsilon$-error if $X$ and $Y$ are binary, or if the functions are from a special class of `compatible' functions which includes the case $f=g$.
Function Computation Through a Bidirectional Relay
  • Jithin Ravi, B. Dey
  • Computer Science, Mathematics
    IEEE Transactions on Information Theory
  • 2019
TLDR
Graph theoretic ideas to address the function computation problem in a three-node wireless network give a single-letter inner bound to this rate region under zero error and show equivalence betweeninline-formula-error and zero-error computations.

References

SHOWING 1-10 OF 25 REFERENCES
Multiterminal source coding with complementary delivery
TLDR
A coding problem for correlated information sources is investigated and the rate-distortion function for the coding problem and its interesting properties are clarified.
Source coding with side information at several decoders
  • Andrea Sgarro
  • Mathematics, Computer Science
    IEEE Trans. Inf. Theory
  • 1977
TLDR
A source coding problem is considered which generalizes source coding with side information and the resuit is generalized to an arbitrary finite number of decoders.
Linear codes for sources and source networks: Error exponents, universal coding
  • I. Csiszár
  • Mathematics, Computer Science
    IEEE Trans. Inf. Theory
  • 1982
For Slepian-Wolf source networks, the error exponents obtained by Korner,Marton, and the author are shown to be universally attainable by linear codes also. Improved exponents are derived for linear
Towards a general theory of source networks
TLDR
It is shown that, for determining file achievable rate region, attention may be restricted to source networks of a relatively simple structure and exponential error bounds are derived which are attainable by universal codes.
An algebraic construction of codes for Slepian-Wolf source networks
  • T. Uyematsu
  • Mathematics, Computer Science
    IEEE Trans. Inf. Theory
  • 2001
TLDR
The proposed code is linear, and has two-step encoding and decoding procedures similar to the concatenated code used for channel coding, and can achieve arbitrary small probability of error for ergodic sources with finite alphabets.
Images of a set via two channels and their role in multi-user communication
A technique is presented to determine the region of achievable rates for some source and channel networks. This technique is applied to the solution of a source:network problem that seems to be the
Universal coding for the Slepian-Wolf data compression system and the strong converse theorem
TLDR
It is demonstrated based on a simple observation that the error exponent given by Csiszar and Korner (1980) for the universal coding system can strictly be sharpened in general for a region of relatively higher rates.
On source coding with side information at the decoder
  • A. Wyner
  • Mathematics, Computer Science
    IEEE Trans. Inf. Theory
  • 1975
TLDR
The characterization of the family of rate triples (R_0,R_1, R_2) for which this system can deliver essentially perfect reproductions of X and Y and the principal result is a characterization of this family via an information-theoretic minimization.
Noiseless coding of correlated information sources
TLDR
The minimum number of bits per character R_X and R_Y needed to encode these sequences so that they can be faithfully reproduced under a variety of assumptions regarding the encoders and decoders is determined.
Communicating via a processing broadcast satellite
TLDR
The solution to this problem is obtained for the case where subsequent data triples that are produced by the users are independent and identically distributed and the three symbols within each triple are assumed to be dependent.
...
1
2
3
...