Results 41 to 50 of about 9,399 (155)
A Family of Almost MDS Symbol-Pair Codes of Length 8p
In high-density data storage systems, symbol-pair codes are commonly used to prevent symbol-pair errors. Designing maximum distance separable (MDS) codes is crucial in symbol-pair coding theory because MDS symbol-pair codes are the best at meeting the ...
Hai Q. Dinh +3 more
doaj +1 more source
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 +2 more
doaj +1 more source
Non-restrictive MDS Array Codes for Correcting Multiple Column Erasures
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
On ℓ-MDS Codes and a Conjecture on Infinite Families of 1-MDS Codes
The class of $\ell$-maximum distance separable ($\ell$-MDS) codes {is a} generalization of maximum distance separable (MDS) codes {that} has attracted a lot of attention due to its applications in several areas such as secret sharing schemes, index coding problems, informed source coding problems, and combinatorial $t$-designs. In this paper, for $\ell=
Yang Li 0194 +2 more
openaire +2 more sources
Some Connections Between Classical Coding and Network Coding Over Erroneous Cyclic Networks
Recently, a framework was given for linear error-correcting network codes (LENCs) over cyclic networks on commutative rings. When the alphabet is considered as a rational power series ring, an LENC is referred to as a convolutional error-correcting ...
Vahid Samadi-Khaftari +2 more
doaj +1 more source
MDS Self-Dual Codes and Antiorthogonal Matrices over Galois Rings
In this study, we explore maximum distance separable (MDS) self-dual codes over Galois rings G R ( p m , r ) with p ≡ − 1 ( mod 4 ) and odd r.
Sunghyu Han
doaj +1 more source
On Group Codes Over Elementary Abelian Groups
For group codes over elementary Abelian groups we present definitions of the generator and the parity check matrices, which are matrices over the ring of endomorphism of the group.
Adnan A. Zain
doaj +1 more source
Direct Construction of Optimal Rotational-XOR Diffusion Primitives
As a core component of SPN block cipher and hash function, diffusion layer is mainly introduced by matrices built from maximum distance separable (MDS) codes.
Zhiyuan Guo +4 more
doaj +1 more source
New Families of Asymmetric Quantum MDS Codes via Affine and Projective Partitions
We construct three new families of asymmetric quantum MDS codes from nested Hermitian self-orthogonal generalized Reed–Solomon and extended generalized Reed–Solomon codes over Fq2. The construction is developed in three settings: affine partitions of Fq2,
Sami H. Saif, Shayea Aldossari
doaj +1 more source

