Results 31 to 40 of about 2,432,274 (184)

Constacyclic Codes of Length 3p^s Over F_p^m + uF_p^m and Their Application in Various Distance Distributions

IEEE Access, 2020
Let p ≠ 3 be any prime. The structures of all λ-constacyclic codes of length 3ps over the finite commutative chain ring Fpm + uFpm (u2 = 0) are established in the term of their generator polynomials.
Hai Q. Dinh, Bac Trong Nguyen, Woraphon Yamaka   +2 more
doaj   +1 more source

On a Family of Quantum Synchronizable Codes Based on the $(\lambda(u + v)|u - v)$ Construction

IEEE Access, 2020
In this paper, we propose a family of quantum synchronizable codes from repeated-root cyclic codes and constacyclic codes. This family of quantum synchronizable codes are based on (λ(u + v)|u - v) construction which is constructed from ...
Chao Du, Zhi Ma, Lan Luo, Dakang Huang, Hong Wang   +4 more
doaj   +1 more source

b-Symbol Distance of Constacylic Codes of Length p^s Over F_p^m + uF_p^m

IEEE Access, 2020
In this research paper, the repeated-root constacyclic codes over the chain ring Fpm + uFpm are considered, where p is a prime and m > 0 is any integer. The b-symbol distance for prime power length, i.e.
H. Q. Dinh, Atul Gaur, A. K. Singh, Manoj Kumar Singh, W. Yamaka   +4 more
doaj   +1 more source

MDS Symbol-Pair Repeated-Root Constacylic Codes of Prime Power Lengths Over $\mathbb F_{p^m}+ u \mathbb F_{p^m}$

IEEE Access, 2019
MDS codes have the highest possible error-detecting and error-correcting capability among codes of given length and size. Let p be any prime, and s, m be positive integers.
H. Q. Dinh, P. Kumam, P. Kumar, S. Satpati, A. K. Singh, W. Yamaka   +5 more
doaj   +1 more source

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

Explicit Representation and Enumeration of Repeated-Root (δ + αu²)-Constacyclic Codes Over F₂^m[u]/‹u^2λ›

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, Yonglin Cao, Hai Q. Dinh, Tushar Bag, Woraphon Yamaka   +4 more
doaj   +1 more source

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, Bac T. Nguyen, Songsak Sriboonchitta, Haipeng Peng   +3 more
wiley   +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, Fan, Yun, Lin, Liren, Liu, Hongwei   +3 more
openaire   +3 more sources

New Design of Error Control Codes Resilient to Single Burst Error or Two Random Bit Errors Using Constacyclic Codes

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

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, Poonam Trama Sehgal, Tamir Tassa   +2 more
wiley   +1 more source