Self-dual and self-orthogonal negacyclic codes of length \(2p^n\) over a finite field
From MaRDI portal
Publication:1931512
DOI10.1016/j.ffa.2012.10.003zbMath1269.94042OpenAlexW2001718971MaRDI QIDQ1931512
Publication date: 14 January 2013
Published in: Finite Fields and their Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ffa.2012.10.003
Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Other types of codes (94B60) Cyclic codes (94B15)
Related Items (14)
A class of constacyclic codes over a finite field. II ⋮ On cyclic and negacyclic codes of length 8ℓmpn over finite field ⋮ Construction and number of self-dual skew codes over \(\mathbb{F}_{p^2}\) ⋮ Repeated-root constacyclic codes of length \(3 \ell^m p^s\) ⋮ Repeated-root constacyclic codes of length \(\ell^{t}p^{s}\) and their dual codes ⋮ Enumeration of self-dual and self-orthogonal negacyclic codes over finite fields ⋮ Construction of quantum negacyclic BCH codes ⋮ Unnamed Item ⋮ Self-dual and self-orthogonal negacyclic codes of length \(2^m p^n\) over a finite field ⋮ Revisiting the factorization of \(x^n+1\) over finite fields with applications ⋮ \((1-2u^{3})\)-constacyclic codes and quadratic residue codes over \(\mathbb {F}_{p}[u/\langle u^{4}-u\rangle \)] ⋮ Repeated-root constacyclic codes of length \(2 \ell^m p^n\) ⋮ Existence conditions for self-orthogonal negacyclic codes over finite fields ⋮ Constacyclic codes of length \(np^s\) over \(\mathbb{F}_{p^m}+u\mathbb{F}_{p^m}\)
This page was built for publication: Self-dual and self-orthogonal negacyclic codes of length \(2p^n\) over a finite field
