摘要
Based on the applications to the wire-tap channel and bounds on the relative generalized Hamming weight, we will introduce optimal codes of type mathcal {I} and type mathcal {II}. We will give some necessary conditions and the explicit construction for a linear code mathcal {C} to be optimal of type mathcal {I} and mathcal {II} with respect to a subcode mathcal {C}_{1}. We will also present a new bound on two different parameters of the relative generalized Hamming weight.
源语言 | 英语 |
---|---|
页(从-至) | 6344-6355 |
页数 | 12 |
期刊 | IEEE Transactions on Information Theory |
卷 | 67 |
期 | 10 |
DOI | |
出版状态 | 已出版 - 10月 2021 |