An efficient method to construct self-dual cyclic codes of length p^s over F_p^m + u F_p^m

From MaRDI portal
Publication:2174606

DOI10.1016/J.DISC.2020.111868zbMATH Open1442.94059arXiv1907.07107OpenAlexW2964425497MaRDI QIDQ2174606FDOQ2174606


Authors: Yuan Cao, Somphong Jitman, Yonglin Cao, Hai Quang Dinh Edit this on Wikidata


Publication date: 21 April 2020

Published in: Discrete Mathematics (Search for Journal in Brave)

Abstract: Let p be an odd prime number, mathbbFpm be a finite field of cardinality pm and s a positive integer. Using some combinatorial identities, we obtain certain properties for Kronecker product of matrices over mathbbFp with a specific type. On that basis, we give an explicit representation and enumeration for all distinct self-dual cyclic codes of length ps over the finite chain ring mathbbFpm+umathbbFpm (u2=0). Moreover, We provide an efficient method to construct every self-dual cyclic code of length ps over mathbbFpm+umathbbFpm precisely.


Full work available at URL: https://arxiv.org/abs/1907.07107




Recommendations




Cites Work


Cited In (20)





This page was built for publication: An efficient method to construct self-dual cyclic codes of length \(p^s\) over \(\mathbb{F}_{p^m} + u \mathbb{F}_{p^m} \)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2174606)