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
Abstract: Let be an odd prime number, be a finite field of cardinality and a positive integer. Using some combinatorial identities, we obtain certain properties for Kronecker product of matrices over with a specific type. On that basis, we give an explicit representation and enumeration for all distinct self-dual cyclic codes of length over the finite chain ring . Moreover, We provide an efficient method to construct every self-dual cyclic code of length over precisely.
A code \(C\) over a ring is self-dual if \(C=C^\perp\), where \(C^\perp\) is the standard Euclidean dual. The code \(C\) is cyclic if \((c_0,c_1,\ldots,c_{n-1}) \in C\) implies \((c_{n-1}, c_0,c_1,\ldots,c_{n-2})\). The authors use combinatorial techniques to give an explicit representation and enumeration for all distinct self-dual cyclic codes of length \(p^s\) over the ring \(F_{p^m} [u] / \langle u^2 \rangle\). Additionally, they given an efficient method to construct every self-dual cyclic code in this setting.
Recommendations
- An explicit representation and enumeration for self-dual cyclic codes over \(\mathbb{F}_{2^m}+u\mathbb{F}_{2^m}\) of length \(2^s\)
- Construction and enumeration for self-dual cyclic codes of even length over \(\mathbb{F}_{2^m} + u \mathbb{F}_{2^m} \)
- An explicit expression for all distinct self-dual cyclic codes of length \(p^k\) over Galois ring \(\mathrm{GR}(p^2,m)\)
- On self-dual constacyclic codes of length \(p^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
- A note on cyclic codes over \(\mathrm{GR}(p^{2},m)\) of length \(p^{k}\)
- An explicit representation and enumeration for self-dual cyclic codes over \(\mathbb{F}_{2^m}+u\mathbb{F}_{2^m}\) of length \(2^s\)
- Constacyclic Codes of Length $2^s$ Over Galois Extension Rings of ${\BBF}_{2}+u{\BBF}_2$
- Constacyclic codes of length \(2p^{s}\) over \(\mathbb{F}_{p^m} + u \mathbb{F}_{p^m}\)
- Constacyclic codes of length \(np^s\) over \(\mathbb{F}_{p^m}+u\mathbb{F}_{p^m}\)
- Constacyclic codes of length \(p^s\) over \(\mathbb F_{p^m} + u\mathbb F_{p^m}\)
- Constacyclic codes over \(\mathbb F_2 + u\mathbb F_2\)
- Construction and enumeration for self-dual cyclic codes of even length over \(\mathbb{F}_{2^m} + u \mathbb{F}_{2^m} \)
- Construction of optimal Type IV self-dual codes over F/sub 2/+uF/sub 2/
- Cyclic and negacyclic codes of length \(4 p^s\) over \(\mathbb{F}_{p^m} + u \mathbb{F}_{p^m}\)
- Cyclic and Negacyclic Codes Over Finite Chain Rings
- Cyclic codes and self-dual codes over F/sub 2/+uF/sub 2/
- scientific article; zbMATH DE number 1975686 (Why is no real title available?)
- Negacyclic codes of length \(2p^s\) over \(\mathbb{F}_{p^m} + u \mathbb{F}_{p^m}\)
- On \((1 - u)\)-cyclic codes over \(\mathbb F_{p^k}+u\mathbb F_{p^k}\)
- On constacyclic codes of length \(4p^s\) over \(\mathbb{F}_{p^m} +u\mathbb{F}_{p^m}\)
- On self-dual constacyclic codes of length \(p^s\) over \(\mathbb{F}_{p^m} + u \mathbb{F}_{p^m}\)
- On the decomposition of self-dual codes over \(\mathbb F_2 + u\mathbb F_2\) with an automorphism of odd prime order
- Self-dual abelian codes in some nonprincipal ideal group algebras
- Self-dual codes over commutative Frobenius rings
- Type II codes over \(\mathbb{F}_{2^m} + u\mathbb{F}_{2^m}\)
- Type II codes over F/sub 2/+uF/sub 2/
Cited in
(20)- On self-duality and hulls of cyclic codes over \(\frac{\mathbb{F}_{2^m}[u]}{\langle u^k\rangle}\) with oddly even length
- Classification of self-dual cyclic codes over the chain ring \(\mathbb Z_p[u]/\langle u^3 \rangle \)
- On the construction of self-dual cyclic codes over \(\mathbb{Z}_4\) with arbitrary even length
- Constacyclic codes of length \(8p^s\) over \(\mathbb{F}_{p^m} + u\mathbb{F}_{p^m}\)
- MDS constacyclic codes of prime power lengths over finite fields and construction of quantum MDS codes
- Construction and enumeration for self-dual cyclic codes of even length over \(\mathbb{F}_{2^m} + u \mathbb{F}_{2^m} \)
- Constructing Self-dual cyclic codes over \({\mathbb{Z}}_{9}\) of length \(3n\)
- An explicit representation and enumeration for self-dual cyclic codes over \(\mathbb{F}_{2^m}+u\mathbb{F}_{2^m}\) of length \(2^s\)
- On \(\mathbb{F}_2 RS\)-cyclic codes and their applications in constructing optimal codes
- An 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)\)
- A recursive method for the construction and enumeration of self-orthogonal and self-dual codes over the quasi-Galois ring \(\mathbb{F}_{2^r}[u]/<u^e>\)
- Self-dual codes and cyclic codes over F_p+v F_p.
- Enumeration of self-dual cyclic codes of some specific lengths over finite fields
- Construction of self-dual codes over \(\mathbb{F}_p + v\mathbb{F}_p\)
- Optimal constructions of quantum and synchronizable codes from repeated-root cyclic codes of length \(3p^s\)
- An explicit expression for all distinct self-dual cyclic codes of length \(p^k\) over Galois ring \(\mathrm{GR}(p^2,m)\)
- On a class of skew constacyclic codes over mixed alphabets and applications in constructing optimal and quantum codes
- Constructing and expressing Hermitian self-dual cyclic codes of length $$p^s$$ over $${\mathbb {F}}_{p^m}+u{\mathbb {F}}_{p^m}$$
- Hamming distance of repeated-root constacyclic codes of length \(2p^s\) over \({\mathbb{F}}_{p^m}+u{\mathbb{F}}_{p^m} \)
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)
