Enumeration formulas for self-dual cyclic codes
From MaRDI portal
(Redirected from Publication:324259)
Recommendations
- A note on self-dual cyclic codes over finite chain rings
- On self-dual cyclic codes over finite chain rings
- 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} \)
- Negacyclic self-dual codes over finite chain rings
Cites work
- scientific article; zbMATH DE number 3887879 (Why is no real title available?)
- scientific article; zbMATH DE number 5296403 (Why is no real title available?)
- scientific article; zbMATH DE number 3460471 (Why is no real title available?)
- scientific article; zbMATH DE number 2002850 (Why is no real title available?)
- scientific article; zbMATH DE number 1406438 (Why is no real title available?)
- A class of minimal cyclic codes over finite fields
- Code equivalence characterizes finite Frobenius rings
- Constacyclic codes of length \(p^s\) over \(\mathbb F_{p^m} + u\mathbb F_{p^m}\)
- Cyclic and Negacyclic Codes Over Finite Chain Rings
- Cyclic codes and quadratic residue codes over Z/sub 4/
- Cyclic codes over \(\mathbb Z_4\) of even length
- Cyclic codes over the integers modulo \(p^m\).
- Cyclic self-dual \(\mathbb Z_4\)-codes.
- Cyclic self-dual codes
- Duality for modules over finite rings and applications to coding theory
- Explicit factorization of \(X^{2^m}p^n-1\) over a finite field
- Explicit factorization of \(x^{2^ k}+1\) over \(F_ p\) with prime \(p\equiv 3\bmod 4\)
- Fundamentals of Error-Correcting Codes
- Negacyclic self-dual codes over finite chain rings
- On Self-Dual Cyclic Codes Over Finite Fields
- On cyclic self-dual codes
- On cyclic self-orthogonal codes over \(\mathbb{Z}_{2^m}\)
- On self-dual cyclic codes over finite chain rings
- On the generators of Z/sub 4/ cyclic codes of length 2/sup e/
- On the structure of linear and cyclic codes over a finite chain ring
- The Z/sub 4/-linearity of Kerdock, Preparata, Goethals, and related codes
Cited in
(19)- SRIM and SCRIM factors of \(x^n+1\) over finite fields and their applications
- Self-reciprocal and self-conjugate-reciprocal irreducible factors of \(x^n - \lambda\) and their applications
- Some arithmetical properties of cyclotomic cosets and their applications
- New EAQEC codes from cyclic codes over \(\mathbb{F}_q + u\mathbb{F}_q\)
- The existence for self-orthogonal cyclic codes over finite fields
- Self-dual and complementary dual abelian codes over Galois rings
- On self-duality and hulls of cyclic codes over \(\frac{\mathbb{F}_{2^m}[u]}{\langle u^k\rangle}\) with oddly even length
- New quantum codes from self-orthogonal cyclic codes over \(\mathbb{F}_{q^2}[u]/\langle u^k \rangle\)
- Self-conjugate-reciprocal irreducible monic factors of \(x^{n}-1\) over finite fields and their applications
- Quantum codes from linear codes over finite chain rings
- Primitive idempotents of irreducible cyclic codes and self-dual cyclic codes over Galois rings
- Quantum synchronizable codes from finite rings
- Enumeration of self-dual and self-orthogonal negacyclic codes over finite fields
- Construction of self-dual MDR cyclic codes over finite chain rings
- Mass formulae for Euclidean self-orthogonal and self-dual codes over finite commutative chain rings
- Construction and enumeration for self-dual cyclic codes of even length over \(\mathbb{F}_{2^m} + u \mathbb{F}_{2^m} \)
- Enumeration formulae for self-dual, self-orthogonal and complementary-dual quasi-cyclic codes over finite fields
- Enumeration of self-dual cyclic codes of some specific lengths over finite fields
- On constacyclic codes over \(Z_{p_1 p_2 \cdots p_t}\)
This page was built for publication: Enumeration formulas for self-dual cyclic codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q324259)
