Higher weights and near-MDR codes over chain rings

Zihui Liu*, Dajian Liao

*此作品的通讯作者

科研成果: 期刊稿件文章同行评审

1 引用 (Scopus)
Plum Print visual indicator of research metrics
  • Citations
    • Citation Indexes: 1
  • Captures
    • Readers: 2
see details

摘要

The matrix description of a near-MDR code is given, and some judging criterions are presented for near-MDR codes. We also give the weight distribution of a near-MDR code and the applications of a near-MDR code to secret sharing schemes. Furthermore, we will introduce the chain condition for free codes over finite chain rings, and then present a formula for computing higher weights of tensor product of free codes satisfying the chain condition. We will also find a chain for any near-MDR code, and thus show that any near-MDR code satisfies the chain condition.

源语言英语
页(从-至)761-772
页数12
期刊Advances in Mathematics of Communications
12
4
DOI
出版状态已出版 - 11月 2018

指纹

探究 'Higher weights and near-MDR codes over chain rings' 的科研主题。它们共同构成独一无二的指纹。

引用此

Liu, Z., & Liao, D. (2018). Higher weights and near-MDR codes over chain rings. Advances in Mathematics of Communications, 12(4), 761-772. https://doi.org/10.3934/amc.2018045