摘要
The upper bounds on the difference between the third greedy weight and the third generalized Hamming weight of 4-dimensional q-ary codes are obtained by using the finite geometry method. The codes achieving the upper bounds are constructed, and these codes are optimal with respect to the security when they are used in the wire-tap channel of type II with the coset coding scheme.
源语言 | 英语 |
---|---|
页(从-至) | 2213-2230 |
页数 | 18 |
期刊 | Designs, Codes, and Cryptography |
卷 | 87 |
期 | 10 |
DOI | |
出版状态 | 已出版 - 1 10月 2019 |
指纹
探究 'On the third greedy weight of 4-dimensional codes' 的科研主题。它们共同构成独一无二的指纹。引用此
Bai, L., & Liu, Z. (2019). On the third greedy weight of 4-dimensional codes. Designs, Codes, and Cryptography, 87(10), 2213-2230. https://doi.org/10.1007/s10623-019-00614-z