Cyclic codes over F₂^m[u]/ u^k of oddly even length

From MaRDI portal
Publication:315737

DOI10.1007/S00200-015-0281-4zbMATH Open1344.94090arXiv1511.05413OpenAlexW2963422053MaRDI QIDQ315737FDOQ315737


Authors: Yuan Cao, Fangwei Fu, Yonglin Cao Edit this on Wikidata


Publication date: 23 September 2016

Published in: Applicable Algebra in Engineering, Communication and Computing (Search for Journal in Brave)

Abstract: Let mathbbF2m be a finite field of characteristic 2 and R=mathbbF2m[u]/langleukangle=mathbbF2m+umathbbF2m+ldots+uk1mathbbF2m (uk=0) where kinmathbbZ+ satisfies kgeq2. For any odd positive integer n, it is known that cyclic codes over R of length 2n are identified with ideals of the ring R[x]/langlex2n1angle. In this paper, an explicit representation for each cyclic code over R of length 2n is provided and a formula to count the number of codewords in each code is given. Then a formula to calculate the number of cyclic codes over R of length 2n is obtained. Moreover, the dual code of each cyclic code and self-dual cyclic codes over R of length 2n are investigated. (AAECC-1522)


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




Recommendations




Cites Work


Cited In (13)





This page was built for publication: Cyclic codes over \(\mathbb{F}_{2^m}[u]/\langle u^k\rangle \) of oddly even length

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