Almost MDS codes
From MaRDI portal
A linear \([n,k,d]\) code \(C\) over the finite field \(F_q\) is called almost maximum distance separable (AMDS for short) if its Singleton defect \(s(C) = n-k+1-d\) is one. A set of \(n\) points in the projective space \(PG(r,q)\) over \(F_q\) of dimension \(r\) is called \(n\)-track if every \(r\) of the points are not contained in a subspace of dimension \(r-2.\) The maximum size of an \(n\)-track in \(PG(q,r)\) is denoted by \(\mu(r,q).\) It follows from a result of \textit{R. C. Bose} and \textit{K. A. Bush} [Ann. Math. Statistics 23, 508-524 (1952; Zbl 0048.00803)] that the AMDS codes and \(n\)-tracks are the same objects. The aim of the present paper is to derive lower and upper bounds for \(\mu(r,q)\) and find properties of AMDS codes. It is proved for example that if \(r\geq q\) then \(\mu(r,q)\leq 2q +r+1.\) Then the author finds under the assumption \(r\geq q\) all \([n,n-r-1,r+1]\) codes for which \(n=2q +r+1\) or \(n=2q+r.\) At the end of the paper one finds a table of \(\mu(r,q)\) for all \(2 \leq q \leq 11\) and \(2\leq r \leq 13.\)
Recommendations
Cites work
- Classical arcs in PG(r,q) for 11 q 19
- Construction and decoding of a class of algebraic geometry codes
- scientific article; zbMATH DE number 3651315 (Why is no real title available?)
- scientific article; zbMATH DE number 53569 (Why is no real title available?)
- scientific article; zbMATH DE number 3577144 (Why is no real title available?)
- scientific article; zbMATH DE number 3076999 (Why is no real title available?)
- Maximum distance<tex>q</tex>-nary codes
- More about maximal (n, r)-sets
- On near-MDS codes
- Orthogonal Arrays of Index Unity
- Orthogonal Arrays of Strength two and three
- Some results concerning \(\{(q+1)(n-1);\;n\}\)-arcs and \(\{(q+1)\;(n-1)+1;\;n\}\)-arcs in finite projective planes of order \(q\)
Cited in
(63)- Elliptic near-MDS codes over \(\mathbb{F}_5\)
- The packing problem in statistics, coding theory and finite projective spaces
- Euclidean and Hermitian self-dual MDS codes over large finite fields.
- On dually almost MRD codes
- On \(q\)-Steiner systems from rank metric codes
- Covering arrays from m-sequences and character sums
- Quadratic residue codes over the ring \(\mathbb {F}_{p}[u]/\langle u^{m}-u\rangle \) and their Gray images
- Quasi-cyclic codes over \(\mathbb F_{13}\) and enumeration of defining polynomials
- NNMDS codes
- Relations between Möbius and coboundary polynomials
- An improved upper bound on self-dual codes over finite fields \(\mathrm{GF}(11)\), \(\mathrm{GF}(19)\), and \(\mathrm{GF}(23)\)
- Theory of supports for linear codes endowed with the sum-rank metric
- Construction of self-dual codes over finite rings \(\mathbb Z_{p^m}\)
- Maximal AMDS codes
- Quasi-cyclic NMDS codes
- On the completeness of certain n-tracks arising from elliptic curves
- The smallest size of a complete cap in PG(3,\,7)
- Matrix characterization of linear codes with arbitrary Hamming weight hierarchy
- Near MDS codes from oval polynomials
- A formula on the weight distribution of linear codes with applications to AMDS codes
- The minimum locality of linear codes
- Constructions of near MDS codes which are optimal locally recoverable codes
- \((d, \boldsymbol{\sigma})\)-Veronese variety and some applications
- A database of linear codes over \(\mathbb F_{13}\) with minimum distance bounds and new quasi-twisted codes from a heuristic search algorithm
- New MDS or Near-MDS Self-Dual Codes
- Self-dual codes over some prime fields constructed from skew-Hadamard matrices
- Normal and abnormal codes
- Evaluation of the Hamming weights of a class of linear codes based on Gauss sums
- A survey on proper codes
- The geometric description of a cyclic \((q- \sqrt{q}+1)\)-arc in \(\text{PG} (q-\sqrt{q}-3,q)\), \(q\) square
- Curves in projective spaces and almost MDS codes
- On Hamming distance distributions of repeated-root constacyclic codes of length \(3p^s\) over \(\mathbb{F}_{p^m} + u \mathbb{F}_{p^m}\)
- Codes with few weights arising from linear sets
- Near MDS codes with dimension 4 and their application in locally recoverable codes
- On regular sets of affine type in finite Desarguesian planes and related codes
- The extended codes of projective two-weight codes
- On the polycyclic codes over \(\mathbb{F}_q +u\mathbb{F}_q\)
- Maximum flag-rank distance codes
- Improved lower bounds for self-dual codes over \(\mathbb{F}_{11}\), \(\mathbb{F}_{13}\), \(\mathbb{F}_{17}\), \(\mathbb{F}_{19}\) and \(\mathbb{F}_{23}\)
- Further results on covering codes with radius R and codimension tR+1
- Optimal ternary locally repairable codes
- Four new families of NMDS codes with dimension 4 and their applications
- New and improved formally self-dual codes with small hulls from polynomial four Toeplitz codes
- The weight distributions of several classes of few-weight linear codes
- Infinite families of 3-designs from special symmetric polynomials
- Constructions of new entanglement-assisted quantum MDS and almost MDS codes
- New infinite families of uniformly packed near-MDS codes and multiple coverings, based on the ternary Golay code
- Some sufficient conditions for \((\mathcal{A}\ast \mathcal{B})^\perp\) with an error-correcting pair \((\mathcal{A},\mathcal{B})\)
- An infinite family of AMDS codes holding 2-designs
- The dual codes of two families of BCH codes
- Two families of self-orthogonal codes with applications in LCD codes and optimally extendable codes
- Classification of a class of A^3MDS code and applications in secret-sharing schemes
- Two new classes of AMDS symbol-pair cyclic codes of length 4p
- Characterizations of NMDS codes and a proof of the Geng-Yang-Zhang-Zhou conjecture
- A family of linear codes with few weights and their subfield codes
- New self-dual codes from TGRS codes with general twists
- On the direct construction of MDS and near-MDS matrices
- The extended codes of NMDS codes
- AMDS codes and quantum AMDS codes of length \(3p^s\) over \(\mathbb{F}_{p^m}\)
- Dual and covering radii of extended algebraic geometry codes
- Subsets of \({\mathbb{P}}^4\) with no four points on a plane
- Generalized Hamming weights of almost-MDS codes with respect to twisted Reed-Solomon codes
- New families of self-dual codes
This page was built for publication: Almost MDS codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q679427)
