Repeated-root constacyclic codes of length 4ᵐp^n
From MaRDI portal
Publication:285476
DOI10.1016/J.FFA.2016.04.001zbMATH Open1344.94096OpenAlexW2345678824MaRDI QIDQ285476FDOQ285476
Authors: Anuradha Sharma, Saroj Rani
Publication date: 19 May 2016
Published in: Finite Fields and their Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ffa.2016.04.001
Recommendations
Cites Work
- Title not available (Why is that?)
- Structure of repeated-root constacyclic codes of length \(3p^s\) and their duals
- Polyadic codes of prime power length
- Algebraic coding theory
- 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}\)
- Repeated-root constacyclic codes of length
- Repeated-root constacyclic codes of length \(\ell^{t}p^{s}\) and their dual codes
- Title not available (Why is that?)
- Repeated-root constacyclic codes of length \(2 \ell^m p^n\)
- Isodual constacyclic codes
- On repeated-root constacyclic codes of length \(4p^s\)
- Repeated-Root Isodual Cyclic Codes over Finite Fields
- Self-dual and self-orthogonal negacyclic codes of length \(2^m p^n\) over a finite field
- Title not available (Why is that?)
- On Self-Dual Cyclic Codes Over Finite Fields
- A class of minimal cyclic codes over finite fields
- Constacyclic codes over finite fields
- A class of constacyclic codes over a finite field
- Negacyclic duadic codes
Cited In (14)
- On the symbol-pair distances of repeated-root constacyclic codes of length \(2 p^s\)
- Structure of some classes of repeated-root constacyclic codes of length \(2^{\mathfrak{K}} \ell^m p^n\)
- Repeated-root constacyclic codes of length
- On constacyclic codes of length \(9 p^s\) over \(\mathbb{F}_{p^m}\) and their optimal codes
- Repeated-root constacyclic codes of length \(n l p^s\)
- Repeated-root constacyclic codes of length \(6l^mp^n\)
- On cyclic and negacyclic codes of length 8ℓmpn over finite field
- Structure of repeated-root constacyclic codes of length 8ℓmpn
- Repeated-root constacyclic codes of length \(k^s l^m p^n\) over finite fields
- Hamming distances of constacyclic codes of length \(7p^s\) over \(\mathbb{F}_{p^m}\)
- Repeated-root two-dimensional constacyclic codes of length \(2p^s\cdot 2^k\)
- 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
- A class of constacyclic codes from group algebras
This page was built for publication: Repeated-root constacyclic codes of length \(4\ell^{m}p^{n}\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q285476)