Related papers: Near MDS poset codes and distributions
Near maximum distance separable (NMDS) codes, where both the code and its dual are almost maximum distance separable, play pivotal roles in combinatorial design theory and cryptographic applications. Despite progress in fixed dimensions…
We construct six new explicit families of linear maximum sum-rank distance (MSRD) codes, each of which has the smallest field sizes among all known MSRD codes for some parameter regime. Using them and a previous result of the author, we…
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 distance distribution of a code is the vector whose $i^\text{th}$ entry is the number of pairs of codewords with distance $i$. We investigate the structure of the distance distribution for cyclic orbit codes, which are subspace codes…
In this paper, we determine the complete weight distribution of the space $ \mathbb{F}_q^N $ endowed by the weighted coordinates poset block metric ($(P,w,\pi)$-metric), also known as the $(P,w,\pi)$-space, thereby obtaining it for…
In this paper non-trivial non-linear binary systematic AMDS codes are classified in terms of their weight distributions, employing only elementary techniques. In particular, we show that their length and minimum distance completely…
We introduce the class of partition-balanced families of codes, and show how to exploit their combinatorial invariants to obtain upper and lower bounds on the number of codes that have a prescribed property. In particular, we derive precise…
By exploiting the connection between scattered $\mathbb{F}_q$-subspaces of $\mathbb{F}_{q^m}^3$ and minimal non degenerate $3$-dimensional rank metric codes of $\mathbb{F}_{q^m}^{n}$, $n \geq m+2$, described in [2], we will exhibit a new…
In this paper, we establish the Singleton bound for pomset block codes ($(Pm,\pi)$-codes) of length $N$ over the ring $\mathbb{Z}_m$. We give a necessary condition for a code to be MDS in the pomset (block) metric and prove that every MDS…
Maximum Distance Separable (MDS) codes with a sparse and balanced generator matrix are appealing in distributed storage systems for balancing and minimizing the computational load. Such codes have been constructed via Reed-Solomon 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…
Since near maximum distance separable (NMDS) codes have good algebraic properties and excellent error-correcting capabilities, they have been widely used in various fields such as communication systems, data storage, quantum codes, and so…
Let $p$ be a prime and let $q$ be a power of $p$. In this paper, by using generalized Reed-Solomon (GRS for short) codes and extended GRS codes, we construct two new classes of quantum maximum-distance- separable (MDS) codes with parameters…
In this paper, we consider the convertible codes with the maximum distance separable (MDS) property, which can adjust the code rate according to the failure rates of devices. We first extend the notion of convertible codes to allow initial…
We consider the $[q+1,q-3,5]_q3$ generalized doubly-extended Reed-Solomon code of codimension $4$ as the code associated with the twisted cubic in the projective space $\mathrm{PG}(3,q)$. Basing on the point-plane incidence matrix of…
The mds (maximum distance separable) conjecture claims that a nontrivial linear mds $[n,k]$ code over the finite field $GF(q)$ satisfies $n \leq (q + 1)$, except when $q$ is even and $k = 3$ or $k = q- 1$ in which case it satisfies $n \leq…
MDS self-dual codes have nice algebraic structures and are uniquely determined by lengths. Recently, the construction of MDS self-dual codes of new lengths has become an important and hot issue in coding theory. In this paper, we develop…
Algebraic methods for the design of series of maximum distance separable (MDS) linear block and convolutional codes to required specifications and types are presented. Algorithms are given to design codes to required rate and required…
Recently, linear codes with a few weights were widely investigated due to their applications in secret sharing schemes and authentication schemes. In this letter, we present a class of $q$-ary linear codes derived from irreducible cyclic…
In this paper motivated from subspace coding we introduce subspace-metric codes and subset-metric codes. These are coordinate-position independent pseudometrics and suitable for the folded codes. The half-Singleton upper bounds for linear…