{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T19:12:42Z","timestamp":1743102762392,"version":"3.40.3"},"publisher-location":"Cham","reference-count":15,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319662770"},{"type":"electronic","value":"9783319662787"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-66278-7_17","type":"book-chapter","created":{"date-parts":[[2017,8,22]],"date-time":"2017-08-22T09:34:12Z","timestamp":1503394452000},"page":"207-216","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Relative Generalized Hamming Weights and Extended Weight Polynomials of Almost Affine Codes"],"prefix":"10.1007","author":[{"given":"Trygve","family":"Johnsen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hugues","family":"Verdure","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,8,23]]},"reference":[{"issue":"3","key":"17_CR1","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1007\/s10623-011-9524-y","volume":"62","author":"T Britz","year":"2012","unstructured":"Britz, T., Johnsen, T., Mayhew, D., Shiromoto, K.: Wei-type duality theorems for matroids. Des. Codes Cryptogr. 62(3), 331\u2013341 (2012)","journal-title":"Des. Codes Cryptogr."},{"issue":"6","key":"17_CR2","doi-asserted-by":"publisher","first-page":"1741","DOI":"10.1109\/18.340452","volume":"40","author":"GF Forney","year":"1994","unstructured":"Forney, G.F.: Dimension\/length profiles and trellis complexity of linear block codes. IEEE Trans. Inform. Theory 40(6), 1741\u20131752 (1994)","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"10","key":"17_CR3","doi-asserted-by":"publisher","first-page":"5938","DOI":"10.1109\/TIT.2014.2345375","volume":"60","author":"O Geil","year":"2014","unstructured":"Geil, O., Martin, S., Matsumoto, R., Ruano, D.: Relative generalized Hamming weights of one-point algebraic geometric codes. IEEE Trans. Inform. Theory 60(10), 5938\u201349 (2014)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"17_CR4","unstructured":"Huerga Represa, V.: Towers of Betti Numbers of Matroids and Weight Distribution of Linear Codes and their Duals, Master\u2019s thesis in Pure Mathematics, University of Troms\u00f8 - The Arctic University of Norway (2015). http:\/\/hdl.handle.net\/10037\/7736"},{"issue":"3","key":"17_CR5","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1007\/s10623-011-9557-2","volume":"63","author":"RPMJ Jurrius","year":"2012","unstructured":"Jurrius, R.P.M.J.: Weight enumeration of codes from finite spaces Des. Codes Crypt. 63(3), 321\u2013330 (2012)","journal-title":"Codes Crypt."},{"key":"17_CR6","unstructured":"Jurrius, R.P.M.J., Pellikaan, G.R.: Algebraic geometric modeling in information theory. In: Codes, arrangements and matroids. Seroes on Coding Theory and Cryptology. World Scientific Publishing, Hackensack (2001)"},{"issue":"2","key":"17_CR7","doi-asserted-by":"publisher","first-page":"632","DOI":"10.1016\/j.disc.2015.10.005","volume":"339","author":"T Johnsen","year":"2016","unstructured":"Johnsen, T., Roksvold, J., Verdure, H.: Generalized weight polynomials of matroids. Discrete Math. 339(2), 632\u2013645 (2016)","journal-title":"Discrete Math."},{"issue":"1","key":"17_CR8","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1007\/s00200-012-0183-7","volume":"24","author":"T Johnsen","year":"2013","unstructured":"Johnsen, T., Verdure, H.: Hamming weights of linear codes and Betti numbers of Stanley-Reisner rings associated to matroids. Appl. Algebra Engrg. Comm. Comput. 24(1), 73\u201393 (2013)","journal-title":"Appl. Algebra Engrg. Comm. Comput."},{"issue":"4","key":"17_CR9","doi-asserted-by":"publisher","first-page":"1941","DOI":"10.1109\/TIT.2017.2654456","volume":"63","author":"T Johnsen","year":"2017","unstructured":"Johnsen, T., Verdure, H.: Generalized Hamming weights for almost affine codes. IEEE Trans. Inform. Theory 63(4), 1941\u20131953 (2017)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"17_CR10","unstructured":"Johnsen, T., Verdure, H.: Flags of almost affine codes, arXiv:1704.02819 (2017)"},{"issue":"11","key":"17_CR11","doi-asserted-by":"publisher","first-page":"2067","DOI":"10.1587\/transfun.E95.A.2067","volume":"95","author":"J Kurihara","year":"2012","unstructured":"Kurihara, J., Uyematsu, T., Matsumoto, R.: Secret sharing schemes based on linear codes can be precisely characterized by the relative generalized Hamming weights. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 95(11), 2067\u201375 (2012)","journal-title":"IEICE Trans. Fundam. Electron. Commun. Comput. Sci."},{"issue":"2","key":"17_CR12","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1007\/s10623-008-9170-1","volume":"48","author":"Z Liu","year":"2008","unstructured":"Liu, Z., Chen, W., Luo, Y.: The relative generalized Hamming weight of linear $$q$$-ary codes and their subcodes. Des. Codes Crypt. 48(2), 111\u2013123 (2008)","journal-title":"Des. Codes Crypt."},{"key":"17_CR13","volume-title":"Matroid Theory","author":"JG Oxley","year":"1992","unstructured":"Oxley, J.G.: Matroid Theory. Oxford University Press, New York (1992)"},{"issue":"2","key":"17_CR14","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1023\/A:1008244215660","volume":"14","author":"J Simonis","year":"1998","unstructured":"Simonis, J., Ashikhmin, A.: Almost affine codes. Des. Codes Crypt. 14(2), 179\u2013197 (1998)","journal-title":"Des. Codes Crypt."},{"issue":"2","key":"17_CR15","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1007\/s10623-012-9750-y","volume":"72","author":"Z Zhuang","year":"2014","unstructured":"Zhuang, Z., Dai, B., Luo, Y., Han-Vinck, A.J.: On the relative profiles of a linear code and a subcode. Des. Codes Crypt. 72(2), 219\u2013247 (2014)","journal-title":"Des. Codes Crypt."}],"container-title":["Lecture Notes in Computer Science","Coding Theory and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-66278-7_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T16:05:31Z","timestamp":1710345931000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-66278-7_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319662770","9783319662787"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-66278-7_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]},"assertion":[{"value":"23 August 2017","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICMCTA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Castle Meeting on Coding Theory and Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Vihula","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Estonia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2017","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28 August 2017","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"31 August 2017","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"icmcta2017","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.castle-meeting-2017.ut.ee\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}