Repeated-root constacyclic codes of length 3lp^s and their dual codes

DOI10.1016/J.FFA.2016.08.005zbMATH Open1372.94463arXiv1601.01421OpenAlexW2228651896MaRDI QIDQ324296FDOQ324296

Xiaoshan Kai, Lanqiang Li, Li Liu, Shixin Zhu

Publication date: 10 October 2016

Published in: Finite Fields and their Applications (Search for Journal in Brave)

Abstract: Let $peq3$ be any prime and $leq3$ be any odd prime with $gcd(p,l)=1$. $F_q^{*}=langlexiangle$ is decomposed into mutually disjoint union of $gcd(q-1,3l{p}^s)$ coset over the subgroup $langlex{i}^{3l{p}^s}angle$, where $xi$ is a primitive $(q-1)$th root of unity. We classify all repeated-root constacyclic codes of length $3l{p}^s$ over the finite field $F_q$ into some equivalence classes by the decomposition, where $q=p^m$, $s$ and $m$ are positive integers. According to the equivalence classes, we explicitly determine the generator polynomials of all repeated-root constacyclic codes of length $3l{p}^s$ over $F_q$ and their dual codes. Self-dual cyclic(negacyclic) codes of length $3l{p}^s$ over $F_q$ exist only when $p=2$. And we give all self-dual cyclic(negacyclic) codes of length $3l{2}^s$over $F_{2^m}$ and its enumeration.

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

Recommendations

• Structure of repeated-root constacyclic codes of length \(3p^s\) and their duals
• Repeated-root constacyclic codes of length \(4\ell^{m}p^{n}\)
• Repeated-root constacyclic codes of length \(n l p^s\)
• Repeated-root constacyclic codes of length \(3 \ell^m p^s\)
• Repeated-root constacyclic codes of length \(k\ell p^s\)

zbMATH Keywords

Hamming distancecyclic codesdual codesgenerator polynomialrepeated-root constacyclic codes

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Linear codes (general theory) (94B05) Cyclic codes (94B15)

Cites Work

• Title not available (Why is that?)
• 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 \(\ell^{t}p^{s}\) and their dual codes
• Repeated-root constacyclic codes of length \(2 \ell^m p^n\)
• Title not available (Why is that?)
• Title not available (Why is that?)
• On Self-Dual Cyclic Codes Over Finite Fields
• Constacyclic codes over finite fields
• A class of constacyclic codes over a finite field
• On constacyclic codes over finite fields
• A class of constacyclic codes over a finite field. II
• 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)\)
• The Minimum Hamming Distance of Cyclic Codes of Length 2p s
• On cyclic self-dual codes

Cited In (19)

• 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\)
• Self-reciprocal and self-conjugate-reciprocal irreducible factors of \(x^n - \lambda\) and their applications
• Repeated-root constacyclic codes of length \(3 \ell^m p^s\)
• On constacyclic codes of length \(9 p^s\) over \(\mathbb{F}_{p^m}\) and their optimal codes
• 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 \(6l^mp^n\)
• Repeated-root constacyclic codes of length \(6lp^s\)
• Structure of repeated-root constacyclic codes of length 8ℓmpn
• The minimum Hamming distances of repeated-root cyclic codes of length \(6p^s\) and their MDS codes
• The Hamming distances of repeated-root cyclic codes of length \(5 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}\)
• 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}\)
• Optimal constructions of quantum and synchronizable codes from repeated-root cyclic codes of length \(3p^s\)
• 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
• 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}\)

This page was built for publication: Repeated-root constacyclic codes of length \(3lp^s\) and their dual codes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q324296)