On the second relative greedy weight

详细信息    查看全文

• 作者：Xin Li ; Zihui Liu
• 关键词：Relative greedy weight ; Relative generalized Hamming weight ; Value assignment ; Upper bound ; Support weight
• 刊名：Cryptography and Communications
• 出版年：2017
• 出版时间：March 2017
• 年：2017
• 卷：9
• 期：2
• 页码：181-197
• 全文大小：
• 刊物类别：Computer Science
• 刊物主题：Data Structures, Cryptology and Information Theory; Coding and Information Theory; Communications Engineering, Networks; Information and Communication, Circuits; Mathematics of Computing;
• 出版者：Springer US
• ISSN：1936-2455
• 卷排序：9

文摘

Based on the wire-tap channel of type II with two users given by Luo et al. in 2005, we introduce the relative greedy weights. A finite projective geometry method is presented in order to describe the relative greedy weights. By using this finite projective geometry method, the optimal 3-dimensional q-ary codes are searched so as to maximize the effort for the adversary to obtain the second data symbol on condition that he has obtained the first data symbol from the wire-tap channel of type II with two users.