Repeated-root constacyclic codes of length \(\ell^{t}p^{s}\) and their dual codes
From MaRDI portal
Publication:892297
DOI10.1007/s12095-014-0106-5zbMath1344.94095OpenAlexW2472681438MaRDI QIDQ892297
Publication date: 18 November 2015
Published in: Cryptography and Communications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s12095-014-0106-5
Related Items (10)
Repeated-root constacyclic codes of length \(n l p^s\) ⋮ Repeated-root constacyclic codes of length \(4\ell^{m}p^{n}\) ⋮ On constacyclic codes over finite fields ⋮ Repeated-root constacyclic codes of length \(3lp^s\) and their dual codes ⋮ Repeated-root two-dimensional constacyclic codes of length \(2p^s\cdot 2^k\) ⋮ Repeated-root constacyclic codes of length \(6l^mp^n\) ⋮ The minimum Hamming distances of repeated-root cyclic codes of length \(6p^s\) and their MDS codes ⋮ Repeated-root constacyclic codes of length \(k\ell p^s\) ⋮ Structure of repeated-root constacyclic codes of length 8ℓmpn ⋮ The Hamming distances of repeated-root cyclic codes of length \(5 p^s\)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- 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
- A class of constacyclic codes over a finite field
- Negacyclic duadic codes
- Self-dual and self-orthogonal negacyclic codes of length \(2p^n\) over a finite field
- Structure of repeated-root constacyclic codes of length \(3p^s\) and their duals
- On Self-Dual Cyclic Codes Over Finite Fields
This page was built for publication: Repeated-root constacyclic codes of length \(\ell^{t}p^{s}\) and their dual codes
