手机知网 App
24小时专家级知识服务
打 开
手机知网|搜索

  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 II 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.……