Near-MDS codes over some small fields (Q1970700)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1420375
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Near-MDS codes over some small fields |
scientific article; zbMATH DE number 1420375 |
Statements
Near-MDS codes over some small fields (English)
0 references
22 June 2000
0 references
A linear \([n,k]_q\) code \(C\) is said to be near-MDS if \(d_i(C)=n-k+i\), \(i=2,3,\dots,k\), \(d_1(C)=n-k\), where \(d_r(C)\) denotes the \(r\)-th generalized Hamming weight of \(C\). In the paper under review the problem of finding the maximum possible length \(m^\prime (k,q)\) of a near-MDS code is considered. The exact values of \(m^\prime (k,q)\), \(q=2,3,4,5\) are obtained and some results on near-MDS codes in larger fields are given.
0 references
near-MDS codes
0 references
MDS codes
0 references
0.9354378
0 references
0.9336261
0 references
0 references
0 references
0.90967196
0 references
0.9067132
0 references
0.90376425
0 references
0 references
0.8928812
0 references
