Almost MDS codes
From MaRDI portal
Publication:679427
DOI10.1007/BF00124590zbMath0913.94025OpenAlexW4239704585MaRDI QIDQ679427
Publication date: 28 May 1997
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf00124590
Related Items
New families of self-dual codes, A database of linear codes over \(\mathbb F_{13}\) with minimum distance bounds and new quasi-twisted codes from a heuristic search algorithm, On dually almost MRD codes, On \(q\)-Steiner systems from rank metric codes, Near MDS codes from oval polynomials, Covering arrays from \(m\)-sequences and character sums, A formula on the weight distribution of linear codes with applications to AMDS codes, Quasi-cyclic codes over \(\mathbb F_{13}\) and enumeration of defining polynomials, The minimum locality of linear codes, On Hamming distance distributions of repeated-root constacyclic codes of length \(3p^s\) over \(\mathbb{F}_{p^m} + u \mathbb{F}_{p^m}\), NNMDS codes, Codes with few weights arising from linear sets, Construction of self-dual codes over finite rings \(\mathbb Z_{p^m}\), Maximal AMDS codes, Quadratic residue codes over the ring \(\mathbb {F}_{p}[u/\langle u^{m}-u\rangle \) and their Gray images], 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, Relations between Möbius and coboundary polynomials, Constructions of near MDS codes which are optimal locally recoverable codes, \((d, \boldsymbol{\sigma})\)-Veronese variety and some applications, Euclidean and Hermitian self-dual MDS codes over large finite fields., Quasi-cyclic NMDS codes, Constructions of new entanglement-assisted quantum MDS and almost MDS codes, On the completeness of certain \(n\)-tracks arising from elliptic curves, A survey on proper codes, Evaluation of the Hamming weights of a class of linear codes based on Gauss sums, The geometric description of a cyclic \((q- \sqrt{q}+1)\)-arc in \(\text{PG} (q-\sqrt{q}-3,q)\), \(q\) square, The smallest size of a complete cap in PG(3,\,7), Elliptic near-MDS codes over \(\mathbb{F}_5\), Self-dual codes over some prime fields constructed from skew-Hadamard matrices, Theory of supports for linear codes endowed with the sum-rank metric, The packing problem in statistics, coding theory and finite projective spaces, Matrix characterization of linear codes with arbitrary Hamming weight hierarchy, An improved upper bound on self-dual codes over finite fields \(\mathrm{GF}(11)\), \(\mathrm{GF}(19)\), and \(\mathrm{GF}(23)\)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Some results concerning \(\{(q+1)(n-1);\;n\}\)-arcs and \(\{(q+1)\;(n-1)+1;\;n\}\)-arcs in finite projective planes of order \(q\)
- Classical arcs in \(PG(r,q)\) for \(11\leq q\leq 19\)
- On near-MDS codes
- More about maximal (n, r)-sets
- Construction and decoding of a class of algebraic geometry codes
- Maximum distance<tex>q</tex>-nary codes
- Orthogonal Arrays of Index Unity
- Orthogonal Arrays of Strength two and three
