On the relative profiles of a linear code and a subcode

Autor: Bin Dai, A. J. Han Vinck, Zhuojun Zhuang, Yuan Luo
Rok vydání: 2012
Předmět:
Zdroj: Designs, Codes and Cryptography. 72:219-247
ISSN: 1573-7586
0925-1022
DOI: 10.1007/s10623-012-9750-y
Popis: Relative dimension/length profile (RDLP), inverse relative dimension/length profile (IRDLP) and relative length/dimension profile (RLDP) are equivalent sequences of a linear code and a subcode. The concepts were applied to protect messages from an adversary in the wiretap channel of type II with illegitimate parties. The equivocation to the adversary is described by IRDLP and upper-bounded by the generalized Singleton bound on IRDLP. Recently, RLDP was also extended in wiretap network II for secrecy control of network coding. In this paper, we introduce new relations and bounds about the sequences. They not only reveal new connections among known results but also find applications in trellis complexities of linear codes. The state complexity profile of a linear code and that of a subcode can be bounded from each other, which is particularly useful when a tradeoff among coding rate, error-correcting capability and decoding complexity is considered. Furthermore, a unified framework is proposed to derive bounds on RDLP and IRDLP from an upper bound on RLDP. We introduce three new upper bounds on RLDP and use some of them to tighten the generalized Singleton bounds by applying the framework. The approach is useful to improve equivocation estimation in the wiretap channel of type II with illegitimate parties.
Databáze: OpenAIRE
Externí odkaz: