Constacyclic codes of length \(8p^s\) over \(\mathbb{F}_{p^m} + u\mathbb{F}_{p^m}\)
From MaRDI portal
Publication:2158236
DOI10.3934/amc.2020123zbMath1497.94172OpenAlexW3120806416MaRDI QIDQ2158236
Bac T. Nguyen, Paravee Maneejuk, Hai Quang Dinh
Publication date: 26 July 2022
Published in: Advances in Mathematics of Communications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3934/amc.2020123
Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Linear codes (general theory) (94B05) Cyclic codes (94B15)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Quasi-twisted codes with constacyclic constituent codes
- A class of optimal \(p\)-ary codes from one-weight codes over \(\mathbb F_p[u/\langle u^m\rangle\)]
- Negacyclic codes of length \(2p^s\) over \(\mathbb{F}_{p^m} + u \mathbb{F}_{p^m}\)
- On constacyclic codes of length \(4p^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}\)
- Repeated-root constacyclic codes of length
- Constacyclic codes over finite fields
- Finite Hjelmslev planes
- Constacyclic codes of length \(2p^{s}\) over \(\mathbb{F}_{p^m} + u \mathbb{F}_{p^m}\)
- Type II codes over \(\mathbb F_2+ u\mathbb F_2\) and applications to Hermitian modular forms
- A class of repeated-root constacyclic codes over \(\mathbb{F}_{p^m} [u / \langle u^e \rangle\) of type 2]
- On self-dual constacyclic codes of length \(p^s\) over \(\mathbb{F}_{p^m} + u \mathbb{F}_{p^m}\)
- Negacyclic codes of length \(4 p^s\) over \(\mathbb{F}_{p^m} + u \mathbb{F}_{p^m}\) and their duals
- Repeated-root constacyclic codes over \(\mathbb{F}_2 + u \mathbb{F}_2 + v \mathbb{F}_2 + u v \mathbb{F}_2\)
- Constacyclic codes of length \(np^s\) over \(\mathbb{F}_{p^m}+u\mathbb{F}_{p^m}\)
- Cyclic codes over \(\mathbb{Z}_{4}\) of oddly even length.
- Structure of repeated-root constacyclic codes of length \(3p^s\) and their duals
- An explicit representation and enumeration for negacyclic codes of length \(2^kn\) over \(\mathbb{Z}_4+u\mathbb{Z}_4\)
- An efficient method to construct self-dual cyclic codes of length \(p^s\) over \(\mathbb{F}_{p^m} + u \mathbb{F}_{p^m} \)
- Construction and enumeration for self-dual cyclic codes of even length over \(\mathbb{F}_{2^m} + u \mathbb{F}_{2^m} \)
- On matrix-product structure of repeated-root constacyclic codes over finite fields
- Repeated-root constacyclic codes of length \(k\ell p^s\)
- Explicit factorization of \(x^{2^ k}+1\) over \(F_ p\) with prime \(p\equiv 3\bmod 4\)
- An explicit representation and enumeration for self-dual cyclic codes over \(\mathbb{F}_{2^m}+u\mathbb{F}_{2^m}\) of length \(2^s\)
- Repeated-root cyclic and negacyclic codes over a finite chain ring
- A class of linear codes of length 2 over finite chain rings
- On the generators of Z/sub 4/ cyclic codes of length 2/sup e/
- Negacyclic Codes of Length<tex>$2^s$</tex>Over Galois Rings
- Cyclic and Negacyclic Codes Over Finite Chain Rings
- On cyclic MDS codes of length q over GF(q) (Corresp.)
- Semisimple cyclic and Abelian codes. II
- The Z/sub 4/-linearity of Kerdock, Preparata, Goethals, and related codes
- Decoding of cyclic codes over F/sub 2/+uF/sub 2/
- Negacyclic and cyclic codes over Z/sub 4/
- Negacyclic codes over Z/sub 4/ of even length
- Weight distributions of cyclic self-dual codes
- Cyclic codes and self-dual codes over F/sub 2/+uF/sub 2/
- Constacyclic Codes of Length $2^s$ Over Galois Extension Rings of ${\BBF}_{2}+u{\BBF}_2$
- Polynomial weights and code constructions
- On repeated-root cyclic codes
- Repeated-root cyclic codes
This page was built for publication: Constacyclic codes of length \(8p^s\) over \(\mathbb{F}_{p^m} + u\mathbb{F}_{p^m}\)
