{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:22:26Z","timestamp":1740122546253,"version":"3.37.3"},"reference-count":34,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2022,1,25]],"date-time":"2022-01-25T00:00:00Z","timestamp":1643068800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,25]],"date-time":"2022-01-25T00:00:00Z","timestamp":1643068800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Des. Codes Cryptogr."],"published-print":{"date-parts":[[2022,3]]},"DOI":"10.1007\/s10623-021-00990-5","type":"journal-article","created":{"date-parts":[[2022,1,25]],"date-time":"2022-01-25T00:02:51Z","timestamp":1643068971000},"page":"523-543","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["From primary to dual affine variety codes over the Klein quartic"],"prefix":"10.1007","volume":"90","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-9666-3399","authenticated-orcid":false,"given":"Olav","family":"Geil","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,1,25]]},"reference":[{"key":"990_CR1","doi-asserted-by":"crossref","unstructured":"Aly S.A., Klappenecker A., Sarvepalli P.K.: Remarkable degenerate quantum stabilizer codes derived from duadic codes. In: 2006 IEEE International Symposium on Information Theory, pp. 1105\u20131108 (2006).","DOI":"10.1109\/ISIT.2006.261955"},{"issue":"3","key":"990_CR2","doi-asserted-by":"publisher","first-page":"665","DOI":"10.1016\/j.ffa.2006.09.006","volume":"13","author":"P Beelen","year":"2007","unstructured":"Beelen P.: The order bound for general algebraic geometric codes. Finite Fields Appl. 13(3), 665\u2013680 (2007).","journal-title":"Finite Fields Appl."},{"key":"990_CR3","doi-asserted-by":"publisher","first-page":"130","DOI":"10.1016\/j.ffa.2018.01.006","volume":"51","author":"P Beelen","year":"2018","unstructured":"Beelen P., Datta M.: Generalized Hamming weights of affine Cartesian codes. Finite Fields Appl. 51, 130\u2013145 (2018).","journal-title":"Finite Fields Appl."},{"key":"990_CR4","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1016\/j.jsc.2017.11.008","volume":"89","author":"C Carvalho","year":"2018","unstructured":"Carvalho C., Chara M., Quoos L.: On evaluation codes coming from a tower of function fields. J. Symbolic Comput. 89, 121\u2013128 (2018).","journal-title":"J. Symbolic Comput."},{"key":"990_CR5","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-41154-4","volume-title":"Ideals, Varieties, and Algorithms: An Introduction to Computational Algebraic Geometry and Commutative Algebra","author":"DA Cox","year":"1997","unstructured":"Cox D.A., Little J., O\u2019Shea D.: Ideals, Varieties, and Algorithms: An Introduction to Computational Algebraic Geometry and Commutative Algebra, vol. 10. Springer, New York (1997)."},{"key":"990_CR6","doi-asserted-by":"crossref","unstructured":"Duursma I.M., Kirov R.: An extension of the order bound for AG codes. In: Applied Algebra, Algebraic Algorithms, and Error-Correcting Codes. Lecture Notes in Comput. Sci., vol. 5527, pp. 11\u201322. Springer, Berlin (2009).","DOI":"10.1007\/978-3-642-02181-7_2"},{"issue":"8","key":"990_CR7","doi-asserted-by":"publisher","first-page":"1863","DOI":"10.1016\/j.jpaa.2010.10.018","volume":"215","author":"IM Duursma","year":"2011","unstructured":"Duursma I.M., Kirov R., Park S.: Distance bounds for algebraic geometric codes. J. Pure Appl. Algebra 215(8), 1863\u20131878 (2011).","journal-title":"J. Pure Appl. Algebra"},{"issue":"1","key":"990_CR8","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1016\/j.ffa.2009.11.006","volume":"16","author":"IM Duursma","year":"2010","unstructured":"Duursma I.M., Park S.: Coset bounds for algebraic geometric codes. Finite Fields Appl. 16(1), 36\u201355 (2010).","journal-title":"Finite Fields Appl."},{"key":"990_CR9","unstructured":"Ezerman M.F.: Quantum error-control codes. arxiv:2009.05735 (2020)."},{"issue":"1","key":"990_CR10","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1007\/s10623-013-9885-5","volume":"75","author":"MF Ezerman","year":"2015","unstructured":"Ezerman M.F., Jitman S., Sol\u00e9 P.: Xing-Ling codes, duals of their subcodes, and good asymmetric quantum codes. Des. Codes Cryptogr. 75(1), 21\u201342 (2015).","journal-title":"Des. Codes Cryptogr."},{"issue":"1","key":"990_CR11","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1109\/18.179340","volume":"39","author":"GL Feng","year":"1993","unstructured":"Feng G.L., Rao T.R.N.: Decoding algebraic-geometric codes up to the designed minimum distance. IEEE Trans. Inf. Theory 39(1), 37\u201345 (1993).","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"4","key":"990_CR12","doi-asserted-by":"publisher","first-page":"1003","DOI":"10.1109\/18.335972","volume":"40","author":"GL Feng","year":"1994","unstructured":"Feng G.L., Rao T.R.N.: A simple approach for construction of algebraic-geometric codes from affine plane curves. IEEE Trans. Inf. Theory 40(4), 1003\u20131012 (1994).","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"6","key":"990_CR13","doi-asserted-by":"publisher","first-page":"1678","DOI":"10.1109\/18.476241","volume":"41","author":"GL Feng","year":"1995","unstructured":"Feng G.L., Rao T.R.N.: Improved geometric Goppa codes part I: basic theory. IEEE Trans. Inf. Theory 41(6), 1678\u20131693 (1995).","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"2","key":"990_CR14","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1023\/A:1008274212057","volume":"13","author":"J Fitzgerald","year":"1998","unstructured":"Fitzgerald J., Lax R.F.: Decoding affine variety codes using Gr\u00f6bner bases. Des. Codes Cryptogr. 13(2), 147\u2013158 (1998).","journal-title":"Des. Codes Cryptogr."},{"issue":"8","key":"990_CR15","doi-asserted-by":"publisher","first-page":"1653","DOI":"10.1007\/s10623-020-00764-5","volume":"88","author":"I Garc\u00eda-Marco","year":"2020","unstructured":"Garc\u00eda-Marco I., M\u00e1rquez-Corbella I., Ruano D.: High dimensional affine codes whose square has a designed minimum distance. Des. Codes Cryptogr. 88(8), 1653\u20131672 (2020).","journal-title":"Des. Codes Cryptogr."},{"key":"990_CR16","doi-asserted-by":"crossref","unstructured":"Geil O.: Evaluation codes from an affine variety code perspective. In: Advances in Algebraic Geometry Codes, Ser. Coding Theory Cryptol., vol. 5, pp. 153\u2013180. World Sci. Publ., Hackensack (2008).","DOI":"10.1142\/9789812794017_0004"},{"key":"990_CR17","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1016\/j.ffa.2014.05.006","volume":"30","author":"O Geil","year":"2014","unstructured":"Geil O., Martin S.: Further improvements on the Feng-Rao bound for dual codes. Finite Fields Appl. 30, 33\u201348 (2014).","journal-title":"Finite Fields Appl."},{"issue":"1","key":"990_CR18","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1007\/s10623-014-9983-z","volume":"76","author":"O Geil","year":"2015","unstructured":"Geil O., Martin S.: An improvement of the Feng-Rao bound for primary codes. Des. Codes Cryptogr. 76(1), 49\u201379 (2015).","journal-title":"Des. Codes Cryptogr."},{"key":"990_CR19","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1016\/j.ffa.2013.03.005","volume":"23","author":"O Geil","year":"2013","unstructured":"Geil O., Matsumoto R., Ruano D.: Feng-Rao decoding of primary codes. Finite Fields Appl. 23, 35\u201352 (2013).","journal-title":"Finite Fields Appl."},{"issue":"2","key":"990_CR20","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1007\/s12095-018-0285-6","volume":"11","author":"O Geil","year":"2019","unstructured":"Geil O., \u00d6zbudak F.: On affine variety codes from the Klein quartic. Cryptogr. Commun. 11(2), 237\u2013257 (2019).","journal-title":"Cryptogr. Commun."},{"key":"990_CR21","unstructured":"Grassl M.: Bounds on the minimum distance of linear codes and quantum codes. http:\/\/www.codetables.de (2018). Accessed July 15 2021."},{"key":"990_CR22","doi-asserted-by":"crossref","unstructured":"Grassl M., Lu S., Zeng B.: Codes for simultaneous transmission of quantum and classical information. In: 2017 IEEE International Symposium on Information Theory (ISIT), pp. 1718\u20131722 (2017).","DOI":"10.1109\/ISIT.2017.8006823"},{"key":"990_CR23","doi-asserted-by":"crossref","unstructured":"H\u00f8holdt T.: On (or in) Dick Blahut\u2019s\u2019 footprint\u2019. Codes, Curves and Signals, pp. 3\u20139 (1998).","DOI":"10.1007\/978-1-4615-5121-8_1"},{"key":"990_CR24","first-page":"871","volume-title":"Handbook of Coding Theory","author":"T H\u00f8holdt","year":"1998","unstructured":"H\u00f8holdt T., van Lint J.H., Pellikaan R.: Algebraic geometry codes. In: Pless V.S., Huffman W.C. (eds.) Handbook of Coding Theory, vol. 1, pp. 871\u2013961. Elsevier, Amsterdam (1998)."},{"issue":"3","key":"990_CR25","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.75.032345","volume":"75","author":"L Ioffe","year":"2007","unstructured":"Ioffe L., M\u00e9zard M.: Asymmetric quantum error-correcting codes. Phys. Rev. A 75(3), 032345 (2007).","journal-title":"Phys. Rev. A"},{"issue":"6","key":"990_CR26","doi-asserted-by":"publisher","first-page":"433","DOI":"10.1007\/s002009900018","volume":"10","author":"MS Kolluru","year":"2000","unstructured":"Kolluru M.S., Feng G.L., Rao T.R.N.: Construction of improved geometric Goppa codes om Klein curves and Klein-like curves. Appl. Algebra Eng. Commun. Comput. 10(6), 433\u2013464 (2000).","journal-title":"Appl. Algebra Eng. Commun. Comput."},{"issue":"7","key":"990_CR27","doi-asserted-by":"publisher","first-page":"1367","DOI":"10.1007\/s10623-021-00872-w","volume":"89","author":"HH L\u00f3pez","year":"2021","unstructured":"L\u00f3pez H.H., Soprunov I., Villarreal R.H.: The dual of an evaluation code. Des. Codes Cryptogr. 89(7), 1367\u20131403 (2021).","journal-title":"Des. Codes Cryptogr."},{"issue":"12","key":"990_CR28","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1007\/s11128-017-1748-y","volume":"16","author":"R Matsumoto","year":"2017","unstructured":"Matsumoto R.: Two Gilbert-Varshamov-type existential bounds for asymmetric quantum error-correcting codes. Quantum Inf. Process. 16(12), 285 (2017).","journal-title":"Quantum Inf. Process."},{"key":"990_CR29","first-page":"926","volume":"5","author":"R Matsumoto","year":"2000","unstructured":"Matsumoto R., Miura S.: On the Feng-Rao bound for the $${\\cal{L}}$$-construction of algebraic geometry codes. IEICE Trans. Fundam. 5, 926\u2013930 (2000) E83-A.","journal-title":"IEICE Trans. Fundam."},{"key":"990_CR30","first-page":"1398","volume":"10","author":"S Miura","year":"1998","unstructured":"Miura S.: Linear codes on affine algebraic curves. Trans. IEICE 10, 1398\u20131421 (1998) J81-A.","journal-title":"Trans. IEICE"},{"key":"990_CR31","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1134\/S0032946021010051","volume":"57","author":"N Patanker","year":"2021","unstructured":"Patanker N., Singh S.K.: Affine variety codes over a hyperelliptic curve. Probl. Inf. Transm. 57, 84\u201397 (2021).","journal-title":"Probl. Inf. Transm."},{"key":"990_CR32","doi-asserted-by":"crossref","unstructured":"Pellikaan R.: On the efficient decoding of algebraic-geometric codes. In: Eurocode \u201992 (Udine, 1992), CISM Courses and Lect., vol. 339, pp. 231\u2013253. Springer, Vienna (1993).","DOI":"10.1007\/978-3-7091-2786-5_20"},{"key":"990_CR33","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1016\/j.ffa.2003.10.004","volume":"12","author":"G Salazar","year":"2006","unstructured":"Salazar G., Dunn D., Graham S.B.: An improvement of the Feng-Rao bound on minimum distance. Finite Fields Appl. 12, 313\u2013335 (2006).","journal-title":"Finite Fields Appl."},{"key":"990_CR34","doi-asserted-by":"crossref","unstructured":"Sarvepalli P.K., Klappenecker A., R\u00f6tteler M.: Asymmetric quantum codes: constructions, bounds and performance. In: Proc. R. Soc. Lond. Ser. A: Math. Phys. Eng. Sci., vol. 465, pp. 1645\u20131672. The Royal Society (2009).","DOI":"10.1098\/rspa.2008.0439"}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-021-00990-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10623-021-00990-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-021-00990-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,3,7]],"date-time":"2022-03-07T10:08:34Z","timestamp":1646647714000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10623-021-00990-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,1,25]]},"references-count":34,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2022,3]]}},"alternative-id":["990"],"URL":"https:\/\/doi.org\/10.1007\/s10623-021-00990-5","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"type":"print","value":"0925-1022"},{"type":"electronic","value":"1573-7586"}],"subject":[],"published":{"date-parts":[[2022,1,25]]},"assertion":[{"value":"19 July 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 November 2021","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 November 2021","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 January 2022","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}