Channel Coding Algorithm Simulating the Random Coding(Information Theory)
スポンサーリンク
概要
- 論文の詳細を見る
Recently, Muramatsu proposed source coding algorithms that use the randomness of a past sequence. The technique of his source coding algorithms is one method of constructing codes from the technique of random coding. By using his technique, we propose a channel coding algorithm with random numbers which can be observed by both the encoder and the decoder where the random numbers are independent of the messages to be transmitted. Then the proposed coding algorithm can transmit messages over a discrete memoryless channel up to the channel capacity with an arbitrarily small decoding error rate and arbitrarily small bits of random numbers per message transmission asymptotically.
- 社団法人電子情報通信学会の論文
- 2004-06-01
著者
-
Iwata Ken-ichi
Graduate School Of Engineering Hiroshima University
-
Muramatsu Jun
Ntt Communication Science Lab-oratories
関連論文
- 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)
- Optimal Synthesis of a Class of 2-D Digital Filters with Minimum L_2-Sensitivity and No Overflow Oscillations(Digital Signal Processing)
- Information-Spectrum Characterization of Multiple-Access Channels with Correlated Sources(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
- 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)
- A relationship between Data Compression using Anti-dictionaries and Burrows-Wheeler Transformation
- Information-Spectrum Characterization of Broadcast Channel with General Source(Information Theory, Information Theory and Its Applications)
- Channel Coding Algorithm Simulating the Random Coding(Information Theory)
- Redundancy-Optimal FF Codes for a General Source and Its Relationships to the Rate-Optimal FF Codes