Source Coding Algorithms Using the Randomness of a Past Sequence(Information Theory)
スポンサーリンク
概要
- 論文の詳細を見る
We propose source coding algorithms that use the randomness of a past sequence. The proposed algorithms solve the problems of multi-terminal source coding, rate-distortion source coding, and source coding with partial side information at the decoder. We analyze the encoding rate and the decoding error rate in terms of almost-sure convergence.
- 社団法人電子情報通信学会の論文
- 2005-04-01
著者
-
Muramatsu Jun
Ntt Communication Science Laboratories Ntt Corporation
-
Muramatsu Jun
Ntt Corp. Kyoto‐fu Jpn
-
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)
- 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)
- Channel Coding Algorithm Simulating the Random Coding(Information Theory)