Results 21 to 30 of about 4,089,222 (241)
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
From Product Codes to Structured Generalized LDPC Codes [PDF]
Product codes, due to their relatively large minimum distance, are often seen as a natural solution for applications requiring low error floors.
Paolini, Enrico +10 more
core +1 more source
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
In this article, we present the design of a new navigation message system that includes an error-correcting scheme. This design exploits the “carousel” nature of the broadcast navigation message and facilitates (i) a reduction in the time to first fix ...
Lorenzo Ortega, Charly Poulliat
doaj +1 more source
Decoding of MDP Convolutional Codes over the Erasure Channel under Linear Systems Point of View
This paper attempts to highlight the decoding capabilities of MDP convolutional codes over the erasure channel by defining them as discrete linear dynamical systems, with which the controllability property and the observability characteristics of linear ...
Maria Isabel García-Planas +1 more
doaj +1 more source
Three Efficient All-Erasure Decoding Methods for Blaum–Roth Codes
Blaum–Roth Codes are binary maximum distance separable (MDS) array codes over the binary quotient ring F2[x]/(Mp(x)), where Mp(x)=1+x+⋯+xp−1, and p is a prime number.
Weijie Zhou, Hanxu Hou
doaj +1 more source
Complete Characterizations of Optimal Locally Repairable Codes With Locality 1 and
A locally repairable code (LRC) is a [n, k, d] linear code with length n, dimension k, minimum distance d and locality r, which means that every code symbol can be repaired by at most r other symbols.
Yichong Xia, Bin Chen
doaj +1 more source
Maximum distance separable codes over ℤ2 × ℤ2s
Bilal et al. (Maximum distance separable codes over [Formula: see text] and [Formula: see text] Des. Codes Cryptogr. 61 (2011) 31–40) obtained two upper bounds on minimum distance of codes over rings to the case of [Formula: see text]-additive codes and
Sadegh Sadeghi, Karim Samei
core +1 more source
Genetic Algorithm-Based Method for Discovering Involutory MDS Matrices
In this paper, we present an innovative approach for the discovery of involutory maximum distance separable (MDS) matrices over finite fields F2q, derived from MDS self-dual codes, by employing a technique based on genetic algorithms. The significance of
El Mehdi Bellfkih +4 more
doaj +1 more source
Maximum distance separable convolutional codes
A maximum distance separable (MDS) block code is a linear code whose distance is maximal among all linear block codes of rate k/n. It is well known that MDS block codes do exist if the field size is more than n.
Rosenthal, J +3 more
core +1 more source

