Construction and enumeration for self-dual cyclic codes of even length over \mathbb{F}_{2ᵐ} + u\mathbb{F}_{2ᵐ}

DOI10.1016/J.FFA.2019.101598arXiv1907.07111MaRDI QIDQ6322196FDOQ6322196

Authors: Yuan Cao, Yonglin Cao, Hai Quang Dinh, Fangwei Fu, Fanghui Ma

Publication date: 14 July 2019

Abstract: Let

m a t h b b F_{2^{m}}

be a finite field of cardinality

2^{m}

,

R = m a t h b b F_{2^{m}} + u m a t h b b F_{2^{m}}

(u^{2} = 0)

and

s, n

be positive integers such that

n

is odd. In this paper, we give an explicit representation for every self-dual cyclic code over the finite chain ring

R

of length

2^{s} n

and provide a calculation method to obtain all distinct codes. Moreover, we obtain a clear formula to count the number of all these self-dual cyclic codes. As an application, self-dual and

2

-quasi-cyclic codes over

m a t h b b F_{2^{m}}

of length

2^{s + 1} n

can be obtained from self-dual cyclic code over

R

of length

2^{s} n

and by a Gray map preserving orthogonality and distances from

R

onto

m a t h b b F_{2^{m}}^{2}

.

Mathematics Subject Classification ID

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

This page was built for publication: Construction and enumeration for self-dual cyclic codes of even length over $\mathbb{F}_{2^m} + u\mathbb{F}_{2^m}$

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