AS-2-3 Secret sharing schemes based on linear codes can be precisely characterized by the relative generalized Hamming weight

スポンサーリンク

概要

• 論文の詳細を見る
• 2012-03-06

著者

• Uyematsu Tomohiko

  Tokyo Inst. Of Technol. Tokyo Jpn

• Matsumoto Ryutaroh

  Tokyo Inst. Of Technol. Tokyo Jpn

• Kurihara Jun

  Tokyo Institute Of Technology:kddi R&d Laboratories Inc.

• Uyematsu Tomohiko

  Tokyo Institute Of Technology

• MATSUMOTO Ryutaroh

  Tokyo Institute of Technology:Aalborg University

関連論文

• 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)
• 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)
• Construction of wiretap codes from ordinary channel codes (ワイドバンドシステム)
• Strongly Secure Privacy Amplification Cannot Be Obtained by Encoder of Slepian-Wolf Code
• AS-2-3 Secret sharing schemes based on linear codes can be precisely characterized by the relative generalized Hamming weight

スポンサーリンク