An explicit representation and enumeration for self-dual cyclic codes over \(\mathbb{F}_{2^m}+u\mathbb{F}_{2^m}\) of length \(2^s\)

From MaRDI portal
Revision as of 20:57, 2 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:2421874

DOI10.1016/j.disc.2019.04.008zbMath1412.94241arXiv1811.11018OpenAlexW2902482736MaRDI QIDQ2421874

Somphong Jitman, Yuan Cao, Hai Quang Dinh, Yong-Lin Cao

Publication date: 18 June 2019

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

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




Related Items (17)

Constacyclic codes of length \((p^r,p^s)\) over mixed alphabetsConstacyclic codes of length \(8p^s\) over \(\mathbb{F}_{p^m} + u\mathbb{F}_{p^m}\)On \(\mathbb{F}_2 RS\)-cyclic codes and their applications in constructing optimal codesAn explicit expression for Euclidean self-dual cyclic codes over \(\mathbb{F}_{2^m} + u \mathbb{F}_{2^m}\) of length \(2^s\)An explicit expression for Euclidean self-dual cyclic codes of length \(2^k\) over Galois ring \(\mathrm{GR}(4,m)\)An efficient method to construct self-dual cyclic codes of length \(p^s\) over \(\mathbb{F}_{p^m} + u \mathbb{F}_{p^m} \)Optimal constructions of quantum and synchronizable codes from repeated-root cyclic codes of length \(3p^s\)On a class of skew constacyclic codes over mixed alphabets and applications in constructing optimal and quantum codesMDS constacyclic codes of prime power lengths over finite fields and construction of quantum MDS codesA class of skew cyclic codes and application in quantum codes constructionQuantum codes from a class of constacyclic codes over finite commutative ringsQuantum codes from skew constacyclic codes over the ring \(\mathbb{F}_q [u, v \slash \langle u^2 - 1, v^2 - 1, u v - v u \rangle \)] ⋮ Construction and enumeration for self-dual cyclic codes of even length over \(\mathbb{F}_{2^m} + u \mathbb{F}_{2^m} \)On matrix-product structure of repeated-root constacyclic codes over finite fieldsGlobal asymptotic stability for a nonlinear density-dependent mortality Nicholson's blowflies system involving multiple pairs of time-varying delaysHamming distance of repeated-root constacyclic codes of length \(2p^s\) over \({\mathbb{F}}_{p^m}+u{\mathbb{F}}_{p^m} \)On the construction of self-dual cyclic codes over \(\mathbb{Z}_4\) with arbitrary even length



Cites Work




This page was built for publication: An explicit representation and enumeration for self-dual cyclic codes over \(\mathbb{F}_{2^m}+u\mathbb{F}_{2^m}\) of length \(2^s\)