Upper Bounds on Relative Length/Dimension Profile

摘要：

Length/dimension profile (LDP),also called generalized Hamming weight (GHW) hierarchy,is a key concept in coding theory and applied to many areas.It was extended to relative length/dimension profile (RLDP) for protecting messages in the wiretap channel of type Ⅱ with illegitimate parties.Recently,the concept was applied to network coding and trellis complexity.For the above applications,upper bounds on RLDP imply possible optimality and code constructions are for designing optimal schemes.Unfortunately,few results of upper bounds were shown.The generalized Singleton bound is not tight in most cases.In this paper,we introduce two new upper bounds and compare them with the Singleton one.Various constructions for meeting the new bounds have been discussed in another paper.We show that their refined forms are always sharper than the generalized Singleton bound.Finally,a transformation method is provided to derive bounds on two equivalent concepts of RLDP,which facilitates the study of optimality,e.g.upper bounds on equivocation of the wiretap model.

关键词： length/dimension profile (LDP) generalized Hamming weight (GHW) relative length/dimension profile (RLDP) wiretap channel of type Ⅱ network coding trellis complexity

作者: Zhuojun Zhuang Yuan Luo Bin Dai

作者单位: Department of Computer Science and Engineering, Shanghai Jiao Tong University, Shanghai, China;The S Department of Computer Science and Engineering, Shanghai Jiao Tong University, Shanghai, China;Natio Department of Computer Science and Engineering, Shanghai Jiao Tong University, Shanghai, China;The S

会议类型: 国内会议

会议名称: 第十七届全国青年通信学术年会、2012全国物联网与信息安全学术年会

会议地点: 北戴河

会议语种:英文

页码: 33-39

在线出版日期: 2012-07-01（万方平台首次上网日期，不代表论文的发表时间）