Enumeration of self-dual cyclic codes of some specific lengths over finite fields

DOI10.1142/S1793830918500313MaRDI QIDQ4554561zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Supawadee Prugsapitak, Somphong Jitman

Publication date 14 November 2018

Published in Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)

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

zbMATH Keywords

cyclic codesenumerationself-dual codes

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Cyclic codes (94B15)

Abstract: Self-dual cyclic codes form an important class of linear codes. It has been shown that there exists a self-dual cyclic code of length $n$ over a finite field if and only if $n$ and the field characteristic are even. The enumeration of such codes has been given under both the Euclidean and Hermitian products. However, in each case, the formula for self-dual cyclic codes of length $n$ over a finite field contains a characteristic function which is not easily computed. In this paper, we focus on more efficient ways to enumerate self-dual cyclic codes of lengths $2^u{p}^r$ and $2^u{p}^r{q}^s$, where $u$, $r$, and $s$ are positive integers. Some number theoretical tools are established. Based on these results, alternative formulas and efficient algorithms to determine the number of self-dual cyclic codes of such lengths are provided.

Recommendations

• Enumeration of self-dual and self-orthogonal negacyclic codes over finite fields
• On the construction of self-dual cyclic codes over \(\mathbb{Z}_4\) with arbitrary even length
• An explicit representation and enumeration for 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} \)
• Enumeration formulas for self-dual cyclic codes

Cites work

• Elementary Methods in Number Theory
• Enumeration formulas for self-dual cyclic codes
• Hermitian Self-Dual Abelian Codes
• On cyclic self-dual codes
• On Self-Dual Cyclic Codes Over Finite Fields
• On the divisors of a^k + b^k
• Repeated-root constacyclic codes of length \(\ell p^s\) and their duals
• Self-dual codes and invariant theory
• The average dimension of the hull of cyclic codes.

Cited in

(3)

• Enumeration formulae for self-dual, self-orthogonal and complementary-dual quasi-cyclic codes over finite fields
• SRIM and SCRIM factors of \(x^n+1\) over finite fields and their applications
• Enumeration of self-dual and self-orthogonal negacyclic codes over finite fields

This page was built for publication: Enumeration of self-dual cyclic codes of some specific lengths over finite fields

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