Name
Abstract | ||
|---|---|---|
Complete (n, k)-arcs in PG(k − 1, q) and projective (n, k) q -AMDS codes that admit no projective extensions are equivalent objects. We show that projective AMDS codes of reasonable length admit only linear extensions. Thus, we are able to prove the maximality of many known linear AMDS codes. At the same time our results sharply limit the possibilities for constructing long nonlinear AMDS codes. We also show that certain short linear AMDS codes are maximal. Central to our approach is the Bruen–Silverman model of linear codes first introduced in Alderson (On MDS codes and Bruen–Silverman codes. Ph.D. Thesis, University of Western Ontario, 2002) and Alderson et al. (J. Combin. Theory Ser. A 114(6), 1101–1117, 2007). |
Year | DOI | Venue |
|---|---|---|
2008 | 10.1007/s00200-008-0058-0 | Appl. Algebra Eng. Commun. Comput. |
Keywords | Field | DocType |
NMDS codes,AMDS codes,(,n,r,)-arcs,Arcs,Cubic curves,Complete arcs,Code extension | Discrete mathematics,Combinatorics,Nonlinear system,Linear code,Mathematics,Projective test | Journal |
Volume | Issue | ISSN |
19 | 2 | 0938-1279 |
Citations | PageRank | References |
3 | 0.43 | 10 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| T. L. Alderson | 1 | 69 | 9.04 |
| A. A. Bruen | 2 | 38 | 7.27 |