Repeated-root constacyclic codes of prime power lengths over finite chain rings
From MaRDI portal
(Redirected from Publication:346276)
Recommendations
- Repeated-root constacyclic codes of length \(2p^s\) over \(\mathbb{F}_{p^m}+u\mathbb{F}_{p^m}+u^2\mathbb{F}_{p^m} \)
- The structure of constacyclic codes of length \(2p^s\) over finite chain ring
- Repeated-root constacyclic codes of prime power length
- Repeated-root constacyclic codes of prime power length over \(\frac{\mathbb{F}_{p^m} [u]}{\langle u^a \rangle}\) and their duals
- Repeated-root cyclic and negacyclic codes of prime power lengths with a finite commutative chain ring alphabet
Cites work
- scientific article; zbMATH DE number 3760078 (Why is no real title available?)
- scientific article; zbMATH DE number 3460471 (Why is no real title available?)
- scientific article; zbMATH DE number 2081150 (Why is no real title available?)
- A Mass Formula and Rank of<tex>$BBZ_4$</tex>Cyclic Codes of Length<tex>$2^e$</tex>
- A linear construction for certain Kerdock and Preparata codes
- Complete Distances of All Negacyclic Codes of Length $2^{s}$ Over $\BBZ _{2^{a}}$
- 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 and Negacyclic Codes Over Finite Chain Rings
- Cyclic codes over \(\mathbb Z_4\) of even length
- Cyclic codes over \(\mathbb{Z}_{4}\) of oddly even length.
- Cyclic codes over \(\text{GR}(p^2,m)\) of length \(p^k\)
- Decoding a class of Lee metric codes over a Galois ring
- Finite Hjelmslev planes
- Fundamentals of Error-Correcting Codes
- Hamming metric decoding of alternant codes over Galois rings
- Kerdock code in a cyclic form
- Negacyclic Codes of Length<tex>$2^s$</tex>Over Galois Rings
- Negacyclic codes over Z/sub 4/ of even length
- On constacyclic codes over finite chain rings
- On cyclic MDS codes of length q over GF(q) (Corresp.)
- On repeated-root cyclic codes
- On some classes of repeated-root constacyclic codes of length a power of 2 over Galois rings
- On the algebraic structure of quasi-cyclic codes. IV: Repeated roots
- On the generators of Z/sub 4/ cyclic codes of length 2/sup e/
- On the linear ordering of some classes of negacyclic and cyclic codes and their distance distributions
- On the structure of linear and cyclic codes over a finite chain ring
- Polynomial weights and code constructions
- Repeated-root constacyclic codes of prime power length over \(\frac{\mathbb{F}_{p^m} [u]}{\langle u^a \rangle}\) and their duals
- Repeated-root cyclic and negacyclic codes over a finite chain ring
- Repeated-root cyclic codes
- Semisimple cyclic and Abelian codes. II
- Structure of repeated-root constacyclic codes of length \(3p^s\) and their duals
- The Z/sub 4/-linearity of Kerdock, Preparata, Goethals, and related codes
Cited in
(30)- Self-dual constacyclic codes of length \(2^s\) over the ring \(\mathbb{F}_{2^m}[u,v]/\langle u^2, v^2, uv-vu \rangle \)
- 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 \)
- Self-reciprocal and self-conjugate-reciprocal irreducible factors of \(x^n - \lambda\) and their applications
- Roulette games and depths of words over finite commutative rings
- Construction of optimal codes from a class of constacyclic codes
- Repeated-root cyclic and negacyclic codes over a finite chain ring
- On self-dual constacyclic codes of length \(p^s\) over \(\mathbb{F}_{p^m} + u \mathbb{F}_{p^m}\)
- On the classification of ideals over \(R[X]/\langle f(X)^{p^s}\rangle\) when \(R=\mathbb{F}_{p^m}+u\mathbb{F}_{p^m}+\cdots+u^n\mathbb{F}_{p^m}\)
- On repeated-root multivariable codes over a finite chain ring
- Quantum MDS and synchronizable codes from cyclic codes of length \(5p^s\) over \(\mathbb{F}_{p^m}\)
- LCP of constacyclic codes over finite chain rings
- On repeated-root constacyclic codes of prime power length over polynomial residue rings
- Optimal constructions of quantum and synchronizable codes from repeated-root cyclic codes of length \(3p^s\)
- On the depth spectrum of repeated-root constacyclic codes over finite chain rings
- Complete classification of repeated-root \(\sigma\)-constacyclic codes of prime power length over \(\mathbb{F}_{p^m} [ u ] \slash \langle u^3 \rangle \)
- On constacyclic codes over two classes of rings
- Repeated-root constacyclic codes of arbitrary lengths over the Galois ring GR(p2,m)
- Repeated-root constacyclic codes over \(\mathbb{F}_3+u\mathbb{F}_3+v\mathbb{F}_3+uv\mathbb{F}_3\)
- MDS symbol-pair repeated-root constacylic codes of prime power lengths over \(\mathbb{F}_q+ u\mathbb{F}_q + u^2\mathbb{F}_q\)
- Lee distance distribution of repeated-root constacyclic codes over \(\mathrm{GR}(2^e,m)\) and related MDS codes
- Explicit constructions of cyclic and negacyclic codes of length \(3 p^s\) over \(\mathbb{F}_{p^m}+u \mathbb{F}_{p^m} \)
- Repeated-root cyclic and negacyclic codes of prime power lengths with a finite commutative chain ring alphabet
- Maximum distance separable repeated-root constacyclic codes over \(\mathbb{F}_{2^m}+u\mathbb{F}_{2^m}\) with respect to the Lee distance
- Repeated-root constacyclic codes of length \(2p^s\) over \(\mathbb{F}_{p^m}+u\mathbb{F}_{p^m}+u^2\mathbb{F}_{p^m} \)
- Repeated-root constacyclic codes of prime power length over \(\frac{\mathbb{F}_{p^m} [u]}{\langle u^a \rangle}\) and their duals
- The structure of constacyclic codes of length \(2p^s\) over finite chain ring
- Repeated-root constacyclic codes of prime power length
- Symbol-pair distance of some repeated-root constacyclic codes of length \(p^s\) over the Galois ring \(\mathrm{GR}(p^a, m)\)
- Symbol-triple distance of repeated-root constacyclic codes of prime power lengths
- Constacyclic codes over finite commutative chain rings
This page was built for publication: Repeated-root constacyclic codes of prime power lengths over finite chain rings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q346276)
