On MDS geometric Fq-linear Fqt-codes
On MDS geometric Fq-linear Fqt-codes
复制标题
DOI：
--
复制
发表时间：
2023
期刊：
影响因子：
--
通讯作者：
韩冬春
中科院分区：
文献类型：
--
作者：
任远;韩冬春
Let F q be a finite field and t be a positive integer. We first generalize the construction of algebraic-geometric codes to the setting of F q -linear F q t -codes. Then we show that such codes arising from the projective line yield MDS (resp. self-dual MDS) F q -linear F q t -codes (resp. when q is a power of 2). We also derive a tight upper bound for the maximal length of primitive MDS elliptic F q -linear F q t -codes with F q -dimension k divided by t and satisfies 3 ≤ k t ≤ q + 1 − 2 q 20 .
