Repeated-root constacyclic codes of arbitrary lengths over the Galois ring GR(p2,m)
From MaRDI portal
Publication:4554567
DOI10.1142/S1793830918500362zbMATH Open1398.94231OpenAlexW2806119675MaRDI QIDQ4554567FDOQ4554567
Authors: Anuradha Sharma, Tania Sidana 
Publication date: 14 November 2018
Published in: Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s1793830918500362
Recommendations
- Repeated-root constacyclic codes of length $2p^s$ over Galois rings
- Some Repeated-Root Constacyclic Codes Over Galois Rings
- On some classes of repeated-root constacyclic codes of length a power of 2 over Galois rings
- Repeated-root constacyclic codes of length \(2^s\) over \(\mathbb Z_{2^a}\)
- Repeated-root constacyclic codes of length \(2 \ell^m p^n\)
- Repeated-root constacyclic codes of length \(2p^s\) over \(\mathbb{F}_{p^m}+u\mathbb{F}_{p^m}+u^2\mathbb{F}_{p^m} \)
- Polycyclic codes over Galois rings with applications to repeated-root constacyclic codes
- Repeated root cyclic and negacyclic codes over Galois rings
- Repeated-root constacyclic codes of length \(kl^{a}p^{b}\) over a finite field
- On structure and distances of some classes of repeated-root constacyclic codes over Galois rings
Cites Work
- Title not available (Why is that?)
- Algebraic coding theory
- Repeated-root constacyclic codes of prime power lengths over finite chain rings
- Negacyclic Codes of Length<tex>$2^s$</tex>Over Galois Rings
- Cyclic and Negacyclic Codes Over Finite Chain Rings
- A linear construction for certain Kerdock and Preparata codes
- The Z/sub 4/-linearity of Kerdock, Preparata, Goethals, and related codes
- Constacyclic codes of length \(p^s\) over \(\mathbb F_{p^m} + u\mathbb F_{p^m}\)
- On the structure of linear and cyclic codes over a finite chain ring
- Kerdock code in a cyclic form
- Some constacyclic codes over finite chain rings
- On the generators of Z/sub 4/ cyclic codes of length 2/sup e/
- Cyclic codes over \(\text{GR}(p^2,m)\) of length \(p^k\)
- Cyclic and negacyclic codes over the Galois ring \(\text{GR}(p^2,m)\)
- Negacyclic codes of length \(2p^s\) over \(\mathbb{F}_{p^m} + u \mathbb{F}_{p^m}\)
- Constacyclic codes of length \(2p^{s}\) over \(\mathbb{F}_{p^m} + u \mathbb{F}_{p^m}\)
- Cyclic and negacyclic codes of length \(4 p^s\) over \(\mathbb{F}_{p^m} + u \mathbb{F}_{p^m}\)
- All \(\alpha+u\beta\)-constacyclic codes of length \(np^s\) over \(\mathbb{F}_{p^m}+u\mathbb{F}_{p^m}\)
- Cyclic and negacyclic codes of length \(2p^s\) over \(\mathbb F_{p^m}+u\mathbb F_{p^m}\)
Cited In (7)
- Repeated-root constacyclic codes of length $2p^s$ over Galois rings
- Negacyclic codes of prime power length over the finite non-commutative chain ring \(\frac{\mathbb{F}_{p^m}[u,\theta]}{\langle u^2\rangle}\)
- Left dihedral codes over Galois rings \(\mathrm{GR}(p^2, m)\)
- Repeated root cyclic and negacyclic codes over Galois rings
- On some classes of repeated-root constacyclic codes of length a power of 2 over Galois rings
- Polycyclic codes over Galois rings with applications to repeated-root constacyclic codes
- The Galois variance of constacyclic codes
This page was built for publication: Repeated-root constacyclic codes of arbitrary lengths over the Galois ring GR(p2,m)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4554567)
