Please use this identifier to cite or link to this item: http://cmuir.cmu.ac.th/jspui/handle/6653943832/58508
Title: On the Symbol-Pair Distance of Repeated-Root Constacyclic Codes of Prime Power Lengths
Authors: Hai Q. Dinh
Bac Trong Nguyen
Abhay Kumar Singh
Songsak Sriboonchitta
Keywords: Computer Science
Social Sciences
Issue Date: 1-Apr-2018
Abstract: © 1963-2012 IEEE. Let p be a prime, and λ be a nonzero element of the finite field Fpm. The λ-constacyclic codes of length psover Fpmare linearly ordered under set-theoretic inclusion, i.e., they are the ideals (x-λ0)i, 0 ≤ i ≤ psof the chain ring [(Fpm[x])/(xps-λ)]. This structure is used to establish the symbol-pair distances of all such λ-constacyclic codes. Among others, all maximum distance separable symbol-pair constacyclic codes of length p^{s} are obtained.
URI: https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=85028917637&origin=inward
http://cmuir.cmu.ac.th/jspui/handle/6653943832/58508
ISSN: 00189448
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.