Maximal AMDS codes |
| |
Authors: | T L Alderson A A Bruen |
| |
Affiliation: | (1) Mathematical Sciences, University of New Brunswick, Saint John, NB, E2L 4L5, Canada;(2) Electrical Engineering, University of Calgary, Calgary, NB, T2N 1N4, Canada |
| |
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).
The authors acknowledge support from the N.S.E.R.C. of Canada. |
| |
Keywords: | NMDS codes AMDS codes (n r)-arcs Arcs Cubic curves Complete arcs Code extension |
本文献已被 SpringerLink 等数据库收录! |
|