Please use this identifier to cite or link to this item: http://cmuir.cmu.ac.th/jspui/handle/6653943832/68351
Title: On the hamming distances of constacyclic codes of length 5p<sup>S</sup>
Authors: Hai Q. Dinh
Xiaoqiang Wang
Jirakom Sirisrisakulchai
Keywords: Computer Science
Engineering
Materials Science
Issue Date: 1-Jan-2020
Abstract: © 2013 IEEE. Let p be a prime, s, m be positive integers, and λ be a nonzero element of the finite field Fpm. In this paper, the algebraic structures of constacyclic codes of length 5~ps~(p≠5) are obtained, which provide all self-dual, self-orthogonal and dual containing codes. Moreover, the exact values of the Hamming distances of all such codes are completely determined. Among other results, we obtain the degrees of the generator polynomials of all MDS repeated-root constacyclic codes of arbitrary length. As applications, several new and optimal codes are provided.
URI: https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=85082018252&origin=inward
http://cmuir.cmu.ac.th/jspui/handle/6653943832/68351
ISSN: 21693536
Appears in Collections:CMUL: Journal Articles

Files in This Item:
There are no files associated with this item.


Items in CMUIR are protected by copyright, with all rights reserved, unless otherwise indicated.