Hamming distance of repeated-root constacyclic codes of length 2ps over Fpm+uFpm

Let p be an odd prime, and δ be an arbitrary unit of the finite chain ring F p m + u F p m ( u 2 = 0 ) . The Hamming distances of all δ -constacyclic codes of length 2 p s over F p m + u F p m are completely determined. We provide some examples from which some codes have better parameters than the e...

Full description

Saved in:
Bibliographic Details
Published in:Applicable algebra in engineering, communication and computing communication and computing, 2020, Vol.31 (3-4), p.291-305
Main Authors: Dinh, Hai Q., Gaur, A., Gupta, Indivar, Singh, Abhay K., Singh, Manoj Kumar, Tansuchat, Roengchai
Format: Article
Language:English
Subjects:
Artificial Intelligence
Computer Hardware
Computer Science
Original Paper
Symbolic and Algebraic Manipulation
Theory of Computation
Citations: Items that this one cites
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Let p be an odd prime, and δ be an arbitrary unit of the finite chain ring F p m + u F p m ( u 2 = 0 ) . The Hamming distances of all δ -constacyclic codes of length 2 p s over F p m + u F p m are completely determined. We provide some examples from which some codes have better parameters than the existing ones. As applications, we determine all MDS repeated-root δ -constacyclic codes of length 2 p s over F p m + u F p m .
ISSN:0938-1279
1432-0622
DOI:10.1007/s00200-020-00432-0