On the b-distance of repeated-root constacyclic codes of prime power lengths
https://doi.org/10.1016/j.disc.2019.111780Publisher, magazine: ,
Publication year: 2020
Lưu Trích dẫn Chia sẻAbstract
Let be a prime, , be positive integers, be a nonzero element of the finite field . The -distance generalizes the Hamming distance , and the symbol-pair distance . While the Hamming and symbol-pair distances of all -constacyclic codes of length are completely determined, the general -distance of such codes was left opened. In this paper, we provide a new technique to establish the -distance of all -constacyclic codes of length , where . As an application, all MDS -symbol constacyclic codes of length over are obtained.
Tags: Constacyclic code; Generator polynomial; Repeated-root code; Simple-root code; Hamming distance
Các bài viết liên quan đến tác giả Đinh Quang Hải
Some results on self-injective rings and $\Sigma$-CS rings
A decomposition theorem for $\wp\sp *$-semisimple rings
On the b-distance of repeated-root constacyclic codes of prime power lengths
Symbol-triple distance of repeated-root constacyclic codes of prime power lengths
Optimal b-symbol constacyclic codes with respect to the Singleton bound
On matrix-product structure of repeated-root constacyclic codes over finite fields
Construction and enumeration for self-dual cyclic codes of even length over F2m+uF2m
On a Class of Constacyclic Codes of Length 4ps over Fpm[u]?ua?