Skip to main content Accessibility help

We use cookies to distinguish you from other users and to provide you with a better experience on our websites. Close this message to accept cookies or find out how to manage your cookie settings.

Close cookie message
×
Hostname: page-component-76c49bb84f-kjkt6 Total loading time: 0 Render date: 2025-07-10T23:40:32.938Z Has data issue: false hasContentIssue false

2 - The geometry of covering codes: small complete caps and saturating sets in Galois spaces

Published online by Cambridge University Press:  05 July 2013

By
Massimo Giulietti
Edited by
Simon R. Blackburn ,
Stefanie Gerke  and
Mark Wildon
Simon R. Blackburn
Affiliation:
Royal Holloway, University of London
Stefanie Gerke
Affiliation:
Royal Holloway, University of London
Mark Wildon
Affiliation:
Royal Holloway, University of London
Get access

Summary

Abstract

Complete caps and saturating sets in projective Galois spaces are the geometrical counterpart of linear codes with covering radius 2. The smaller the cap/saturating set, the better the covering properties of the code. In this paper we survey the state of the art of the research on these geometrical objects, with particular emphasis on the recent developments and on the connections with algebraic curves over finite fields.

Introduction

Galois spaces, that is affine and projective spaces of dimension N > 2 defined over a finite (Galois) field Fq, are well known to be rich in nice geometric, combinatorial and group-theoretic properties that have also found wide and relevant applications in several branches of combinatorics, especially to design theory and graph theory, as well as in more practical areas, notably coding theory and cryptography.

The systematic study of Galois spaces was initiated in the late 1950's by the pioneering work of B. Segre [77]. The trilogy [53, 55, 58] covers the general theory of Galois spaces including the study of objects which are linked to linear codes. Typical such objects are plane arcs and their generalizations, especially caps, saturating sets and arcs in higher dimensions, whose code-theoretic counterparts are distinguished types of error-correcting and covering linear codes, such as MDS codes. Their investigation has received a great stimulus from coding theory, especially in the last decades; see the survey papers [56, 57].

Information

Type
Chapter
Information
Surveys in Combinatorics 2013 , pp. 51 - 90
Publisher: Cambridge University Press
Print publication year: 2013

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Book purchase

Temporarily unavailable

References

[1] Luca Maria, Abatangelo, Complete caps in a Galois space PG(3, q), q even, Atti Sem. Mat. Fis. Univ. Modena 29 (1980), no. 2, 215–221.Google Scholar
[2] Nurdagül, Anbar, Daniele, Bartoli, Massimo, Giulietti, and Irene, Platoni, Small complete caps from singular cubics, submitted, 2012.
[3] Nurdagül, Anbar and Massimo, Giulietti, Bicovering arcs and small complete caps from elliptic curves, submitted, 2012.
[4] Tsonka S., Baicheva and Evgenia D., Velikova, Covering radii of ternary linear codes of small dimensions and codimensions, IEEE Trans. Inform. Theory 43 (1997), no. 6, 2057–2061.Google Scholar
[5] Tsonka S., Baicheva and Evgenia D., Velikova, Correction to: “Covering radii of ternary linear codes of small dimensions and codimensions” [IEEE Trans. Inform. Theory 43 (1997), no. 6, 2057–2061], IEEE Trans. Inform. Theory 44 (1998), no. 5, 2032.Google Scholar
[6] Umberto, Bartocci, Dense k-systems in Galois planes, Boll. Un. Mat. Ital. D (6) 2 (1983), no. 1, 71–77.Google Scholar
[7] Daniele, Bartoli, Private communication, 2012.
[8] Daniele Bartoli, AlexanderA., Davydov, Giorgio, Faina, Stefano, Marcugini, and Fernanda, Pambianco, New upper bounds on the smallest size of a complete arc in the plane PG(2, q), Proceedings XIII Int. Workshop on Algebraic and Combin. Coding Theory, ACCT2012, June 2012, pp. 60–66.
[9] Daniele Bartoli, AlexanderA., Davydov, Giorgio, Faina, Stefano, Marcugini, and Fernanda, Pambianco, On sizes of complete arcs in PG(2, q), Discrete Math. 312 (2012), no. 3, 680–698.Google Scholar
[10] Daniele Bartoli, AlexanderA., Davydov, Massimo, Giulietti, Stefano, Marcugini, and Fernanda, Pambianco, Multiple coverings of the farthest-off points, In preparation, 2012.
[11] Daniele, Bartoli, Alexander A., Davydov, Stefano, Marcugini, and Fernanda, Pambianco, New type of estimations for the smallest size of complete arcs in PG(2, q), Proceedings XIII Int. Workshop on Algebraic and Combin. Coding Theory, ACCT2012, June 2012, pp. 67–72.
[12] Daniele, Bartoli and Massimo, Giulietti, Small complete caps in PG(3, q), In preparation, 2012.
[13] Endre, Boros, Tamás, Szőonyi, and Krisztián, Tichler, On defining sets for projective planes, Discrete Math. 303 (2005), no. 1–3, 17–31.Google Scholar
[14] Richard A., Brualdi, Simon, Litsyn, and Vera S., Pless, Covering radius, Handbook of coding theory, Vol. I, II, North-Holland, Amsterdam, 1998, pp. 755–826.
[15] Richard A., Brualdi, Vera S., Pless, and Richard M., Wilson, Short codes with a given covering radius, IEEE Trans. Inform. Theory 35 (1989), no. 1, 99–109.Google Scholar
[16] Aiden A., Bruen, James W. P., Hirschfeld, and David L., Wehlau, Cubic curves, finite geometry and cryptography, Acta Appl. Math. 115 (2011), no. 3, 265–278.Google Scholar
[17] Robert, Calderbank and William M., Kantor, The geometry of two-weight codes, Bull. London Math. Soc. 18 (1986), no. 2, 97–122.Google Scholar
[18] Gérard D., Cohen, Iiro, Honkala, Simon, Litsyn, and Antoine, Lobstein, Covering codes, North-Holland Mathematical Library, vol. 54, North-Holland Publishing Co., Amsterdam, 1997.
[19] Gérard D., Cohen, Antoine, Lobstein, and Neil J. A., Sloane, Further results on the covering radius of codes, IEEE Trans. Inform. Theory 32 (1986), no. 5, 680–694.Google Scholar
[20] Alexander A., Davydov, Construction of linear covering codes, Problems of Information Transmission 26 (1990), no. 4, 317–331.Google Scholar
[21] Alexander A., Davydov, Constructions and families of covering codes and saturated sets of points in projective geometry, IEEE Trans. Inform. Theory 41 (1995), no. 6, part 2, 2071–2080.Google Scholar
[22] Alexander A., Davydov, Constructions and families of nonbinary linear codes with covering radius 2, IEEE Trans. Inform. Theory 45 (1999), no. 5, 1679–1686.Google Scholar
[23] Alexander A., Davydov, New constructions of covering codes, Des. Codes Cryptogr. 22 (2001), no. 3, 305–316.Google Scholar
[24] Alexander A., Davydov and Anna Yu., Drozhzhina-Labinskaya, Constructions, families, and tables of binary linear covering codes, IEEE Trans. Inform. Theory 40 (1994), no. 4, 1270–1279.Google Scholar
[25] Alexander A., Davydov, Giorgio, Faina, Stefano, Marcugini, and Fernanda, Pambianco, Computer search in projective planes for the sizes of complete arcs, J. Geom. 82 (2005), no. 1–2, 50–62.Google Scholar
[26] Alexander A., Davydov, Giorgio, Faina, Stefano, Marcugini, and Fernanda, Pambianco, Locally optimal (nonshortening) linear covering codes and minimal saturating sets in projective spaces, IEEE Trans. Inform. Theory 51 (2005), no. 12, 4378–4387.Google Scholar
[27] Alexander A., Davydov, Giorgio, Faina, Stefano, Marcugini, and Fernanda, Pambianco, On sizes of complete caps in projective spaces PG(n, q) and arcs in planes PG(2, q), J. Geom. 94 (2009), no. 1–2, 31–58.Google Scholar
[28] Alexander A., Davydov, Massimo, Giulietti, Stefano, Marcugini, and Fernanda, Pambianco, New inductive constructions of complete caps in PG(N, q), q even, J. Combin. Des. 18 (2010), no. 3, 177–201.Google Scholar
[29] Alexander A., Davydov, Massimo, Giulietti, Stefano, Marcugini, and Fernanda, Pambianco, Linear nonbinary covering codes and saturating sets in projective spaces, Adv. Math. Commun. 5 (2011), no. 1, 119–147.Google Scholar
[30] Alexander A., Davydov, Stefano, Marcugini, and Fernanda, Pambianco, On saturating sets in projective spaces, J. Combin. Theory Ser. A 103 (2003), no. 1, 1–15.Google Scholar
[31] Alexander A., Davydov, Stefano, Marcugini, and Fernanda, Pambianco, Complete caps in projective spaces PG(n, q), J. Geom. 80 (2004), no. 1–2, 23–30.Google Scholar
[32] Alexander A., Davydov, Stefano, Marcugini, and Fernanda, Pambianco, Linear codes with covering radius 2, 3 and saturating sets in projective geometry, IEEE Trans. Inform. Theory 50 (2004), no. 3, 537–541.Google Scholar
[33] Alexander A., Davydov and Patric R. J., Östergård, New linear codes with covering radius 2 and odd basis, Des. Codes Cryptogr. 16 (1999), no. 1, 29–39.Google Scholar
[34] Alexander A., Davydov and Patric R. J., Östergård, New quaternary linear codes with covering radius 2, Finite Fields Appl. 6 (2000), no. 2, 164–174.Google Scholar
[35] Alexander A., Davydov and Patric R. J., Östergård, On saturating sets in small projective geometries, European J. Combin. 21 (2000), no. 5, 563–570.Google Scholar
[36] Alexander A., Davydov and Patric R. J., Östergård, Linear codes with covering radius R = 2, 3 and codimension tR, IEEE Trans. Inform. Theory 47 (2001), no. 1, 416–421.Google Scholar
[37] Alexander A., Davydov and Patric R. J., Östergård, Recursive constructions of complete caps, J. Statist. Plann. Inference 95 (2001), no. 1–2, 167–173, Special issue on design combinatorics: in honor of S. S., Shrikhande.Google Scholar
[38] Alexander A., Davydov and Patric R. J., Östergård, Linear codes with covering radius 3, Des. Codes Cryptogr. 54 (2010), no. 3, 253–271.Google Scholar
[39] Tuvi, Etzion and Beniamin, Mounits, Quasi-perfect codes with small distance, IEEE Trans. Inform. Theory 51 (2005), no. 11, 3938–3946.Google Scholar
[40] Giorgio, Faina, Complete caps having less than (q2 + 1)/2 points in common with an elliptic quadric of PG(3, q), q odd, Rend. Mat. Appl. (7) 8 (1988), no. 2, 277–281.Google Scholar
[41] Giorgio, Faina and Fernanda, Pambianco, A class of complete k-caps in PG(3, q) for q an odd prime, J. Geom. 57 (1996), no. 1–2, 93–105.Google Scholar
[42] Giorgio, Faina, Fabio, Pasticci, and Lorenzo, Schmidt, Small complete caps in galois spaces, Ars Combin., to appear.
[43] Stefania, Fanali and Massimo, Giulietti, On the number of rational points of generalized Fermat curves over finite fields, Int. J. Number Theory 8 (2012), no. 4, 1087–1097.Google Scholar
[44] Ernst M., Gabidulin, Alexander A., Davydov, and Leonid M., Tombak, Linear codes with covering radius 2 and other new covering codes, IEEE Trans. Inform. Theory 37 (1991), no. 1, 219–224.Google Scholar
[45] Massimo, Giulietti, On small dense sets in Galois planes, Electron. J. Combin. 14 (2007), no. 1, Research Paper 75.Google Scholar
[46] Massimo, Giulietti, Small complete caps in Galois affine spaces, J. Algebraic Combin. 25 (2007), no. 2, 149–168.Google Scholar
[47] Massimo, Giulietti, Small complete caps in PG(N, q), q even, J. Combin. Des. 15 (2007), no. 5, 420–436.Google Scholar
[48] Massimo, Giulietti and Fernando, Torres, On dense sets related to plane algebraic curves, Ars Combin. 72 (2004), 33–40.Google Scholar
[49] Heikki O., Hämäläinen, Iiro S., Honkala, Markku K., Kaikkonen, and Simon N., Litsyn, Bounds for binary multiple covering codes, Des. Codes Cryptogr. 3 (1993), no. 3, 251–275.Google Scholar
[50] Heikki O., Hämäläinen, Iiro S., Honkala, Simon, Litsyn, and Patric R. J., Östergård, Football pools – a game for mathematicians, Amer. Math. Monthly 102 (1995), no. 7, 579–588.Google Scholar
[51] Heikki O., Hämäläinen, Iiro S., Honkala, Simon N., Litsyn, and Patric R. J., Östergård, Bounds for binary codes that are multiple coverings of the farthest-off points, SIAM J. Discrete Math. 8 (1995), no. 2, 196–207.Google Scholar
[52] Heikki O., Hämäläinen and Seppo, Rankinen, Upper bounds for football pool problems and mixed covering codes, J. Combin. Theory Ser. A 56 (1991), no. 1, 84–95.Google Scholar
[53] James W. P., Hirschfeld, Finite projective spaces of three dimensions, Oxford Mathematical Monographs, The Clarendon Press Oxford University Press, New York, 1985, Oxford Science Publications.
[54] James W. P., Hirschfeld, Algebraic curves, arcs, and caps over finite fields, Quaderni del Dipartimento di Matematica dell' Università del Salento 5, Dipartimento di Matematica, Università del Salento, Lecce, 1986.
[55] James W. P., Hirschfeld, Projective geometries over finite fields, second ed., Oxford Mathematical Monographs, The Clarendon Press Oxford University Press, New York, 1998.
[56] James W. P., Hirschfeld and Leo, Storme, The packing problem in statistics, coding theory and finite projective spaces, J. Statist. Plann. Inference 72 (1998), no. 1–2, 355–380, R. C. Bose Memorial Conference (Fort Collins, CO, 1995).Google Scholar
[57] James W. P., Hirschfeld and Leo, Storme, The packing problem in statistics, coding theory and finite projective spaces: update 2001, Finite geometries, Dev. Math., vol. 3, Kluwer Acad. Publ., Dordrecht, 2001, pp. 201–246.
[58] James W. P., Hirschfeld and Jeff A., Thas, General Galois geometries, Oxford Mathematical Monographs, The Clarendon Press Oxford University Press, New York, 1991, Oxford Science Publications.
[59] Iiro S., Honkala, On the normality of multiple covering codes, Discrete Math. 125 (1994), no. 1–3, 229–239, 13th British Combinatorial Conference (Guildford, 1991).Google Scholar
[60] Iiro S., Honkala and Simon, Litsyn, Generalizations of the covering radius problem in coding theory, Bull. Inst. Combin. Appl. 17 (1996), 39–46.Google Scholar
[61] Jeong H., Kim and Van H., Vu, Small complete arcs in projective planes, Combinatorica 23 (2003), no. 2, 311–363.Google Scholar
[62] György, Kiss, István, Kovács, Klavdija, Kutnar, János, Ruff, and Primož, Šparl, A note on a geometric construction of large Cayley graphs of given degree and diameter, Stud. Univ. Babeş-Bolyai Math. 54 (2009), no. 3, 77–84.Google Scholar
[63] Gábor, Korchmáros, New examples of complete k-arcs in PG(2, q), European J. Combin. 4 (1983), no. 4, 329–334.Google Scholar
[64] Sándor J., Kovács, Small saturated sets in finite projective planes, Rend. Mat. Appl. (7) 12 (1992), no. 1, 157–164.Google Scholar
[65] Rudolf, Lidl and Harald, Niederreiter, Finite fields, Encyclopedia of Mathematics and its Applications, vol. 20, Addison-Wesley Publishing Company Advanced Book Program, Reading, MA, 1983, With a foreword by P. M. Cohn.
[66] Lucio, Lombardo-Radice, Sul problema dei k-archi completi in S2, q (q = pt, p primo dispari), Boll. Un. Mat. Ital. (3) 11 (1956), 178–181.Google Scholar
[67] Mirka, Miller and Jozef, Siran, Moore graphs and beyond: A survey of the degree/diameter problem, Electronic Journal of Combinatorics Dynamic Survey DS14 (2005), Online journal, print version is known as Journal of Combinatorics (electronic ISSN 1077–8926, print ISSN 1097–1440).Google Scholar
[68] Patric R. J., Östergård and Heikki O., Hämäläinen, A new table of binary/ternary mixed covering codes, Des. Codes Cryptogr. 11 (1997), no. 2, 151–178.Google Scholar
[69] Fernanda, Pambianco and Leo, Storme, Unpublished manuscript, 1995.
[70] Fernanda, Pambianco and Leo, Storme, Small complete caps in spaces of even characteristic, J. Combin. Theory Ser. A 75 (1996), no. 1, 70–84.Google Scholar
[71] Giuseppe, Pellegrino, On complete caps, not ovaloids, in the space PG(3, q) with q odd, Rend. Circ. Mat. Palermo (2) 47 (1998), no. 1, 141–168.Google Scholar
[72] JÖrn, Quistorff, On codes with given minimum distance and covering radius, Beiträge Algebra Geom. 41 (2000), no. 2, 469–478.Google Scholar
[73] JÖrn, Quistorff, Correction: “On codes with given minimum distance and covering radius” [Beiträge Algebra Geom. 41 (2000), no. 2, 469–478; MR1801437 (2001i:94082)] by J. Quistorff, Beiträge Algebra Geom. 42 (2001), no. 601–611.Google Scholar
[74] Hans-Georg, Rück, A note on elliptic curves over finite fields, Math. Comp. 49 (1987), no. 179, 301–304.Google Scholar
[75] Beniamino, Segre, On complete caps and ovaloids in three-dimensional Galois spaces of characteristic two, Acta Arith. 5 (1959), 315–332.Google Scholar
[76] Beniamino, Segre, Ovali e curve s nei piani di Galois di caratteristica due., Atti Accad. Naz. Lincei Rend. Cl. Sci. Fis. Mat. Nat. (8) 32 (1962), 785–790.Google Scholar
[77] Beniamino, Segre, Introduction to Galois geometries, Atti Accad. Naz. Lincei Mem. Cl. Sci. Fis. Mat. Natur. Sez. I (8) 8 (1967), 133–236.Google Scholar
[78] Beniamino, Segre, Proprietà elementari relative ai segmenti ed alle coniche sopra un campo qualsiasi ed una congettura di Seppo Ilkka per il caso dei campi di Galois, Ann. Mat. Pura Appl. (4) 96 (1972), 289–337.Google Scholar
[79] Beniamino, Segre and Umberto, Bartocci, Ovali ed altre curve nei piani di Galois di caratteristica due, Acta Arith. 18 (1971), 423–449.Google Scholar
[80] Henning, Stichtenoth, Algebraic function fields and codes, second ed., Graduate Texts in Mathematics, vol. 254, Springer-Verlag, Berlin, 2009.
[81] René, Struik, Covering codes, Ph.D. thesis, Eindhoven University of Technology, 1994.
[82] Tamás, Szőnyi, Complete arcs in finite projective geometries, Ph.D. thesis, Univ. L. Eötvös, Budapest, 1984.
[83] Tamás, Szőnyi, Small complete arcs in Galois planes, Geom. Dedicata 18 (1985), no. 2, 161–172.Google Scholar
[84] Tamás, Szőnyi, Note on the order of magnitude of k for complete k-arcs in PG(2,q), Discrete Math. 66 (1987), no. 3, 279–282.Google Scholar
[85] Tamás, Szőnyi, Arcs in cubic curves and 3-independent subsets of abelian groups, Combinatorics (Eger, 1987), Colloq. Math. Soc. János Bolyai, vol. 52, North-Holland, Amsterdam, 1988, pp. 499–508.
[86] Tamás, Szőnyi, Complete arcs in galois planes: a survey, Quaderni del Seminario di Geometrie Combinatorie 94, Dipartimento di Matematica “G. Castelnuovo”, Università degli Studi di Roma “La Sapienza”, Roma, January 1989.
[87] Tamás, Szőnyi, Some applications of algebraic curves in finite geometry and combinatorics, Surveys in combinatorics, 1997 (London), London Math. Soc. Lecture Note Ser., vol. 241, Cambridge Univ. Press, Cambridge, 1997, pp. 197–236.
[88] Jacobus H., van Lint, Codes, Handbook of combinatorics, Vol. 1 (R. L., Graham, M., GrÖtschel, and L., Lovász, eds.), MIT Press, Cambridge, MA, USA, 1995, pp. 773–807.
[89] José Felipe, Voloch, A note on elliptic curves over finite fields, Bull. Soc. Math. France 116 (1988), no. 4, 455–458 (1989).Google Scholar
[90] José Felipe, Voloch, On the completeness of certain plane arcs. II, European J. Combin. 11 (1990), no. 5, 491–496.Google Scholar
[91] José Felipe, Voloch, Private communication, 2011.
[92] Lawrence C., Washington, Elliptic curves, second ed., Discrete Mathematics and its Applications (Boca Raton), Chapman & Hall/CRC, Boca Raton, FL, 2008, Number theory and cryptography.
[93] William C., Waterhouse, Abelian varieties over finite fields, Ann. Sci. École Norm. Sup. (4) 2 (1969), 521–560.Google Scholar

Accessibility standard: Unknown

Accessibility compliance for the PDF of this book is currently unknown and may be updated in the future.

Save book to Kindle

To save this book to your Kindle, first ensure no-reply@cambridge.org is added to your Approved Personal Document E-mail List under your Personal Document Settings on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part of your Kindle email address below. Find out more about saving to your Kindle.

Note you can select to save to either the @free.kindle.com or @kindle.com variations. ‘@free.kindle.com’ emails are free but can only be saved to your device when it is connected to wi-fi. ‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.

Find out more about the Kindle Personal Document Service.

Available formats
×

Save book to Dropbox

To save content items to your account, please confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account. Find out more about saving content to Dropbox.

Available formats
×

Save book to Google Drive

To save content items to your account, please confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account. Find out more about saving content to Google Drive.

Available formats
×