当前位置:
X-MOL 学术
›
J. Appl. Math. Comput.
›
论文详情
Our official English website, www.x-mol.net, welcomes your
feedback! (Note: you will need to create a separate account there.)
The minimum Hamming distances of repeated-root cyclic codes of length $$6p^s$$ 6 p s and their MDS codes
Journal of Applied Mathematics and Computing ( IF 2.4 ) Pub Date : 2020-06-29 , DOI: 10.1007/s12190-020-01383-y Ying Gao , Qin Yue , Fengwei Li
中文翻译:
长度为$ 6p ^ s $$ 6 ps的重复根循环码的最小汉明距离及其MDS码
更新日期:2020-07-24
Journal of Applied Mathematics and Computing ( IF 2.4 ) Pub Date : 2020-06-29 , DOI: 10.1007/s12190-020-01383-y Ying Gao , Qin Yue , Fengwei Li
In this paper, let p be a prime with \(p\ge 7\). We determine the weight distributions of cyclic codes of length 6 over \(\mathbb {F}_q\) and the minimum Hamming distances of all repeated-root cyclic codes of length \(6p^s\) over \(\mathbb {F}_q\), where q is a power of p and s is an integer. Furthermore, we find all maximum distance separable codes of length \(6p^s\).
中文翻译:
长度为$ 6p ^ s $$ 6 ps的重复根循环码的最小汉明距离及其MDS码
在本文中,令p为\(p \ ge 7 \)的质数。我们确定的长度的循环码的重量分布6以上\(\ mathbb {F} _q \)和的长度的所有重复根循环码的最小汉明距离\(6P,2S \)超过\(\ mathbb {F } _q \),其中q是p的幂,而s是整数。此外,我们找到了长度为\(6p ^ s \)的所有最大距离可分离代码。