Results 11 to 20 of about 1,807,959 (233)
Non-restrictive MDS Array Codes for Correcting Multiple Column Erasures
Journal of King Saud University: Engineering Sciences, 2004 A new family of MDS array codes of size m × n, that we call Br (m, n, t), for correcting multiple column erasures is proposed. Br(m, n, t) codes achieve the maximum possible correcting capability, i.e., they are MDS codes with dmin = r + 1.
A.M. Al-Shahrani, A.K. Al-Jabri
doaj +1 more source
Hermitian Rank Metric Codes and Duality
IEEE Access, 2021 In this paper we define and study rank metric codes endowed with a Hermitian form. We analyze the duality for $\mathbb {F}_{q^{2}}$ -linear matrix codes in the ambient space $(\mathbb {F}_{q^{2}})_{n,m}$ and for both $\mathbb {F}_{q^{2}}$ -additive ...
Javier De La Cruz +2 more
doaj +1 more source
PLoS ONE, 2019 Code modulated Visual Evoked Potentials (c-VEP) based BCI studies usually employ m-sequences as a modulating codes for their broadband spectrum and correlation property. However, subjective fatigue of the presented codes has been a problem. In this study,
Zahra Shirzhiyan +7 more
doaj +1 more source
Two Families of Optimal Ternary Cyclic Codes With Two Zeros
IEEE Access, 2022 Cyclic codes are an important subclass of linear codes and have wide applications in consumer electronics, data storage systems and communication systems as they have efficient encoding and decoding algorithms.
Jinmei Fan, Binseng Wang
doaj +1 more source
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 +5 more
doaj +1 more source
Subspace Codes Based on Partial Injective Maps of Vector Spaces Over Finite Fields
IEEE Access, 2020 Subspace codes are widely used in error corrections of random network coding. In this article, subspace codes based on partial injective maps of vector spaces over finite fields are considered. Several bounds of the subspace codes (n, M, 2b, e)q based on
Hong-Li Wang, Gang Wang, You Gao
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
Families of nested completely regular codes and distance-regular graphs [PDF]
, 2014 In this paper infinite families of linear binary nested completely regular codes are constructed. They have covering radius $\rho$ equal to $3$ or $4$, and are $1/2^i$-th parts, for $i\in\{1,\ldots,u\}$ of binary (respectively, extended binary) Hamming ...
Borges, J., Rifà, J., Zinoviev, V. A.
core +5 more sources
Application of the French Codes to the Pressurized Thermal Shocks Assessment
Nuclear Engineering and Technology, 2016 The integrity of a reactor pressure vessel (RPV) related to pressurized thermal shocks (PTSs) has been extensively studied. This paper introduces an integrity assessment of an RPV subjected to a PTS transient based on the French codes.
Mingya Chen +8 more
doaj +1 more source
A Study of FqR-Cyclic Codes and Their Applications in Constructing Quantum Codes
IEEE Access, 2020 Let R = Fq + uFq + vFq + uvFq, with u2 = u, v2 = v, uv = vu, where q = pm for a positive integer m and an odd prime p. We study the algebraic structure of FqR-cyclic codes of block length (r, s). These codes can be viewed as R[x]-submodules of Fq[x]/(xr -
Hai Q. Dinh +4 more
doaj +1 more source