Repeated-root constacyclic codes of length \(3lp^s\) and their dual codes
From MaRDI portal
Publication:324296
DOI10.1016/j.ffa.2016.08.005zbMath1372.94463arXiv1601.01421OpenAlexW2228651896MaRDI QIDQ324296
Xiaoshan Kai, Lanqiang Li, Shixin Zhu, Li Liu
Publication date: 10 October 2016
Published in: Finite Fields and their Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1601.01421
Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Linear codes (general theory) (94B05) Cyclic codes (94B15)
Related Items (16)
Repeated-root constacyclic codes of length \(n l p^s\) ⋮ Repeated-root constacyclic codes of length \(3 \ell^m p^s\) ⋮ On Hamming distance distributions of repeated-root constacyclic codes of length \(3p^s\) over \(\mathbb{F}_{p^m} + u \mathbb{F}_{p^m}\) ⋮ Optimal constructions of quantum and synchronizable codes from repeated-root cyclic codes of length \(3p^s\) ⋮ Repeated-root constacyclic codes of length \(6l^mp^n\) ⋮ On the Hamming distances of repeated-root constacyclic codes of length \(4p^s\) ⋮ Hamming distances of constacyclic codes of length \(3p^s\) and optimal codes with respect to the Griesmer and Singleton bounds ⋮ Repeated-root constacyclic codes of length \(6lp^s\) ⋮ Self-reciprocal and self-conjugate-reciprocal irreducible factors of \(x^n - \lambda\) and their applications ⋮ The minimum Hamming distances of repeated-root cyclic codes of length \(6p^s\) and their MDS codes ⋮ On Hamming and \(b\)-symbol distance distributions of repeated-root constacyclic codes of length \(4p^s\) over \(\mathbb{F}_{p^m}+u \mathbb{F}_{p^m}\) ⋮ Repeated-root constacyclic codes of length \(k\ell p^s\) ⋮ Structure of repeated-root constacyclic codes of length 8ℓmpn ⋮ On the symbol-pair distances of repeated-root constacyclic codes of length \(2 p^s\) ⋮ The Hamming distances of repeated-root cyclic codes of length \(5 p^s\) ⋮ Structure of some classes of repeated-root constacyclic codes of length \(2^{\mathfrak{K}} \ell^m p^n\)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On constacyclic codes over finite fields
- A class of constacyclic codes over a finite field. II
- Repeated-root constacyclic codes of length \(\ell p^s\) and their duals
- Constacyclic codes of length \(p^s\) over \(\mathbb F_{p^m} + u\mathbb F_{p^m}\)
- Constacyclic codes over finite fields
- On cyclic self-dual codes
- A class of constacyclic codes over a finite field
- Repeated-root constacyclic codes of length \(\ell^{t}p^{s}\) and their dual codes
- On the distances of cyclic codes of length \(2^e\) over \(\mathbb Z_4\)
- Structure of repeated-root constacyclic codes of length \(3p^s\) and their duals
- Repeated-root constacyclic codes of length \(2 \ell^m p^n\)
- On the linear ordering of some classes of negacyclic and cyclic codes and their distance distributions
- Cyclotomic numbers and primitive idempotents in the ring \(\mathrm{GF}(q)[x/(x^{p^n} - 1)\)]
- The Minimum Hamming Distance of Cyclic Codes of Length 2p s
- On Self-Dual Cyclic Codes Over Finite Fields
- On repeated-root cyclic codes
- Repeated-root cyclic codes
This page was built for publication: Repeated-root constacyclic codes of length \(3lp^s\) and their dual codes
