Construction of optimal codes from a class of constacyclic codes
From MaRDI portal
Publication:2103114
DOI10.1007/S12190-021-01695-7OpenAlexW4206749592MaRDI QIDQ2103114FDOQ2103114
Authors: Sampurna Satpati, Abhay K. Singh, Hai Quang Dinh 
Publication date: 13 December 2022
Published in: Journal of Applied Mathematics and Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s12190-021-01695-7
Recommendations
- Constacyclic codes of length \(p^s\) over \(\mathbb F_{p^m} + u\mathbb F_{p^m}\)
- On a class of constacyclic codes of length \(2p^s\) over \(\frac{\mathbb{F}_{p^m}[u]}{\langle u^a \rangle}\)
- A class of constacyclic codes over the ring \(\mathbb{F}_{p^m}+u\mathbb{F}_{p^m}+\dotsb +u^{k-1}\mathbb{F}_{p^m}\)
- MDS symbol-pair repeated-root constacylic codes of prime power lengths over \(\mathbb{F}_q+ u\mathbb{F}_q + u^2\mathbb{F}_q\)
- A class of constacyclic MDS codes over \(F_q+uF_q+\cdots+u^{s-1}F_q\)
Cites Work
- On the linear ordering of some classes of negacyclic and cyclic codes and their distance distributions
- Repeated-root constacyclic codes of prime power lengths over finite chain rings
- Semisimple cyclic and Abelian codes. II
- Duality for modules over finite rings and applications to coding theory
- Repeated-root constacyclic codes of prime power length
- 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}\)
- A class of optimal \(p\)-ary codes from one-weight codes over \(\mathbb F_p[u]/\langle u^m\rangle\)
- A class of constacyclic codes over \(\mathbb F_{p}+v\mathbb F_{p}\) and its Gray image
- A family of constacyclic codes over \(\mathbb F_{2} + u\mathbb F_{2} + v\mathbb F_{2} + uv\mathbb F_{2}\)
- \((1+\lambda u)\)-constacyclic codes over \(\mathbb F_{p}[u]/\langle u^m\rangle\)
- Negacyclic self-dual codes over finite chain rings
- On the cyclic codes over \(F_3+vF_3\)
- Cyclic isodual and formally self-dual codes over \(\mathbb F_q+\nu\mathbb F_q\)
- On constacyclic codes of length \(4p^s\) over \(\mathbb{F}_{p^m} +u\mathbb{F}_{p^m}\)
- Constacyclic codes of length \(2p^{s}\) over \(\mathbb{F}_{p^m} + u \mathbb{F}_{p^m}\)
- Two and three weight codes over \(\mathbb {F}_p+u\mathbb {F}_p\)
- A Construction of New MDS Symbol-Pair Codes
- Constacyclic Symbol-Pair Codes: Lower Bounds and Optimal Constructions
- On self-dual negacirculant codes of index two and four
- On the Symbol-Pair Distance of Repeated-Root Constacyclic Codes of Prime Power Lengths
- Maximum distance separable codes for \(b\)-symbol read channels
- Constructions of maximum distance separable symbol-pair codes using cyclic and constacyclic codes
- On the \(b\)-distance of repeated-root constacyclic codes of prime power lengths
Cited In (5)
This page was built for publication: Construction of optimal codes from a class of constacyclic codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2103114)
