A Construction of Channel Code, Joint Source-Channel Code, and Universal Code for Arbitrary Stationary Memoryless Channels Using Sparse Matrices
スポンサーリンク
概要
- 論文の詳細を見る
A channel code is constructed using sparse matrices for stationary memoryless channels that do not necessarily have a symmetric property like a binary symmetric channel. It is also shown that the constructed code has the following remarkable properties. 1. Joint source-channel coding: Combining channel code with lossy source code, which is also constructed by sparse matrices, a simpler joint source-channel code can be constructed than that constructed by the ordinary block code. 2. Universal coding: The constructed channel code has a universal property under a specified condition.
- （社）電子情報通信学会の論文
- 2009-09-01
著者
-
Muramatsu Jun
Ntt Communication Science Laboratories Ntt Corporation
-
MIYAKE Shigeki
NTT Network Innovation Laboratories, NTT Corporation
-
Miyake Shigeki
Ntt Network Innovation Laboratories Ntt Corporation
-
Muramatsu Jun
Ntt Communication Science Lab-oratories
-
MURAMATSU Jun
NTT Communication Science Laboratories, NTT Corporation
関連論文
- Secret Key Capacity and Advantage Distillation Capacity(Cryptography,Information Theory and Its Applications)
- Secret Key Agreement under Sampling Attack
- Secret Key Capacity and Advantage Distillation Capacity
- A Construction of Lossy Source Code Using LDPC Matrices
- A Construction of Channel Code, Joint Source-Channel Code, and Universal Code for Arbitrary Stationary Memoryless Channels Using Sparse Matrices
- Source Coding Algorithms Using the Randomness of a Past Sequence(Information Theory)
- Secret Key Agreement from Correlated Source Outputs Using Low Density Parity Check Matrices(Information Theory)
- An Information-Spectrum Approach to Rate-Distortion Function with Side Information
- An Information-Spectrum Approach to Rate-Distortion Function with Side Information
- Construction of Universal Codes Using LDPC Matrices and Their Error Exponents(Information Theory and Its Applications)
- On the Problem of Generating Mutually Independent Random Sequences
- Dual Quantity of the Distortion-Complexity and a Universal Data-Base for Fixed-Rate Data Compression with Distortion (Special Section on Information Theory and Its Applications)
- Simulated Random Coding Algorithm for Correlated Sources with Ensemble of Linear Matrices(Information Theory)
- Channel Coding Algorithm Simulating the Random Coding(Information Theory)