Almost MDS codes
From MaRDI portal
Publication:679427
DOI10.1007/BF00124590zbMath0913.94025MaRDI QIDQ679427
Publication date: 28 May 1997
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Related Items
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, The packing problem in statistics, coding theory and finite projective spaces, Euclidean and Hermitian self-dual MDS codes over large finite fields., Construction of self-dual codes over finite rings \(\mathbb Z_{p^m}\), Maximal AMDS 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
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