Secret Sharing Schemes Based on Linear Codes Can Be Precisely Characterized by the Relative Generalized Hamming Weight
スポンサーリンク
概要
- 論文の詳細を見る
- 2012-11-01
著者
-
Uyematsu Tomohiko
The Department Of Commumcations And Integrated Systems Tokyo Institute Of Technology
-
Matsumoto Ryutaroh
The Department Of Communications And Integrated Systems Tokyo Institute Of Technology
-
KURIHARA Jun
the Department of Communications and Integrated Systems, Tokyo Institute of Technology
-
UYEMATSU Tomohiko
the Department of Communications and Integrated Systems, Tokyo Institute of Technology
関連論文
- Simple Estimation for the Dimension of Subfield Subcodes of AG Codes
- Efficient Secret Sharing Schemes Based on Authorized Subsets(Cryptography and Information Security)
- Two Algorithms for Random Number Generation Implemented by Using Arithmetic of Limited Precision(Information Security)(Information Theory and Its Applications)
- Fast Encoding of Algebraic Geometry Codes(Special Section on Information Theory and Its Applications)
- On the Universality of Channel Decoders Constructed from Source Encoders for Finite-State Channels(Special Section on Information Theory and Its Applications)
- Secret Sharing Schemes Based on Linear Codes Can Be Precisely Characterized by the Relative Generalized Hamming Weight