{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,28]],"date-time":"2026-02-28T12:58:57Z","timestamp":1772283537129,"version":"3.50.1"},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2009,8,30]],"date-time":"2009-08-30T00:00:00Z","timestamp":1251590400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Des. Codes Cryptogr."],"published-print":{"date-parts":[[2010,3]]},"DOI":"10.1007\/s10623-009-9322-y","type":"journal-article","created":{"date-parts":[[2009,8,29]],"date-time":"2009-08-29T02:43:56Z","timestamp":1251513836000},"page":"253-271","source":"Crossref","is-referenced-by-count":10,"title":["Linear codes with covering radius 3"],"prefix":"10.1007","volume":"54","author":[{"given":"Alexander A.","family":"Davydov","sequence":"first","affiliation":[]},{"given":"Patric R. J.","family":"\u00d6sterg\u00e5rd","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2009,8,30]]},"reference":[{"key":"9322_CR1","unstructured":"Baicheva T.S., Velikova E.D.: Covering radii of ternary linear codes of small dimensions and codimensions. IEEE Trans. Inform. Theory 43, 2057\u20132061 (1997); and 44, 2032 (1998)."},{"key":"9322_CR2","first-page":"755","volume-title":"Handbook of Coding Theory, vol 1","author":"R.A Brualdi","year":"1998","unstructured":"Brualdi R.A, Litsyn S., Pless V.S.: Covering radius. In: Pless, V.S., Huffman, W.C., Brualdi, R.A. (eds) Handbook of Coding Theory, vol 1, pp. 755\u2013826. Elsevier, Amsterdam (1998)"},{"key":"9322_CR3","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1109\/18.42181","volume":"35","author":"R.A. Brualdi","year":"1989","unstructured":"Brualdi R.A., Pless V.S., Wilson R.M.: Short codes with a given covering radius. IEEE Trans. Inform. Theory 35, 99\u2013109 (1989)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"9322_CR4","doi-asserted-by":"crossref","first-page":"283","DOI":"10.1006\/jcta.1997.2825","volume":"80","author":"J.C. Cock","year":"1997","unstructured":"Cock J.C., \u00d6sterg\u00e5rd P.R.J.: Ternary covering codes derived from BCH codes. J. Combin. Theory. Ser. A 80, 283\u2013289 (1997)","journal-title":"J. Combin. Theory. Ser. A"},{"key":"9322_CR5","volume-title":"Covering Codes","author":"G. Cohen","year":"1997","unstructured":"Cohen G., Honkala I., Litsyn S., Lobstein A.: Covering Codes. North-Holland, Amsterdam (1997)"},{"key":"9322_CR6","doi-asserted-by":"crossref","first-page":"2071","DOI":"10.1109\/18.476339","volume":"41","author":"A.A. Davydov","year":"1995","unstructured":"Davydov A.A.: Constructions and families of covering codes and saturated sets of points in projective geometry. IEEE Trans. Inform. Theory 41, 2071\u20132080 (1995)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"9322_CR7","doi-asserted-by":"crossref","first-page":"1679","DOI":"10.1109\/18.771244","volume":"45","author":"A.A. Davydov","year":"1999","unstructured":"Davydov A.A.: Constructions and families of nonbinary linear codes with covering radius 2. IEEE Trans. Inform. Theory 45, 1679\u20131686 (1999)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"9322_CR8","doi-asserted-by":"crossref","first-page":"4378","DOI":"10.1109\/TIT.2005.859297","volume":"51","author":"A.A. Davydov","year":"2005","unstructured":"Davydov A.A., Faina G., Marcugini S., Pambianco F.: Locally optimal (nonshortening) linear covering codes and minimal saturating sets in projective spaces. IEEE Trans. Inform. Theory 51, 4378\u20134387 (2005)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"9322_CR9","unstructured":"Davydov A.A., Giulietti M., Marcugini S., Pambianco F.: Linear covering codes of radius 2 and 3. In: Proc. Workshop Coding Theory Days in St. Petersburg, pp. 12\u201317. St. Petersburg, Russia (2008)."},{"key":"9322_CR10","unstructured":"Davydov A.A., Giulietti M., Marcugini S., Pambianco F.: Linear covering codes over nonbinary finite fields. In: Proc. XI Int. Workshop Algebraic Comb. Coding Theory, ACCT2008, pp. 70\u201375. Pamporovo, Bulgaria (2008)."},{"key":"9322_CR11","doi-asserted-by":"crossref","first-page":"537","DOI":"10.1109\/TIT.2004.825503","volume":"50","author":"A.A. Davydov","year":"2004","unstructured":"Davydov A.A., Marcugini S., Pambianco F.: Linear codes with covering radius 2, 3 and saturating sets in projective geometry. IEEE Trans. Inform. Theory 50, 537\u2013541 (2004)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"9322_CR12","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1023\/A:1008370224461","volume":"16","author":"A.A. Davydov","year":"1999","unstructured":"Davydov A.A., \u00d6sterg\u00e5rd P.R.J.: New linear codes with covering radius 2 and odd basis. Des. Codes Cryptogr. 16, 29\u201339 (1999)","journal-title":"Des. Codes Cryptogr."},{"key":"9322_CR13","doi-asserted-by":"crossref","first-page":"164","DOI":"10.1006\/ffta.1999.0271","volume":"6","author":"A.A. Davydov","year":"2000","unstructured":"Davydov A.A., \u00d6sterg\u00e5rd P.R.J.: New quaternary linear codes with covering radius 2. Finite Fields Appl. 6, 164\u2013174 (2000)","journal-title":"Finite Fields Appl."},{"key":"9322_CR14","doi-asserted-by":"crossref","first-page":"563","DOI":"10.1006\/eujc.1999.0373","volume":"21","author":"A.A. Davydov","year":"2000","unstructured":"Davydov A.A., \u00d6sterg\u00e5rd P.R.J.: On saturating sets in small projective geometries. Eur. J. Combin. 21, 563\u2013570 (2000)","journal-title":"Eur. J. Combin."},{"key":"9322_CR15","doi-asserted-by":"crossref","first-page":"416","DOI":"10.1109\/18.904551","volume":"47","author":"A.A. Davydov","year":"2001","unstructured":"Davydov A.A., \u00d6sterg\u00e5rd P.R.J.: Linear codes with covering radius R\u00a0=\u00a02, 3 and codimension t R. IEEE Trans. Inform. Theory 47, 416\u2013421 (2001)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"9322_CR16","first-page":"55","volume-title":"Surveys in Combinatorics, London Math. Soc. Lecture Note Ser., vol. 82","author":"J.W.P. Hirschfeld","year":"1983","unstructured":"Hirschfeld J.W.P.: Maximum sets in finite projective spaces. In: Lloyd, E.K. (eds) Surveys in Combinatorics, London Math. Soc. Lecture Note Ser., vol. 82, pp. 55\u201376. Cambridge University Press, Cambridge (1983)"},{"key":"9322_CR17","doi-asserted-by":"crossref","DOI":"10.1093\/oso\/9780198502951.001.0001","volume-title":"Projective Geometries over Finite Fields","author":"J.W.P. Hirschfeld","year":"1998","unstructured":"Hirschfeld J.W.P.: Projective Geometries over Finite Fields, 2nd edn. Oxford University Press, Oxford (1998)","edition":"2"},{"key":"9322_CR18","doi-asserted-by":"crossref","first-page":"355","DOI":"10.1016\/S0378-3758(98)00043-3","volume":"72","author":"J.W.P. Hirschfeld","year":"1998","unstructured":"Hirschfeld J.W.P., Storme L.: The packing problem in statistics, coding theory and finite projective spaces. J. Stat. Plan. Inference 72, 355\u2013380 (1998)","journal-title":"J. Stat. Plan. Inference"},{"key":"9322_CR19","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1023\/A:1019903407222","volume":"27","author":"P.R.J. \u00d6sterg\u00e5rd","year":"2002","unstructured":"\u00d6sterg\u00e5rd P.R.J.: Classifying subspaces of Hamming spaces. Des. Codes Cryptogr. 27, 297\u2013305 (2002)","journal-title":"Des. Codes Cryptogr."}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-009-9322-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10623-009-9322-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-009-9322-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,16]],"date-time":"2024-03-16T05:14:58Z","timestamp":1710566098000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10623-009-9322-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,8,30]]},"references-count":19,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2010,3]]}},"alternative-id":["9322"],"URL":"https:\/\/doi.org\/10.1007\/s10623-009-9322-y","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"value":"0925-1022","type":"print"},{"value":"1573-7586","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,8,30]]}}}