Information-theoretical analysis of index searching : Revised
スポンサーリンク
概要
- 論文の詳細を見る
- 2006-11-28
著者
-
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
-
Kimura Akisato
Department Of Communications And Integrated Systems Tokyo Institute Of Technology
関連論文
- 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
- 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)
- Randomness of Individual Sequences
- Universal Variable-to-Fixed Length Codes Achieving Optimum Large Deviations Performance for Empirical Compression Ratio
- 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