Repeated-root constacyclic codes of length 3 ^m p^s
From MaRDI portal
Publication:2176299
DOI10.3934/AMC.2020025zbMATH Open1437.94093OpenAlexW2972076795MaRDI QIDQ2176299FDOQ2176299
Hai Quang Dinh, Songsak Sriboonchitta, Minjia Shi, Yan Liu
Publication date: 4 May 2020
Published in: Advances in Mathematics of Communications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3934/amc.2020025
Recommendations
- Repeated-root constacyclic codes of length \(2 \ell^m p^n\)
- Repeated-root constacyclic codes of length \(k\ell p^s\)
- Repeated-root constacyclic codes of length \(n l p^s\)
- Repeated-root constacyclic codes of length \(3lp^s\) and their dual codes
- Structure of repeated-root constacyclic codes of length \(3p^s\) and their duals
Cites Work
- Title not available (Why is that?)
- Linear codes with complementary duals
- Structure of repeated-root constacyclic codes of length \(3p^s\) and their duals
- On the linear ordering of some classes of negacyclic and cyclic codes and their distance distributions
- Repeated-root constacyclic codes of length \(\ell p^s\) and their duals
- On repeated-root cyclic codes
- Repeated-root cyclic codes
- Constacyclic codes of length \(p^s\) over \(\mathbb F_{p^m} + u\mathbb F_{p^m}\)
- Repeated-root constacyclic codes of length
- Title not available (Why is that?)
- A class of minimal cyclic codes over finite fields
- A class of constacyclic codes over a finite field
- Self-dual and self-orthogonal negacyclic codes of length \(2p^n\) over a finite field
- Complete weight enumerators of a class of linear codes
- On the distances of cyclic codes of length \(2^e\) over \(\mathbb Z_4\)
- Cyclotomic numbers and primitive idempotents in the ring \(\mathrm{GF}(q)[x]/(x^{p^n} - 1)\)
- Repeated-root constacyclic codes of length \(3lp^s\) and their dual codes
- The weight enumerator of the duals of a class of cyclic codes with three zeros
- Repeated-root constacyclic codes of length \(kl^{a}p^{b}\) over a finite field
- The weight distributions of two classes of \(p\)-ary cyclic codes with few weights
- A construction of linear codes and their complete weight enumerators
Cited In (10)
- Repeated-root constacyclic codes of length
- Repeated-root constacyclic codes of length \(n l p^s\)
- Repeated-root constacyclic codes of length \(6l^mp^n\)
- Quantum codes from repeated-root cyclic and negacyclic codes of length \(4p^s\) over \(\mathbb{F}_{p^m} \)
- Constacyclic codes of length \((p^r,p^s)\) over mixed alphabets
- A class of skew cyclic codes and application in quantum codes construction
- Quantum codes from a class of constacyclic codes over finite commutative rings
- On \(\mathbb{F}_2 RS\)-cyclic codes and their applications in constructing optimal codes
- 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\)
This page was built for publication: Repeated-root constacyclic codes of length \(3 \ell^m p^s\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2176299)
