Related papers: Constructions of MDS convolutional codes using sup…
We investigate when a maximum distance separable ($MDS$) code over $F_q$ is also completely regular ($CR$). For lengths $n=q+1$ and $n=q+2$ we provide a complete classification of the $MDS$ codes that are $CR$ or at least uniformly packed…
We develop algorithms for inner approximating the cone of positive semidefinite matrices via linear programming and second order cone programming. Starting with an initial linear algebraic approximation suggested recently by Ahmadi and…
An $(m,n,a,b)$-tensor code consists of $m\times n$ matrices whose columns satisfy `$a$' parity checks and rows satisfy `$b$' parity checks (i.e., a tensor code is the tensor product of a column code and row code). Tensor codes are useful in…
In modern storage technologies, symbol-pair codes have emerged as a crucial framework for addressing errors in channels where symbols are read in overlapping pairs to guard against pair errors. A symbol-pair code that meets the…
We consider a large-scale matrix multiplication problem where the computation is carried out using a distributed system with a master node and multiple worker nodes, where each worker can store parts of the input matrices. We propose a…
After a discussion of the Griesmer and Heller bound for the distance of a convolutional code we present several codes with various parameters, over various fields, and meeting the given distance bounds. Moreover, the Griesmer bound is used…
We define Convolutional Goppa Codes over algebraic curves and construct their corresponding dual codes. Examples over the projective line and over elliptic curves are described, obtaining in particular some Maximum-Distance Separable (MDS)…
Maximum distance separable (MDS) codes are optimal in the sense that the minimum distance cannot be improved for a given length and code size. The most prominent MDS codes are generalized Reed-Solomon (GRS) codes. The square…
MDS codes have diverse practical applications in communication systems, data storage, and quantum codes due to their algebraic properties and optimal error-correcting capability. In this paper, we focus on a class of linear codes and…
An important family of quantum codes is the quantum maximum-distance-separable (MDS) codes. In this paper, we construct some new classes of quantum MDS codes by generalized Reed-Solomon (GRS) codes and Hermitian construction. In addition,…
In this paper, two classes of quantum MDS codes are constructed. The main tools are multiplicative structures on finite fields. Carefully choosing different cosets can make the corresponding generalized Reed-Solomon codes Hermitian…
Symbol-pair codes are block codes with symbol-pair metrics designed to protect against pair-errors that may occur in high-density data storage systems. MDS symbol-pair codes are optimal in the sense that it can attain the highest pair-error…
We consider the construction of maximal families of polynomials over the finite field $\mathbb{F}_q$, all having the same degree $n$ and a nonzero constant term, where the degree of the GCD of any two polynomials is $d$ with $1 \le d\le n$.…
This paper deals with the problem of increasing the minimum distance of a linear code by adding one or more columns to the generator matrix. Several methods to compute extensions of linear codes are presented. Many codes improving the…
Let $\mathbb{F}_q$ be a finite field with $q=p^{e}$ elements, where $p$ is a prime number and $e \geq 1$ is an integer. In this paper, by means of generalized Reed-Solomon (GRS) codes, we construct two new classes of quantum…
Motivated by applications to noncoherent network coding, we study subspace codes defined by sets of linear cellular automata (CA). As a first remark, we show that a family of linear CA where the local rules have the same diameter -- and…
Quantum maximum-distance-separable (MDS for short) codes are an important class of quantum codes. In this paper, by using Hermitian self-orthogonal generalized Reed-Solomon (GRS for short) codes, we construct five new classes of $q$-ary…
We construct two new families of linear codes by modifying the generator matrices of generalized Reed-Solomon (GRS) codes. For these codes, we explicitly derive parity-check matrices and establish necessary and sufficient conditions…
Given any linear code $C$ over a finite field $GF(q)$ we show how $C$ can be described in a transparent and geometrical way by using the associated Bruen-Silverman code. Then, specializing to the case of MDS codes we use our new approach to…
The construction of optimal linear block error-correcting codes is not an easy problem, for this, many studies describe methods for generating good error correcting codes in terms of minimum distance. In a previous work, we have presented…