Constacyclic codes of length \(np^s\) over \(\mathbb{F}_{p^m}+u\mathbb{F}_{p^m}\)

From MaRDI portal
Publication:1783723

DOI10.3934/AMC.2018016zbMath1414.94933arXiv1512.01406OpenAlexW2794674644MaRDI QIDQ1783723

Jian Gao, Songsak Sriboonchitta, Fang-Wei Fu, Yuan Cao, Hai Quang Dinh, Yong-Lin Cao

Publication date: 21 September 2018

Published in: Advances in Mathematics of Communications (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1512.01406




Related Items (23)

Type 2 constacyclic codes over \(\mathbb{F}_{2^m} [u \slash \langle u^3 \rangle\) of oddly even length] ⋮ Matrix-product structure of constacyclic codes over finite chain rings \(\mathbb{F}_{p^m}[u/\langle u^e\rangle\)] ⋮ A class of repeated-root constacyclic codes over \(\mathbb{F}_{p^m} [u / \langle u^e \rangle\) of type 2] ⋮ RT distances and Hamming distances of constacyclic codes of length \(8p^s\) over \(\mathbb{F}_{p^m}+u\mathbb{F}_{p^m}\)Constacyclic codes of length \((p^r,p^s)\) over mixed alphabetsConstacyclic codes of length \(8p^s\) over \(\mathbb{F}_{p^m} + u\mathbb{F}_{p^m}\)On \(\mathbb{F}_2 RS\)-cyclic codes and their applications in constructing optimal codesAn explicit expression for Euclidean self-dual cyclic codes over \(\mathbb{F}_{2^m} + u \mathbb{F}_{2^m}\) of length \(2^s\)An efficient method to construct self-dual cyclic codes of length \(p^s\) over \(\mathbb{F}_{p^m} + u \mathbb{F}_{p^m} \)On Hamming distance distributions of repeated-root constacyclic codes of length \(3p^s\) over \(\mathbb{F}_{p^m} + u \mathbb{F}_{p^m}\)An explicit representation and enumeration for self-dual cyclic codes over \(\mathbb{F}_{2^m}+u\mathbb{F}_{2^m}\) of length \(2^s\)Optimal constructions of quantum and synchronizable codes from repeated-root cyclic codes of length \(3p^s\)On a class of skew constacyclic codes over mixed alphabets and applications in constructing optimal and quantum codesMDS constacyclic codes of prime power lengths over finite fields and construction of quantum MDS codesMDS 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 skew cyclic codes and application in quantum codes constructionA class of linear codes of length 2 over finite chain ringsNon-invertible-element constacyclic codes over finite PIRsAn explicit representation and enumeration for negacyclic codes of length \(2^kn\) over \(\mathbb{Z}_4+u\mathbb{Z}_4\)Construction and enumeration for self-dual cyclic codes of even length over \(\mathbb{F}_{2^m} + u \mathbb{F}_{2^m} \)The dual code of any \((\delta + \alpha u^2)\)-constacyclic code over \(\mathbb{F}_{2^m} [u \slash \langle u^4 \rangle\) of oddly even length] ⋮ Hamming distance of repeated-root constacyclic codes of length \(2p^s\) over \({\mathbb{F}}_{p^m}+u{\mathbb{F}}_{p^m} \)Explicit constructions of cyclic and negacyclic codes of length 3ps over 𝔽pm + u𝔽pm




Cites Work




This page was built for publication: Constacyclic codes of length \(np^s\) over \(\mathbb{F}_{p^m}+u\mathbb{F}_{p^m}\)