Nhảy đến nội dung

On the Hamming Distance of Repeated-Root Cyclic Codes of Length 6ps


Hai Q. Dinh, Xiaoqiang Wang, Paravee Maneejuk

Source title: 
IEEE Access, 8: 39946-39958, 2020 (ISI)
Academic year of acceptance: 

Let p be an odd prime, s, m be positive integers such that pm = 2 (mod 3). In this paper, using the relationship about Hamming distances between simple-root cyclic codes and repeated-root cyclic codes, the Hamming distance of all cyclic codes of length 6ps over finite field Fp(m) is obtained. All maximum distance separable (MDS) cyclic codes of length 6ps are established.