Universal Coding for Correlated Sources with Complementary Delivery(<Special Section>Information Theory and Its Applications)
スポンサーリンク
概要
- 論文の詳細を見る
This paper deals with a universal coding problem for a certain kind of multiterminal source coding system that we call the complementary delivery coding system. In this system, messages from two correlated sources are jointly encoded, and each decoder has access to one of the two messages to enable it to reproduce the other message. Both fixed-to-fixed length and fixed-to-variable length lossless coding schemes are considered. Explicit constructions of universal codes and bounds of the error probabilities are clarified via type-theoretical and graph-theoretical analyses.
- 社団法人電子情報通信学会の論文
- 2007-09-01
著者
-
UYEMATSU Tomohiko
Department of Communications and Integrated Systems, Tokyo Institute of Technology
-
Uyematsu Tomohiko
Tokyo Inst. Of Technol. Tokyo Jpn
-
Uyematsu Tomohiko
Department Of Communications And Integrated Systems Tokyo Institute Of Technology
-
KIMURA Akisato
Department of Communications and Integrated Systems, Tokyo Institute of Technology
-
KUZUOKA Shigeaki
Department of Communications and Integrated Systems, Tokyo Institute of Technology
-
Kimura Akisato
Department Of Communications And Integrated Systems Tokyo Institute Of Technology:ntt Communication
-
Kimura Akisato
Department Of Communications And Integrated Systems Tokyo Institute Of Technology
-
Uyematsu Tomohiko
Tokyo Inst. Technol. Tokyo Jpn
-
Kuzuoka Shigeaki
Wakayama Univ. Wakayama‐shi Jpn
関連論文
- Secret Key Agreement by Soft-Decision of Signals in Gaussian Maurer's Model
- Asymptotical Optimality of Two Variations of Lempel-Ziv Codes for Sources with Countably Infinite Alphabet(Source Coding,Information Theory and Its Applications)
- FOREWORD
- Universal Lossy Coding for Individual Sequences Based on Complexity Functions(Information Theory)
- Decodability of Network Coding with Time-Varying Delay and No Buffering
- Universal Coding for Correlated Sources with Complementary Delivery(Information Theory and Its Applications)
- Universal source coding for complementary delivery
- Information-theoretical analysis of index searching : Revised
- Relationship among Complexities of Individual Sequences over Countable Alphabet(Information Theory)
- Multiterminal source coding with complementary delivering(HISC2006)
- Fixed-Slope Universal Lossy Coding for Individual Sequences and Nonstationary Sources
- Network Design for Multi-Layered Photonic IP Networks Considering IP Traffic Growth(Internet)
- Strongly Secure Privacy Amplification Cannot Be Obtained by Encoder of Slepian-Wolf Code
- Two Methods for Decreasing the Computational Complexity of the MIMO ML Decoder(Communication Theory)(Information Theory and Its Applications)
- Slepian-Wolf Coding of Individual Sequences Based on Ensembles of Linear Functions
- A-6-9 On the Suboptimality of Linear Lossy Codes
- A-6-5 A Lower Bound on the Codeword Length of Grammar Based Codes
- A Sufficient Condition for the Existence of a Universal Slepian-Wolf Code
- An Application of Linear Codes to the Problem of Source Coding with Partial Side Information
- Randomness of Individual Sequences
- Universal Variable-to-Fixed Length Codes Achieving Optimum Large Deviations Performance for Empirical Compression Ratio
- On the Suboptimality of Linear Lossy Codes
- A Novel Realization of Threshold Schemes over Binary Field Extensions
- AS-2-3 Secret sharing schemes based on linear codes can be precisely characterized by the relative generalized Hamming weight
- Secret Sharing Schemes Based on Linear Codes Can Be Precisely Characterized by the Relative Generalized Hamming Weight