On constacyclic codes over finite fields
From MaRDI portal
Publication:301647
DOI10.1007/s12095-015-0163-4zbMath1344.94097OpenAlexW2268838648MaRDI QIDQ301647
Publication date: 1 July 2016
Published in: Cryptography and Communications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s12095-015-0163-4
Related Items (6)
Repeated-root constacyclic codes of length \(n l p^s\) ⋮ A class of constacyclic codes over \({\mathbb{F}}_{p^m}[u/\langle u^2\rangle\)] ⋮ Repeated-root constacyclic codes of length \(3lp^s\) and their dual codes ⋮ The minimum Hamming distances of repeated-root cyclic codes of length \(6p^s\) and their MDS codes ⋮ 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
- Some constacyclic codes over finite chain rings
- Self-dual and self-orthogonal negacyclic codes of length \(2^m p^n\) over a finite field
- 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
- Repeated-root constacyclic codes of length \(\ell^{t}p^{s}\) and their dual codes
- Structure of repeated-root constacyclic codes of length \(3p^s\) and their duals
- Polyadic codes of prime power length
- On the linear ordering of some classes of negacyclic and cyclic codes and their distance distributions
- λ-Mapping and Primitive Idempotents in Semisimple Ring ℜm
- ON REPEATED-ROOT CONSTACYCLIC CODES OF LENGTH 4ps
- SIMPLE-ROOT NEGACYCLIC CODES OF LENGTH 2pnℓmOVER A FINITE FIELD
- Negacyclic Codes of Length<tex>$2^s$</tex>Over Galois Rings
This page was built for publication: On constacyclic codes over finite fields
