Please use this identifier to cite or link to this item:
Full metadata record
DC FieldValueLanguage
dc.contributor.authorHai Q. Dinhen_US
dc.contributor.authorBac Trong Nguyenen_US
dc.contributor.authorAbhay Kumar Singhen_US
dc.contributor.authorSongsak Sriboonchittaen_US
dc.description.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.en_US
dc.subjectComputer Scienceen_US
dc.subjectSocial Sciencesen_US
dc.titleOn the Symbol-Pair Distance of Repeated-Root Constacyclic Codes of Prime Power Lengthsen_US
article.title.sourcetitleIEEE Transactions on Information Theoryen_US
article.volume64en_US Universityen_US State Universityen_US Nguyen University of Economics and Business Administrationen_US Tat Thanh Universityen_US Institute of Technology (Indian School of Mines), Dhanbaden_US Mai Universityen_US
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.