{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T14:42:06Z","timestamp":1740148926661,"version":"3.37.3"},"reference-count":17,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2018,12,19]],"date-time":"2018-12-19T00:00:00Z","timestamp":1545177600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Cryptogr. Commun."],"published-print":{"date-parts":[[2019,9]]},"DOI":"10.1007\/s12095-018-0348-8","type":"journal-article","created":{"date-parts":[[2018,12,18]],"date-time":"2018-12-18T19:54:49Z","timestamp":1545162889000},"page":"1009-1020","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Relative profiles and extended weight polynomials of almost affine codes"],"prefix":"10.1007","volume":"11","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3863-5357","authenticated-orcid":false,"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":[[2018,12,19]]},"reference":[{"key":"348_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 Crypogr. 62, 331\u2013341 (2012)","journal-title":"Des. Codes Crypogr."},{"issue":"1","key":"348_CR2","doi-asserted-by":"publisher","first-page":"986","DOI":"10.1109\/TIT.2013.2292524","volume":"60","author":"T Britz","year":"2014","unstructured":"Britz, T., Johnsen, T., Martin, J.: Chains, demi-matroids and profiles. IEEE Trans. Inf. Theory 60(1), 986\u2013991 (2014)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"6","key":"348_CR3","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. Inf. Theory 40(6), 1741\u20131751 (1994)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"2","key":"348_CR4","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1007\/s11786-012-0119-4","volume":"6","author":"G Gordon","year":"2012","unstructured":"Gordon, G.: On brylaswski\u2019s generalized duality. Math. Comput. Sci. 6(2), 135\u2013146 (2012)","journal-title":"Math. Comput. Sci."},{"key":"348_CR5","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. Available at \n                    http:\/\/hdl.handle.net\/10037\/7736\n                    \n                   (2015)"},{"key":"348_CR6","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, 321\u2013330 (2012)","journal-title":"Des. Codes Crypt."},{"key":"348_CR7","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"},{"issue":"2","key":"348_CR8","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.: A generalization of weight polynomials to matroids. Discret. Math. 339(2), 632\u2013645 (2016)","journal-title":"Discret. Math."},{"key":"348_CR9","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 with matroids. AAECC 24, 73\u201393 (2013)","journal-title":"AAECC"},{"issue":"4","key":"348_CR10","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":"348_CR11","doi-asserted-by":"publisher","unstructured":"Johnsen, T., Verdure, H.: Flags of almost affine codes and the two-party wire-tap channel of type II. Designs, Codes and Crypography. \n                    https:\/\/doi.org\/10.1007\/s10623-017-0438-1\n                    \n                   (2017)","DOI":"10.1007\/s10623-017-0438-1"},{"key":"348_CR12","doi-asserted-by":"crossref","unstructured":"Johnsen, T., Verdure, H.: Relative generalized hamming weights and extended weight polynomials of almost affine codes. In: Coding Theory and Apllications, Proceedings of the 5\u2019th International Castle Meeting, Vihula, Estonia, LNCS, vol. 10495, pp. 207\u201316 (2017)","DOI":"10.1007\/978-3-319-66278-7_17"},{"key":"348_CR13","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1007\/s10623-008-9170-1","volume":"62","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. 62, 111\u201323 (2008)","journal-title":"Des. Codes Crypt."},{"issue":"3","key":"348_CR14","doi-asserted-by":"publisher","first-page":"1222","DOI":"10.1109\/TIT.2004.842763","volume":"51","author":"Y Luo","year":"2005","unstructured":"Luo, Y., Mitrpant, C., van Vinck, A.J., Chen, K.: Some new characters on the Wire-Tap channel of type II. IEEE Trans. Inf. Theory 51(3), 1222\u20131229 (2005)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"348_CR15","volume-title":"Matroid Theory","author":"JG Oxley","year":"1992","unstructured":"Oxley, J.G.: Matroid Theory. Oxford University Press, Oxford (1992)"},{"key":"348_CR16","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 Crypogr. 14, 179\u2013197 (1998)","journal-title":"Des. Codes Crypogr."},{"issue":"2","key":"348_CR17","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":["Cryptography and Communications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12095-018-0348-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s12095-018-0348-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12095-018-0348-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,12,18]],"date-time":"2019-12-18T19:26:59Z","timestamp":1576697219000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s12095-018-0348-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,12,19]]},"references-count":17,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2019,9]]}},"alternative-id":["348"],"URL":"https:\/\/doi.org\/10.1007\/s12095-018-0348-8","relation":{},"ISSN":["1936-2447","1936-2455"],"issn-type":[{"type":"print","value":"1936-2447"},{"type":"electronic","value":"1936-2455"}],"subject":[],"published":{"date-parts":[[2018,12,19]]},"assertion":[{"value":"27 November 2017","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 December 2018","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 December 2018","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}