DocumentCode :
3389906
Title :
On the RDLP and IRDLP of a linear code and a linear subcode
Author :
Zhuang, Zhuojun ; Luo, Yuan ; Vinck, A. J Han ; Dai, Bin
Author_Institution :
Dept. of Comput. Sci. & Eng., Shanghai Jiao Tong Univ., Shanghai, China
fYear :
2011
fDate :
25-28 Sept. 2011
Firstpage :
975
Lastpage :
978
Abstract :
For a linear code and a linear subcode, the relative dimension/length profile (RDLP), inverse relative dimension/ length profile (IRDLP) and relative length/dimension profile (RLDP) are three character sequences, which have been applied to the wiretap channel of type II with illegitimate parties and extended in the wiretap network II for the secrecy control of linear network coding. They also provide useful information to analyze the trellis complexity of a linear code. These concepts are two-code generalizations of the DLP, IDLP and LDP proposed by Forney, respectively. The Singleton bounds on RDLP, IRDLP and RLDP also extend Forney´s bounds. In this paper, we introduce new relations with respect to RDLP and IRDLP. We show that the Singleton bounds on RDLP, IRDLP and RLDP can be derived directly from these relations. Some interesting duality properties of RDLP and IRDLP are also given.
Keywords :
linear codes; network coding; trellis codes; Forney bounds; Singleton bounds; character sequences; duality properties; inverse relative dimension-length profile; linear code; linear subcode; network coding; relative dimension-length profile; relative length-dimension profile; secrecy control; trellis complexity; two-code generalizations; wiretap channel; wiretap network; Complexity theory; Educational institutions; Generators; Hamming weight; Laboratories; Linear code; Network coding;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Communication Technology (ICCT), 2011 IEEE 13th International Conference on
Conference_Location :
Jinan
Print_ISBN :
978-1-61284-306-3
Type :
conf
DOI :
10.1109/ICCT.2011.6158024
Filename :
6158024
Link To Document :
بازگشت