{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T14:11:19Z","timestamp":1725459079558},"publisher-location":"Berlin\/Heidelberg","reference-count":7,"publisher":"Springer-Verlag","isbn-type":[{"type":"print","value":"3540516433"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0019844","type":"book-chapter","created":{"date-parts":[[2006,1,12]],"date-time":"2006-01-12T11:48:27Z","timestamp":1137066507000},"page":"28-36","source":"Crossref","is-referenced-by-count":1,"title":["Families of codes exceeding the Varshamov-Gilbert bound"],"prefix":"10.1007","author":[{"given":"Marc","family":"Perret","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"3_CR1","unstructured":"Lachaud, G.: \"Les codes g\u00e9om\u00e9triques de Goppa\", S\u00e9minaire Bourbaki, 1984\u201385, expos\u00e9 no 641, Ast\u00e9risque 133\u2013134, 1986."},{"key":"3_CR2","first-page":"715","volume":"28","author":"Y. I. Manin","year":"1981","unstructured":"Manin, Yu, I.: \"What is the maximum number of points of a curve over F2 ?\", J. Fac. Sci. Tokyo, I., A., 28, 1981, p. 715\u2013720.","journal-title":"J. Fac. Sci. Tokyo, I., A."},{"key":"3_CR3","doi-asserted-by":"crossref","unstructured":"Manin, Vladut: \"Linear codes and modular curves\", English translation in J.of Soviet Maths, Vol. 30, no 6, p. 2611\u20132643.","DOI":"10.1007\/BF02249124"},{"key":"3_CR4","unstructured":"Michon, J.F.: \"Geom\u00e9trie alg\u00e9brique et codes\", p. 301\u2013318 in poli, A., Huguet, Li., Codes Correcteurs, Paris Masson, 1989."},{"key":"3_CR5","unstructured":"Perret, M.: \"Sur le nombre de points d'une courbe sur un corps fini \u2014 Application aux codes correcteurs d'erreurs\", C.R. Acad. Sci. Paris, \u00e0 para\u00eetre."},{"key":"3_CR6","first-page":"3","volume":"18","author":"M.A. Tsfasman","year":"1982","unstructured":"Tsfasman, M.A.: \"Goppa codes that are better than the Varshamov-Gilbert bound\", Prob-Peredatchi Inform, 18, 1982, p. 3\u20136, Traduction anglaise: Prob. Inform. Trans., 18, 1982, p. 163\u2013166.","journal-title":"Prob-Peredatchi Inform"},{"key":"3_CR7","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1002\/mana.19821090103","volume":"109","author":"V. Tsfasman","year":"1982","unstructured":"Tsfasman, Vladut & Zink: \"Modular curves, Shimura curves, and Goppa codes that are better than the Varshamov-Gilbert bound\", Math-Nachr, 109, 1982, p. 163\u2013166.","journal-title":"Math-Nachr"}],"container-title":["Lecture Notes in Computer Science","Coding Theory and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/www.springerlink.com\/index\/pdf\/10.1007\/BFb0019844","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,12]],"date-time":"2020-04-12T02:31:11Z","timestamp":1586658671000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0019844"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["3540516433"],"references-count":7,"URL":"https:\/\/doi.org\/10.1007\/bfb0019844","relation":{},"subject":[]}}