Codes of small defect
The parameters of a linear code \(C\) over \(GF(q)\) are given by \([n,k,d]\), where \(n\) denotes the length, \(k\) the dimension and \(d\) the minimum distance of \(C\). The code \(C\) is called MDS, or maximum distance separable, if the minimum distance \(d\) meets the Singleton bound, i.e. \(d=n -k+1\). Unfortunately, the parameters of an MDS code are severely limited by the size of the field. Thus we look for codes which have minimum distance close to the Singleton bound. Of particular interest is the class of almost MDS codes, i.e. codes for which \(d= n-k\). We will present a condition on the minimum distance of a code to guarantee that the orthogonal code is an almost MDS code. This extends a result of Dodunekov and Landgev. Evaluation of the MacWilliams identities leads to a closed formula for the weight distribution which turns out to be completely determined for almost MDS codes up to one parameter. As a consequence we obtain surprising combinatorial relations in such codes. This leads, among other things, to an answer to a question of Assmus and Mattson on the existence of self-dual \([2d,d,d]\)-codes which have no code words of weight \(d+1\). Actually there are more codes than Assmus and Mattson expected, but the examples which we know are related to the expected ones.
- On dually almost MRD codes
- On \(q\)-Steiner systems from rank metric codes
- Weight distribution of rank-metric codes
- Relations between Möbius and coboundary polynomials
- Group codes over fields are asymptotically good
- Asymptotic performance of metacyclic codes
- Blocks of small defect.
- The smallest size of a complete cap in PG(3,\,7)
- Near MDS codes from oval polynomials
- A formula on the weight distribution of linear codes with applications to AMDS codes
- A class of almost MDS codes
- The minimum locality of linear codes
- Constructions of near MDS codes which are optimal locally recoverable codes
- scientific article; zbMATH DE number 1714652 (Why is no real title available?)
- On m-MDS codes over finite fields
- Higher genus universally decodable matrices (UDMG)
- scientific article; zbMATH DE number 1885940 (Why is no real title available?)
- On checkable codes in group algebras
- A survey on proper codes
- On Hamming distance distributions of repeated-root constacyclic codes of length \(3p^s\) over \(\mathbb{F}_{p^m} + u \mathbb{F}_{p^m}\)
- Near MDS codes of non-elliptic-curve type from Reed-Solomon codes
- Non-binary quantum codes from cyclic codes over \(\mathbb{F}_p \times (\mathbb{F}_p +v\mathbb{F}_p)\)
- New classes of NMDS codes with dimension 3
- Defects of codes from higher dimensional algebraic varieties
- Near MDS codes with dimension 4 and their application in locally recoverable codes
- New infinite families of near MDS codes holding \(t\)-designs
- Near-MDS codes from maximal arcs in \(\mathrm{PG}(2,q)\)
- Four new families of NMDS codes with dimension 4 and their applications
- The weight distributions of several classes of few-weight linear codes
- Infinite families of 3-designs from special symmetric polynomials
- New infinite families of uniformly packed near-MDS codes and multiple coverings, based on the ternary Golay code
- The third generalized covering radius for binary primitive double-error-correcting BCH codes
- Linear codes in the folded Hamming distance and the quasi MDS property
- Double-twisted Reed-Solomon codes with twists (1, 3) and general hooks over finite fields
- Two new classes of AMDS symbol-pair cyclic codes of length 4p
- Around LCD group codes
- Constructions of several families of MDS codes and NMDS codes
- New constructions of optimal symbol-pair constacyclic codes of length 4p^s
- LCD and non-LCD (A)MDS DTRS codes with all possible hooks
- The extended codes of NMDS codes
- AMDS codes and quantum AMDS codes of length \(3p^s\) over \(\mathbb{F}_{p^m}\)
- Dual codes from 2-cocycles
- Computing sharp recovery structures for locally recoverable codes
This page was built for publication: Codes of small defect
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q676729)
