Lee distance of cyclic and \((1 + u\gamma)\)-constacyclic codes of length \(2^s\) over \(\mathbb{F}_{2^m} + u \mathbb{F}_{2^m} \) (Q1981674)
From MaRDI portal
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Lee distance of cyclic and \((1 + u\gamma)\)-constacyclic codes of length \(2^s\) over \(\mathbb{F}_{2^m} + u \mathbb{F}_{2^m} \) |
scientific article |
Statements
Lee distance of cyclic and \((1 + u\gamma)\)-constacyclic codes of length \(2^s\) over \(\mathbb{F}_{2^m} + u \mathbb{F}_{2^m} \) (English)
0 references
6 September 2021
0 references
A \(\lambda\)-constacyclic code over a ring \(R\), is a linear code where \((c_o,c_1,\dots,c_{n-1}) \in C\) implies that \((\lambda c_n,c_0,c_1,\dots,c_{n-1}) \in C.\) If \(\lambda=1\) the code is said to be cyclic. The authors determine the Lee distance of all cyclic and \((1+u \gamma)\)-constacyclic codes of length \(2^s\) over the ring \(\mathbb{F}_{2^m} + u \mathbb{F}_{2^m}\), where \(\gamma\) is a non-zero element of \(\mathbb{F}_{2^m} \). Further, they prove that the Lee distance of such codes is independent of the choice of the trace orthogonal basis of the field \(\mathbb{F}_{2^m}\).
0 references
Lee distance
0 references
cyclic codes
0 references
constacyclic codes
0 references
repeated-root codes
0 references
finite chain ring
0 references
0 references
0 references
0 references
0 references