On the maximality of linear codes

Designs, Codes, and Cryptography

Volumn 53, Issue 1, 2009, Pages 59-68

  Alderson, T L ^a   Gács, András ^b  

^a UNIVERSITY OF NEW BRUNSWICK   (Canada)

^b EÖTVÖS LORÁND UNIVERSITY   (Hungary)

Author keywords

BRS model; Code extension; Codes; Non linear codes

Indexed keywords

BRS MODEL; CODE EXTENSION; CODES; LINEAR CODES; LINEAR EXTENSIONS; MAXIMALITY; NON-LINEAR; NON-LINEAR CODES;

EID: 68849111896     PISSN: 09251022     EISSN: None     Source Type: Journal    
DOI: 10.1007/s10623-009-9293-z     Document Type: Article

References (34)

1. h and h(≥6) even Ars Combin. 16 103 111
2. T. Alderson A.A. Bruen R. Silverman 2007 Maximum distance separable codes and arcs in projective spaces J. Combin. Theory Ser. A 114 6 1101 1117
3. Alderson T.L.: On MDS codes and Bruen-Silverman codes. PhD Thesis, University of Western Ontario (2002).
4. Alderson T.L., Bruen A.A.: Codes from cubic curves and their extensions. Electron. J. Combin. 15(1), Research paper 42, 9 (2008).
5. T.L. Alderson A.A. Bruen 2008 Coprimitive sets and inextendable codes Des. Codes Cryptogr. 47 1-3 113 124
6. T.L. Alderson A.A. Bruen 2008 Maximal AMDS codes Appl. Algebra Engrg. Comm. Comput. 19 2 87 98
7. S. Ball 2003 The number of directions determined by a function over a finite field J. Combin. Theory Ser. A 104 2 341 350
8. S. Ball 2008 On the graph of a function in many variables over a finite field Des. Codes Cryptogr. 47 1-3 159 164
9. S. Ball J.W.P. Hirschfeld 2005 Bounds on (n, r)-arcs and their application to linear codes Finite Fields Appl. 11 3 326 336
10. Bierbrauer J.: Introduction to coding theory. Discrete Mathematics and its Applications. Chapman & Hall/CRC, Boca Raton, FL (2005)
11. A. Blokhuis S. Ball A.E. Brouwer L. Storme T. Szonyi 1999 On the number of slopes of the graph of a function defined on a finite field J. Combin. Theory Ser. A 86 1 187 196
12. A. Blokhuis A.A. Bruen J.A. Thas 1990 Arcs in PG(n, q), MDS-codes and three fundamental problems of B Segre-some extensions. Geom. Dedicata 35 1-3 1 11
13. Bruen A.A., Forcinito M.A.: Cryptography, information theory, and error-correction. A handbook for the 21st century. Wiley-Interscience Series in Discrete Mathematics and Optimization. Wiley-Interscience [John Wiley & Sons], Hoboken, NJ (2005).
14. A.A. Bruen J.A. Thas A. Blokhuis 1988 On M.D.S. codes, arcs in PG(n, q) with q even, and a solution of three fundamental problems of B Segre. Invent. Math. 92 3 441 459
15. r, q " for q even Atti Accad. Naz. Lincei Rend. Cl. Sci. Fis. Mat. Natur. 46 8 13 20
16. É. Hadnagy 1999 Small complete arcs in PG(2, p) Finite Fields Appl. 5 1 12
17. J.W.P. Hirschfeld 2006 The number of points on a curve, and applications Arcs and curves: the legacy of Beniamino Segre. Rend. Mat. Appl. 26 1 13 28
18. Hirschfeld J.W.P., Storme L.: The packing problem in statistics, coding theory and finite projective spaces: update 2001. In: Blokhuis, A., Hirschfeld, J.W.P., Jungnickel, D., Thas, J.A. (eds) Finite Geometries. Developments in Mathematics, vol. 3, pp. 201-246. Kluwer Academic Publications, Dordrecht (2001)
19. J.W.P. Hirschfeld J.F. Voloch 1988 The characterization of elliptic curves over finite fields J. Austral. Math. Soc. Ser. A 45 2 275 286
20. J.H. Kim V.H. Vu 2003 Small complete arcs in projective planes Combinatorica 23 2 311 363
21. G. Korchmáros 1983 New examples of complete k-arcs in PG(2, q) Eur. J. Combin. 4 4 329 334
22. MacWilliams F.J., Sloane N.J.A.: The Theory of Error-correcting Codes. II. North-Holland Mathematical Library, vol. 16. North-Holland Publishing Co., Amsterdam (1977).
23. S. Marcugini A. Milani F. Pambianco 2007 Complete arcs in PG(2,25): the spectrum of the sizes and the classification of the smallest complete arcs Discrete Math. 307 6 739 747
24. Rédei L.: Lacunary Polynomials Over Finite Fields. North-Holland Publishing Co., Amsterdam (1973). Translated from the German by I. Földes.
25. Roth R.: Introduction to Coding Theory. Cambridge University Press, New York, NY, USA (2006)
26. H.G. Rück 1987 A note on elliptic curves over finite fields Math. Comp. 49 179 301 304
27. B. Segre 1955 Curve razionali normali e k-archi negli spazi finiti Ann. Mat. Pura Appl. 39 4 357 379
28. L. Storme 1997 Small arcs in projective spaces J. Geom. 58 1-2 179 191
29. L. Storme P. Sziklai 2001 Linear point sets and Rédei type k-blocking sets in PG(n, q) J. Algebraic Combin. 14 3 221 228
30. L. Storme T. Szonyi 1994 Intersection of arcs and normal rational curves in spaces of even characteristic J. Geom. 51 1-2 150 166
31. T. Szonyi 1985 Small complete arcs in Galois planes Geom. Dedicata 18 2 161 172
32. Thas J.A.: Finite geometries, varieties and codes. In: Proceedings of the International Congress of Mathematicians, Berlin (1998) vol. III, pp. 397-408 (electronic).
33. van Lint J.H.: Introduction to Coding Theory, Graduate Texts in Mathematics, 3rd edn. vol. 86. Springer-Verlag, Berlin (1999).
34. W.C. Waterhouse 1969 Abelian varieties over finite fields Ann. Sci. École Norm. Sup. 2 4 521 560