Results 21 to 30 of about 1,030 (123)
Some Results on Images of a Class of λ-Constacyclic Codes Over Finite Fields
IEEE Access, 2020 In this paper, we show that any λ-constacyclic code over Fqm is a λ-constacyclic code over Fq under some special maps. Moreover, we show that the images of these λ_constacyclic codes can be put into the concatenated form.
Jian Gao, Juan Li, Yongkang Wang
doaj +1 more source
IEEE Access, 2022 In this paper, we introduce a new design method of burst error control codes (BECCs), which can correct single burst error or two random bit errors by using the maximum likelihood syndrome decoder (MLSD), where the proposed BECCs are designed by a ...
Chanki Kim, Jae-Won Kim, Jong-Seon No
doaj +1 more source
IEEE Access, 2020 Let F2(m) be a finite field of 2m elements, λ and k be integers satisfying λ, k ≥ 2 and denote R = F2(m)[u]/(u2λ). Let δ, α ∈ F2(m)×.
Yuan Cao +4 more
doaj +1 more source
Hamming Distance of Constacyclic Codes of Length
IEEE Access, 2021 Let $p$ be any prime, $s$ and $m$ be positive integers. In this paper, we completely determine the Hamming distance of all constacyclic codes of length $p^s$ over the finite commutative chain ring $\mathbb {F}_{p^m}+ u\mathbb {F}_{p^m} + u^{2 ...
Hai Q. Dinh +3 more
doaj +1 more source
On the Hamming Distances of Constacyclic Codes of Length 5
IEEE Access, 2020 Let $p$ be a prime, $s$ , $m$ be positive integers, and $\lambda $ be a nonzero element of the finite field $\mathbb {F}_{p^{m}}$ . In this paper, the algebraic structures of constacyclic codes of length $5~p^{s}~(p\neq 5)$ are obtained, which ...
Hai Q. Dinh +2 more
doaj +1 more source
On Symbol-Pair Distance of a Class of Constacyclic Codes of Length 3ps over
Axioms, 2023 Let p≠3 be any prime. In this paper, we compute symbol-pair distance of all γ-constacyclic codes of length 3ps over the finite commutative chain ring R=Fpm+uFpm, where γ is a unit of R which is not a cube in Fpm.
Hai Q. Dinh +2 more
doaj +1 more source
Constacyclic codes over finite fields
Finite Fields and Their Applications, 2012 An equivalence relation called isometry is introduced to classify constacyclic codes over a finite field; the polynomial generators of constacyclic codes of length $\ell^tp^s$ are characterized, where $p$ is the characteristic of the finite field and $\ell$ is a prime different from $p$.
Chen, Bocong +3 more
openaire +3 more sources
Skew Constacyclic Codes over Finite Fields and Finite Chain Rings
Mathematical Problems in Engineering, Volume 2016, Issue 1, 2016., 2016 This paper overviews the study of skew Θ‐λ‐constacyclic codes over finite fields and finite commutative chain rings. The structure of skew Θ‐λ‐constacyclic codes and their duals are provided. Among other results, we also consider the Euclidean and Hermitian dual codes of skew Θ‐cyclic and skew Θ‐negacyclic codes over finite chain rings in general and ...
Hai Q. Dinh +3 more
wiley +1 more source
Hermitian Self‐Orthogonal Constacyclic Codes over Finite Fields
Journal of Discrete Mathematics, Volume 2014, Issue 1, 2014., 2014 Necessary and sufficient conditions for the existence of Hermitian self‐orthogonal constacyclic codes of length n over a finite field Fq2, n coprime to q, are found. The defining sets and corresponding generator polynomials of these codes are also characterised. A formula for the number of Hermitian self‐orthogonal constacyclic codes of length n over a
Amita Sahni +2 more
wiley +1 more source
The Depth Distribution of Constacyclic Codes Over
IEEE Access, 2018 The depth distribution of a linear code was put forward by Etzion as a new characterization for linear codes. The previously known results pay close attention to the depth distribution of the linear codes over chain rings.
Guanghui Zhang
doaj +1 more source