{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T10:45:27Z","timestamp":1725533127700},"publisher-location":"Berlin, Heidelberg","reference-count":4,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642021800"},{"type":"electronic","value":"9783642021817"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-02181-7_23","type":"book-chapter","created":{"date-parts":[[2009,6,6]],"date-time":"2009-06-06T01:43:20Z","timestamp":1244252600000},"page":"215-218","source":"Crossref","is-referenced-by-count":0,"title":["Interesting Examples on Maximal Irreducible Goppa Codes"],"prefix":"10.1007","author":[{"given":"Marta","family":"Giorgetti","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"23_CR1","doi-asserted-by":"publisher","first-page":"766","DOI":"10.1109\/TIT.1978.1055951","volume":"24","author":"C.-L. Chen","year":"1978","unstructured":"Chen, C.-L.: Equivalent irreducible Goppa codes. IEEE Trans. Inf. Theory\u00a024, 766\u2013770 (1978)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"23_CR2","unstructured":"Dalla Volta, F., Giorgetti, M., Sala, M.: Permutation equivalent maximal irreducible Goppa codes. Designs, Codes and Cryptography (submitted), http:\/\/arxiv.org\/abs\/0806.1763"},{"key":"23_CR3","doi-asserted-by":"crossref","unstructured":"Ryan, J.A., Magamba, K.: Equivalent irreducible Goppa codes and the precise number of quintic Goppa codes of length 32. In: AFRICON 2007, September 26-28, pp. 1\u20134 (2007)","DOI":"10.1109\/AFRCON.2007.4401625"},{"key":"23_CR4","unstructured":"Ryan, J.: Irreducible Goppa codes, Ph.D. Thesis, University College Cork, Cork, Ireland (2002)"}],"container-title":["Lecture Notes in Computer Science","Applied Algebra, Algebraic Algorithms and Error-Correcting Codes"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-02181-7_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,20]],"date-time":"2019-05-20T18:30:01Z","timestamp":1558377001000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-02181-7_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642021800","9783642021817"],"references-count":4,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-02181-7_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}