NNMDS codes (Q1936585): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
links / mardi / name | links / mardi / name | ||
Revision as of 16:32, 1 February 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | NNMDS codes |
scientific article |
Statements
NNMDS codes (English)
0 references
6 February 2013
0 references
A linear \([n,k,d]_q\) code is a subspace of dimension \(k\) in \(F_q^n\) with minimum Hamming distance \(q\). The Singleton bound gives that \(d \leq n-k+1.\) The Singleton defect is defined as \(s(C) = n+1-k-d.\) A code meeting the Singleton bound is known as a maximum distance separable (MDS) code. Codes with \(s(C)=s(C^\perp)=1\) are known as near maximum distance separable (NMDS) codes. The author extends this definition to study codes with \(s(C)=s(C^\perp)=2\), which the author calls NNMDS codes. The author gives an upper bound on the length of such codes and gives several necessary and sufficient conditions for their existence.
0 references
generalized Hamming weights
0 references
linear codes
0 references
MDS codes
0 references
near-MDS codes
0 references
Singleton defects
0 references