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
Decoding of Convolutional Codes over the Erasure Channel
In this paper we study the decoding capabilities of convolutional codes over the erasure channel. Of special interest will be maximum distance profile (MDP) convolutional codes. These are codes which have a maximum possible column distance increase.
Rosenthal, Joachim +2 more
core +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
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
Repair Scheduling in Wireless Distributed Storage with D2D Communication [PDF]
We consider distributed storage (DS) for a wireless network where mobile devices arrive and depart according to a Poisson random process. Content is stored in a number of mobile devices, using an erasure correcting code.
Amat, Alexandre Graell i +3 more
core +4 more sources
Parallel Concatenation of Non-Binary Linear Random Fountain Codes with Maximum Distance Separable Codes [PDF]
The performance and the decoding complexity of a novel coding scheme based on the concatenation of maximum distance separable (MDS) codes and linear random fountain codes are investigated.
F. L. Blasco, G. Garrammone, G. Liva
semanticscholar +1 more source
Constructions of k-uniform and absolutely maximally entangled states beyond maximum distance codes
Pure multipartite quantum states of n parties and local dimension q are called k-uniform if all reductions to k parties are maximally mixed. These states are relevant for our understanding of multipartite entanglement, quantum information protocols, and ...
Zahra Raissi +3 more
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 to order
Maximum distance separable (MDS) are constructed to required specifications. The codes are explicitly given over finite fields with efficient encoding and decoding algorithms. Series of such codes over finite fields with ratio of distance to length approaching $(1-R)$ for given $R, \, 0 < R < 1$ are derived.
Hurley, Ted +2 more
openaire +2 more sources
An Optimal Recovery Approach for Liberation Codes in Distributed Storage Systems
To reduce the storage cost, distributed storage systems are gradually using erasure codes to ensure data reliability. Liberation codes, which satisfy the maximum distance separable (MDS) property and provide optimal modification overhead, are a class of ...
Ningjing Liang +4 more
doaj +1 more source

