{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,16]],"date-time":"2024-09-16T13:22:25Z","timestamp":1726492945222},"reference-count":56,"publisher":"American Institute of Mathematical Sciences (AIMS)","issue":"1","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.3934\/amc.2011.5.119","type":"journal-article","created":{"date-parts":[[2011,2,11]],"date-time":"2011-02-11T00:00:58Z","timestamp":1297382458000},"page":"119-147","source":"Crossref","is-referenced-by-count":46,"title":["Linear nonbinary covering codes and saturating sets in projective spaces"],"prefix":"10.3934","volume":"5","author":[{"given":"Alexander","family":"A. Davydov","sequence":"first","affiliation":[]},{"name":",Institute for Information Transmission Problems (Kharkevich institute), Russian Academy of Sciences, GSP-4, Moscow, 127994","sequence":"first","affiliation":[]},{"given":"Massimo","family":"Giulietti","sequence":"additional","affiliation":[]},{"given":"Stefano","family":"Marcugini","sequence":"additional","affiliation":[]},{"given":"Fernanda","family":"Pambianco","sequence":"additional","affiliation":[]},{"name":",Dipartimento di Matematica e Informatica, Universit\u00e0 degli Studi di Perugia, 06123, Perugia","sequence":"additional","affiliation":[]}],"member":"2321","reference":[{"key":"1","article-title":"Covering codes for hats-on-a-line<\/em>,","volume":"13","author":"S. Aravamuthan","year":"2006","journal-title":"Electr. J. Combin."},{"key":"2","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1023\/A:1019995105405","article-title":"Bounds on the covering radius of linear codes<\/em>,","volume":"27","author":"A. Ashikhmin","year":"2002","journal-title":"Des. Codes Crypt."},{"key":"3","doi-asserted-by":"crossref","first-page":"2057","DOI":"10.1109\/18.641577","article-title":"Covering radii of ternary linear codes of small dimensions and codimensions<\/em>,","volume":"43","author":"T. S. Baicheva","year":"1997","journal-title":"IEEE Trans. Inform. Theory"},{"key":"4","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1006\/ffta.1996.9999","article-title":"On the size of a double blocking set in $PG(2,q)$<\/em>,","volume":"2","author":"S. Ball","year":"1996","journal-title":"Finite Fields Appl."},{"key":"5","doi-asserted-by":"publisher","first-page":"326","DOI":"10.1016\/j.ffa.2005.04.002","article-title":"Bounds on $(n,r)$-arcs and their application to linear codes<\/em>,","volume":"11","author":"S. Ball","year":"2005","journal-title":"Finite Fields Appl."},{"key":"6","article-title":"\"Introduction to Coding Theory,''","author":"J. Bierbrauer","year":"2005","journal-title":"Chapman & Hall\/CRC"},{"key":"7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-540-69019-1_1","article-title":"Constructing good covering codes for applications in steganography<\/em>,","author":"J. Bierbrauer","year":"2008","journal-title":"in"},{"key":"8","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1016\/j.disc.2004.12.015","article-title":"On defining sets for projective planes<\/em>,","volume":"303","author":"E. Boros","year":"2005","journal-title":"Discrete Math."},{"key":"9","first-page":"755","article-title":"Covering radius<\/em>,","author":"R. A. Brualdi","year":"1998","journal-title":"in"},{"key":"10","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1109\/18.42181","article-title":"Short codes with a given covering radius<\/em>,","volume":"35","author":"R. A. Brualdi","year":"1989","journal-title":"IEEE Trans. Inform. Theory"},{"key":"11","article-title":"\"Covering Codes,''","author":"G. Cohen","year":"1997","journal-title":"North-Holland"},{"key":"12","doi-asserted-by":"publisher","first-page":"328","DOI":"10.1109\/TIT.1985.1057043","article-title":"Covering radius - Survey and recent results<\/em>,","volume":"31","author":"G. Cohen","year":"1985","journal-title":"IEEE Trans. Inform. Theory"},{"key":"13","doi-asserted-by":"publisher","first-page":"93","DOI":"10.3934\/amc.2007.1.93","article-title":"Duality between packings and coverings of the Hamming space<\/em>,","volume":"1","author":"G. Cohen","year":"2007","journal-title":"Adv. Math. Commun."},{"key":"14","first-page":"317","article-title":"Construction of linear covering codes<\/em>,","volume":"26","author":"A. A. Davydov","year":"1990","journal-title":"Problems Inform. Transmiss."},{"key":"15","doi-asserted-by":"publisher","first-page":"2071","DOI":"10.1109\/18.476339","article-title":"Constructions and families of covering codes and saturated sets of points in projective geometry<\/em>,","volume":"41","author":"A. A. Davydov","year":"1995","journal-title":"IEEE Trans. Inform. Theory"},{"key":"16","first-page":"105","article-title":"On nonbinary linear codes with covering radius two<\/em>,","author":"A. A. Davydov","year":"1996","journal-title":"in"},{"key":"17","doi-asserted-by":"publisher","first-page":"1679","DOI":"10.1109\/18.771244","article-title":"Constructions and families of nonbinary linear codes with covering radius 2<\/em>,","volume":"45","author":"A. A. Davydov","year":"1999","journal-title":"IEEE Trans. Inform. Theory"},{"key":"18","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1023\/A:1008302507816","article-title":"New constructions of covering codes<\/em>,","volume":"22","author":"A. A. Davydov","year":"2001","journal-title":"Des. Codes Crypt."},{"key":"19","doi-asserted-by":"publisher","first-page":"1270","DOI":"10.1109\/18.335937","article-title":"Constructions, families and tables of binary linear covering codes<\/em>,","volume":"40","author":"A. A. Davydov","year":"1994","journal-title":"IEEE Trans. Inform. Theory"},{"key":"20","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1007\/s00022-004-1719-1","article-title":"Computer search in projective planes for the sizes of complete arcs<\/em>,","volume":"82","author":"A. A. Davydov","year":"2005","journal-title":"J. Geom."},{"key":"21","doi-asserted-by":"publisher","first-page":"4378","DOI":"10.1109\/TIT.2005.859297","article-title":"Locally optimal (nonshortening) linear covering codes and minimal saturating sets in projective spaces<\/em>,","volume":"51","author":"A. A. Davydov","year":"2005","journal-title":"IEEE Trans. Inform. Theory"},{"journal-title":"preprint On sizes of complete arcs in $PG(2,q)$<\/em>,","author":"A. A. Davydov","key":"22"},{"key":"23","first-page":"70","article-title":"Linear covering codes over nonbinary finite fields<\/em>,","author":"A. A. Davydov","year":"2008","journal-title":"in"},{"key":"24","first-page":"12","article-title":"Linear Covering Codes of Radius 2 and 3<\/em>,","author":"A. A. Davydov","year":"2008","journal-title":"in"},{"key":"25","doi-asserted-by":"crossref","first-page":"176","DOI":"10.1002\/jcd.20230","article-title":"New inductive constructions of complete caps in $PG(N,q)$, $q$ even<\/em>,","volume":"18","author":"A. A. Davydov","year":"2010","journal-title":"J. Combin. Des."},{"key":"26","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0097-3165(03)00052-9","article-title":"On saturating sets in projective spaces<\/em>,","volume":"103","author":"A. A. Davydov","year":"2003","journal-title":"J. Combin. Theory Ser. A"},{"key":"27","doi-asserted-by":"publisher","first-page":"537","DOI":"10.1109\/TIT.2004.825503","article-title":"Linear codes with covering radius 2,3 and saturating sets in projective geometry<\/em>,","volume":"50","author":"A. A. Davydov","year":"2004","journal-title":"IEEE Trans. Inform. Theory"},{"key":"28","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1023\/A:1008370224461","article-title":"New linear codes with covering radius 2 and odd basis<\/em>,","volume":"16","author":"A. A. Davydov","year":"1999","journal-title":"Des. Codes Crypt."},{"key":"29","doi-asserted-by":"publisher","first-page":"164","DOI":"10.1006\/ffta.1999.0271","article-title":"New quaternary linear codes with covering radius 2<\/em>,","volume":"6","author":"A. A. Davydov","year":"2000","journal-title":"Finite Fields Appl."},{"key":"30","doi-asserted-by":"publisher","first-page":"563","DOI":"10.1006\/eujc.1999.0373","article-title":"On saturating sets in small projective geometries<\/em>,","volume":"21","author":"A. A. Davydov","year":"2000","journal-title":"European J. Combin."},{"key":"31","doi-asserted-by":"publisher","first-page":"416","DOI":"10.1109\/18.904551","article-title":"Linear codes with covering radius $R=2,3$ and codimension $tR$<\/em>,","volume":"47","author":"A. A. Davydov","year":"2001","journal-title":"IEEE Trans. Inform. Theory"},{"key":"32","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1007\/s10623-009-9322-y","article-title":"Linear codes with covering radius 3<\/em>,","volume":"54","author":"A. A. Davydov","year":"2010","journal-title":"Des. Codes Crypt."},{"key":"33","doi-asserted-by":"publisher","first-page":"3938","DOI":"10.1109\/TIT.2005.856944","article-title":"Quasi-perfect codes with small distance<\/em>,","volume":"51","author":"T. Etzion","year":"2005","journal-title":"IEEE Trans. Inform. Theory"},{"key":"34","first-page":"92","article-title":"Constructions for identifying codes<\/em>,","author":"G. Exoo","year":"2008","journal-title":"in"},{"key":"35","doi-asserted-by":"publisher","first-page":"2534","DOI":"10.1109\/18.796399","article-title":"On the Newton and covering radii of linear codes<\/em>,","volume":"45","author":"E. M. Gabidulin","year":"1999","journal-title":"IEEE Trans. Inform. Theory"},{"key":"36","first-page":"151","article-title":"Information hiding by coverings<\/em>,","author":"F. Galand","year":"2003","journal-title":"in"},{"key":"37","article-title":"On small dense sets in Galois planes<\/em>,","volume":"14","author":"M. Giulietti","year":"2007","journal-title":"Electr. J. Combin."},{"key":"38","doi-asserted-by":"publisher","first-page":"420","DOI":"10.1002\/jcd.20131","article-title":"Small complete caps in $PG(N,q)$, $q$ even<\/em>,","volume":"15","author":"M. Giulietti","year":"2007","journal-title":"J. Combin. Des."},{"journal-title":"in preparation.","article-title":"Arcs in $PG(2,q)$ left invariant by $A_6$<\/em>,","author":"M. Giulietti","key":"39"},{"key":"40","first-page":"33","article-title":"On dense sets related to plane algebraic curves<\/em>,","volume":"72","author":"M. Giulietti","year":"2004","journal-title":"Ars. Combin."},{"key":"41","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1109\/TIT.1985.1057039","article-title":"On the covering radius of codes<\/em>,","volume":"31","author":"R. L. Graham","year":"1985","journal-title":"IEEE Trans. Inform. Theory"},{"key":"42","article-title":"\"Projective Geometries over Finite Fields,'' $2^{nd}$ edition,","author":"J. W. P. Hirschfeld","year":"1998","journal-title":"Oxford University Press"},{"key":"43","doi-asserted-by":"publisher","first-page":"355","DOI":"10.1016\/S0378-3758(98)00043-3","article-title":"The packing problem in statistics, coding theory and finite projective spaces<\/em>,","volume":"72","author":"J. W. P. Hirschfeld","year":"1998","journal-title":"J. Statist. Planning Infer."},{"key":"44","doi-asserted-by":"publisher","first-page":"1326","DOI":"10.1109\/12.737680","article-title":"Partial-sum queries in OLAP data cubes using covering codes<\/em>,","volume":"47","author":"C. T. Ho","year":"1998","journal-title":"IEEE Trans. Computers"},{"key":"45","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1016\/0012-365X(92)90556-U","article-title":"On lengthening of covering codes<\/em>,","volume":"106\/107","author":"I. S. Honkala","year":"1992","journal-title":"Discrete Math."},{"key":"46","first-page":"261","article-title":"Unit sphere packings and coverings of the Hamming space<\/em>,","volume":"24","author":"G. A. Kabatyansky","year":"1988","journal-title":"Problems Inform. Transmiss."},{"key":"47","first-page":"77","article-title":"A note on a geometric construction of large Cayley graphs of given degree and diameter<\/em>,","volume":"54","author":"G. Kiss","year":"2009","journal-title":"Studia Univ. Babe\u015f-Bolyai Math."},{"key":"48","first-page":"157","article-title":"Small saturated sets in finite projective planes<\/em>,","volume":"12","author":"S. J. Kov\u00e1cs","year":"1992","journal-title":"Rend. Mat. Ser. VII"},{"key":"49","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1016\/S0012-365X(99)00183-1","article-title":"Linear codes over finite fields and finite projective geometries<\/em>,","volume":"213","author":"I. N. Landjev","year":"2000","journal-title":"Discrete Math."},{"journal-title":"a bibliography","article-title":"Covering radius<\/em>,","author":"A. Lobstein","key":"50"},{"key":"51","article-title":"\"The Theory of Error-Correcting Codes,''","author":"F. J. MacWilliams","year":"1977","journal-title":"North-Holland"},{"key":"52","first-page":"161","article-title":"Minimal 1-saturating sets in $PG(2,q)$, $q\\leq 16$<\/em>,","volume":"28","author":"S. Marcugini","year":"2003","journal-title":"Australas. J. Combin."},{"key":"53","first-page":"51","article-title":"New constructions for $q$-ary covering codes<\/em>,","volume":"52","author":"P. R. J. \u00d6sterg\u00e5rd","year":"1999","journal-title":"Ars Combin."},{"key":"54","first-page":"3","article-title":"An introduction to algebraic codes<\/em>,","author":"V. S. Pless","year":"1998","journal-title":"in"},{"key":"55","article-title":"\"Covering Codes,''","author":"R. Struik","year":"1994","journal-title":"Ph.D thesis"},{"key":"56","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1016\/S0195-6698(87)80039-2","article-title":"Saturated configurations of points in projective Galois spaces<\/em>,","volume":"8","author":"E. Ughi","year":"1987","journal-title":"European J. Combin."}],"container-title":["Advances in Mathematics of Communications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.aimsciences.org\/article\/exportPdf?id=007d4a88-8158-4792-9be5-d523d31ede83","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,4,4]],"date-time":"2024-04-04T02:07:56Z","timestamp":1712196476000},"score":1,"resource":{"primary":{"URL":"http:\/\/aimsciences.org\/\/article\/doi\/10.3934\/amc.2011.5.119"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"references-count":56,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2011]]}},"URL":"https:\/\/doi.org\/10.3934\/amc.2011.5.119","relation":{},"ISSN":["1930-5338"],"issn-type":[{"type":"print","value":"1930-5338"}],"subject":[],"published":{"date-parts":[[2011]]}}}