NMDS codes of maximal length over Fq, 8 ≤ q ≤ 11

IEEE Transactions on Information Theory

Volumn 48, Issue 4, 2002, Pages 963-966

  Marcugini, Stefano ^a   Milani, Alfredo ^a   Pambianco, Fernanda ^a  

^a UNIVERSITY OF PERUGIA   (Italy)

Author keywords

Galois fields; Linear codes; Near maximum distance separable (NMDS) codes

Indexed keywords

BOUNDARY CONDITIONS; COMPUTER SIMULATION; ERROR CORRECTION; MATRIX ALGEBRA; SIGNAL DETECTION; THEOREM PROVING;

LINEAR CODES; NEAR MAXIMUM-DISTANCE SEPARABLE (NMDS) CODES;

CODES (SYMBOLS);

EID: 0036540699     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/18.992802     Document Type: Article

References (21)

1. Multiple blocking sets and arcs in finite planes
2. Almost MDS codes
3. Orthogonal arrays of strength two and three
4. Classical arcs in PG(r, q) for 11 ≤ q ≤ 19
5. On near-MDS codes
6. Near-MDS codes over some small fields
7. Codes of small defect
8. The packing problem in statistics, coding theory and finite projective spaces
9. Maximal (n, 3)-arcs in PG(2, 11)
10. Existence and classification of NMDS codes over GF(5) and GF(7)
11. q NMDS codes over GF(7), GF(8) and GF(9)
12. Maximum distance q-nary codes
13. Group Tables