Secret Key Capacity for Ergodic Correlated Sources(Information Theory)
スポンサーリンク
概要
- 論文の詳細を見る
This letter deals with the common randomness problem formulated by Ahlswede and Csiszar. Especially, we consider their source- type models without wiretapper for ergodic sources, and clarify the secret key-capacity by using the bin coding technique proposed by Cover.
- 社団法人電子情報通信学会の論文
- 2004-06-01
著者
-
Uyematsu T
The Dept. Of Communications And Integrated Systems Tokyo Institute Of Technology
-
Uyematsu Tomohiko
Dept. Of Communications And Integrated Systems Tokyo Institute Of Technology
-
TOCHIKUBO Kouya
Dept. of Communications and Integrated Systems, Tokyo Institute of Technology
-
MATSUMOTO Ryutaroh
Dept. of Communications and Integrated Systems, Tokyo Institute of Technology
-
Matsumoto R
The Dept. Of Communications And Integrated Systems Tokyo Institute Of Technology
-
Matsumoto Ryutaroh
Dept. Of Communications And Integrated Systems Tokyo Institute Of Technology
-
Uyematsu Tomohiko
Dept. Of Comm. And Integrated Systems Tokyo Institute Of Technology
-
Tochikubo K
The Dept. Of Communications And Integrated Systems Tokyo Institute Of Technology:the Systems Integra
-
Matsumoto Ryutaroh
Dept. of Communications and Computer Engineering, Tokyo Institute of Technology
関連論文
- Simple Estimation for the Dimension of Subfield Subcodes of AG Codes
- An Improved Bound for the Dimension of Subfield Subcodes
- Efficient Secret Sharing Schemes Based on Authorized Subsets(Cryptography and Information Security)
- Secret Key Capacity for Ergodic Correlated Sources(Information Theory)
- One-Point Algebraic Geometric Codes from Artin-Schreier Extensions of Hermitian Function Fields (Special Section on Information Theory and Its Applications)
- Conditional Lempel-Ziv Complexity and Its Application to Source Coding Theorem with Side Information(Source Coding/Imge Processing)(Information Theory and Its Applications)
- Universal Lossy Coding for Individual Sequences Based on Complexity Functions(Information Theory)
- A Simple Parallel Algorithm for the Ziv-Lempel Encoding
- An Efficient Universal Coding Algorithm for Noiseless Channel with Symbols of Unequal Cost
- Proposal of an Automatic Signature Scheme Using a Compiler (Special Section on Cryptography and Information Security)
- Reliability Functions for Concatenated Codes Employing Modular Codes with Maximum Likelihood Decoding
- Permutation Cipher Scheme Using Polynomials over a Field
- Relationship among Complexities of Individual Sequences over Countable Alphabet(Information Theory)
- Construction of wiretap codes from ordinary channel codes (情報処理)
- Construction of wiretap codes from ordinary channel codes (情報セキュリティ)
- Construction of wiretap codes from ordinary channel codes (ワイドバンドシステム)
- Asymptotical Optimality of Two Variations of Lempel-Ziv Codes for Sources with Countably Infinite Alphabet
- Secure multiplex coding with a common message (ワイドバンドシステム・情報通信基礎サブソサイエティ合同研究会)
- Universal Slepian-Wolf Source Codes Using Low-Density Parity-Check Matrices
- Vulnerability of MRD-Code-based Universal Secure Network Coding against Stronger Eavesdroppers
- A New Unified Method for Fixed-Length Source Coding Problems of General Sources
- Secure multiplex coding with a common message (情報理論・情報通信基礎サブソサイエティ合同研究会)
- Secure multiplex coding with a common message (情報セキュリティ・情報通信基礎サブソサイエティ合同研究会)
- Fixed-Slope Universal Lossy Coding for Nonstationary Sources
- Applicability of the Sample Path Method of Ergodic Processes to Individual Sequences
- An algorithm for random number generation by using arithmetic of limited precision : Part II
- A General Formula of the Capacity Region for Multiple-Access Channels with Deterministic Feedback
- A Universal Affine Code for Symmetric Channels
- Gilbert-Varshamov-type bound for relative dimension length profile
- Parametric Forms of the Achievable Rate Region for Source Coding with a Helper