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

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

Publication:2291360

DOI10.1016/j.ffa.2019.101598OpenAlexW2964549701MaRDI QIDQ2291360

Fanghui Ma, Yuan Cao, Hai Quang Dinh, Yong-Lin Cao, Fang-Wei Fu

Publication date: 30 January 2020

Published in: Finite Fields and their Applications (Search for Journal in Brave)

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




Related Items (16)

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 efficient method to construct self-dual cyclic codes of length \(p^s\) over \(\mathbb{F}_{p^m} + u \mathbb{F}_{p^m} \)On constacyclic codes of length \(p^s\) over \(\mathbb{F}_{p^m} [ u , v \slash \langle u^2 , v^2 , u v - v u \rangle \)] ⋮ 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 ringsNon-invertible-element constacyclic codes over finite PIRsQuantum 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 \)] ⋮ On matrix-product structure of repeated-root constacyclic codes over finite fieldsHamming distance of repeated-root constacyclic codes of length \(2p^s\) over \({\mathbb{F}}_{p^m}+u{\mathbb{F}}_{p^m} \)\((\theta, \delta_\theta)\)-cyclic codes over \(\mathbb{F}_q[u,v / \langle u^2-u, v^2-v, uv-vu \rangle\)]



Cites Work




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