Repeated-root constacyclic codes of length 2p^s over F_p^m+uF_p^m+u^2F_p^m
DOI10.1007/S12095-020-00450-2zbMATH Open1469.94158OpenAlexW3047890688MaRDI QIDQ2040331FDOQ2040331
Chakkrid Klin-eam, Wateekorn Sriwirach
Publication date: 13 July 2021
Published in: Cryptography and Communications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s12095-020-00450-2
Recommendations
- Constacyclic codes of length \(2p^{s}\) over \(\mathbb{F}_{p^m} + u \mathbb{F}_{p^m}\)
- Some classes of repeated-root constacyclic codes over \(\mathbb F_{p^m}+u\mathbb F_{p^m}+u^2\mathbb F_{p^m}\)
- Repeated-root constacyclic codes of prime power lengths over finite chain rings
- Repeated-root constacyclic codes over \(\mathbb{F}_3+u\mathbb{F}_3+v\mathbb{F}_3+uv\mathbb{F}_3\)
- The structure of constacyclic codes of length \(2p^s\) over finite chain ring
Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Linear codes (general theory) (94B05) Cyclic codes (94B15)
Cites Work
- Title not available (Why is that?)
- Some classes of repeated-root constacyclic codes over \(\mathbb F_{p^m}+u\mathbb F_{p^m}+u^2\mathbb F_{p^m}\)
- Cyclic and Negacyclic Codes Over Finite Chain Rings
- On cyclic MDS codes of length q over GF(q) (Corresp.)
- Title not available (Why is that?)
- Title not available (Why is that?)
- A linear construction for certain Kerdock and Preparata codes
- The Z/sub 4/-linearity of Kerdock, Preparata, Goethals, and related codes
- A note on the q-ary image of a q/sup m/-ary repeated-root cyclic code
- Fundamentals of Error-Correcting Codes
- Weight distributions of cyclic self-dual codes
- Constacyclic Codes of Length $2^s$ Over Galois Extension Rings of ${\BBF}_{2}+u{\BBF}_2$
- Title not available (Why is that?)
- Polynomial weights and code constructions
- Title not available (Why is that?)
- On repeated-root cyclic codes
- Repeated-root cyclic codes
- Constacyclic codes of length \(p^s\) over \(\mathbb F_{p^m} + u\mathbb F_{p^m}\)
- Repeated-root constacyclic codes of length
- On the structure of linear and cyclic codes over a finite chain ring
- Cyclic codes over \(\mathbb{Z}_{4}\) of oddly even length.
- Cyclic codes over \(\mathbb Z_4\) of even length
- On the generators of Z/sub 4/ cyclic codes of length 2/sup e/
- Repeated-root cyclic and negacyclic codes over a finite chain ring
- 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}\)
Cited In (7)
- Repeated-root constacyclic codes of prime power length over \(\frac{\mathbb{F}_{p^m} [u]}{\langle u^a \rangle}\) and their duals
- Repeated-root constacyclic codes of length $2p^s$ over Galois rings
- Complete classification of negacyclic codes of length \(3p^s\) over \(\mathbb{F}_{p^m}+u \mathbb{F}_{p^m}+ u^2 \mathbb{F}_{p^m} \)
- Complete classification of cyclic codes of length 3ps over đ˝pm + uđ˝pm + u2đ˝pm
- Repeated-root constacyclic codes of arbitrary lengths over the Galois ring GR(p2,m)
- MDS symbol-pair repeated-root constacylic codes of prime power lengths over \(\mathbb{F}_q+ u\mathbb{F}_q + u^2\mathbb{F}_q\)
- Structure of some classes of repeated-root constacyclic codes over integers modulo \(2^m\)
This page was built for publication: Repeated-root constacyclic codes of length \(2p^s\) over \(\mathbb{F}_{p^m}+u\mathbb{F}_{p^m}+u^2\mathbb{F}_{p^m} \)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2040331)