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

DOI10.1007/S00200-015-0281-4MaRDI QIDQ315737zbMATH OpenOpenAlexFDO

Authors Yuan Cao, Fangwei Fu, Yonglin Cao

Publication date 23 September 2016

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

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

zbMATH Keywords

self-dual codedual codecyclic codefinite chain ringnon-principal ideal ring

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Linear codes (general theory) (94B05) Cyclic codes (94B15)

Abstract: Let $mathbb{F}_{2^m}$ be a finite field of characteristic $2$ and $R=mathbb{F}_{2^m}[u]/langle{u}^{k}angle=mathbb{F}_{2^m}+umathbb{F}_{2^m}+ldots+u^{k-1}mathbb{F}_{2^m}$ ($u^k=0$) where $kinmathbb{Z}^{+}$ 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]/langle{x}^{2n}-1angle$. 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)

Recommendations

• Construction and enumeration for self-dual cyclic codes of even length over \(\mathbb{F}_{2^m} + u \mathbb{F}_{2^m} \)
• Cyclic codes of odd length over \(\mathbb{Z}_4 [u]/u^k\)
• On self-duality and hulls of cyclic codes over \(\frac{\mathbb{F}_{2^m}[u]}{\langle u^k\rangle}\) with oddly even length
• An explicit representation and enumeration for self-dual cyclic codes over \(\mathbb{F}_{2^m}+u\mathbb{F}_{2^m}\) of length \(2^s\)
• Some results on cyclic codes over the ring \(R_{2,m}\)

Cites work

• Constacyclic Codes of Length $2^s$ Over Galois Extension Rings of ${\BBF}_{2}+u{\BBF}_2$
• Constacyclic codes of length \(p^s\) over \(\mathbb F_{p^m} + u\mathbb F_{p^m}\)
• Cyclic codes and self-dual codes over F/sub 2/+uF/sub 2/
• Cyclic codes over \(\mathbb Z_2+u\mathbb Z_2+u^2\mathbb Z_2+\ldots+u^{k-1}\mathbb Z_2\)
• Cyclic codes over the rings \(\mathbb Z_2 + u\mathbb Z_2\) and \(\mathbb Z_2 + u\mathbb Z_2 + u^2 \mathbb Z_2\)
• On cyclic codes over the ring \(\mathbb Z_p[u]/\langle u^k\rangle\)
• On the structure of linear and cyclic codes over a finite chain ring
• Self-dual codes over commutative Frobenius rings

Cited in

(13)

• On self-duality and hulls of cyclic codes over \(\frac{\mathbb{F}_{2^m}[u]}{\langle u^k\rangle}\) with oddly even length
• Some results on cyclic codes over the ring \(R_{2,m}\)
• Classification of self-dual cyclic codes over the chain ring \(\mathbb Z_p[u]/\langle u^3 \rangle \)
• Representation and matrix-product structure of type-1 constacyclic codes over \(\mathbb{F}_{p^m}[u]/\langle u^e\rangle\)
• Classification of cyclic codes over a non-Galois chain ring \(\mathbb{Z}_p [u] / \langle u^3 \rangle\)
• Matrix-product structure of constacyclic codes over finite chain rings \(\mathbb{F}_{p^m}[u]/\langle u^e\rangle\)
• An explicit representation and enumeration for negacyclic codes of length \(2^kn\) over \(\mathbb{Z}_4+u\mathbb{Z}_4\)
• Complete classification of \((\delta + \alpha u^2)\)-constacyclic codes over \(\mathbb{F}_{2^m} [u]/\langle u^4 \rangle\) of oddly even length
• Cyclic codes of odd length over \(\mathbb{Z}_4 [u]/u^k\)
• Torsion codes of a \(\alpha \)-constacyclic code over \(\frac{\mathbb{F}_{p^m} [ u ]}{\langle u^3 \rangle} \)
• Number of cyclic codes over \(F_2+uF_2\) of oddly even length
• On the depth spectrum of repeated-root constacyclic codes over finite chain rings
• The dual code of any \((\delta + \alpha u^2)\)-constacyclic code over \(\mathbb{F}_{2^m} [u] \slash \langle u^4 \rangle\) of oddly even length

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)