{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T10:45:31Z","timestamp":1725533131003},"publisher-location":"Berlin, Heidelberg","reference-count":16,"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_26","type":"book-chapter","created":{"date-parts":[[2009,6,5]],"date-time":"2009-06-05T21:43:20Z","timestamp":1244238200000},"page":"227-230","source":"Crossref","is-referenced-by-count":1,"title":["Gr\u00f6bner Representations of Binary Matroids"],"prefix":"10.1007","author":[{"given":"M.","family":"Borges-Quintana","sequence":"first","affiliation":[]},{"given":"M. A.","family":"Borges-Trenard","sequence":"additional","affiliation":[]},{"given":"E.","family":"Mart\u00ednez-Moro","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"26_CR1","doi-asserted-by":"publisher","first-page":"393","DOI":"10.1007\/s00200-008-0080-2","volume":"19-5","author":"M. Borges-Quintana","year":"2008","unstructured":"Borges-Quintana, M., Borges-Trenard, M.A., Fitzpatrick, P., Mart\u00ednez-Moro, E.: On a Gr\u00f6bner bases and combinatorics for binary codes. Appl. Algebra Engrg. Comm. Comput.\u00a019-5, 393\u2013411 (2008)","journal-title":"Appl. Algebra Engrg. Comm. Comput."},{"key":"26_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"76","DOI":"10.1007\/11617983_7","volume-title":"Applied Algebra, Algebraic Algorithms and Error-Correcting Codes","author":"M. Borges-Quintana","year":"2006","unstructured":"Borges-Quintana, M., Borges-Trenard, M.A., Mart\u00ednez-Moro, E.: A general framework for applying FGLM techniques to linear codes. In: Fossorier, M.P.C., Imai, H., Lin, S., Poli, A. (eds.) AAECC 2006. LNCS, vol.\u00a03857, pp. 76\u201386. Springer, Heidelberg (2006)"},{"key":"26_CR3","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1080\/09720529.2007.10698114","volume":"10-2","author":"M. Borges-Quintana","year":"2007","unstructured":"Borges-Quintana, M., Borges-Trenard, M.A., Mart\u00ednez-Moro, E.: On a Gr\u00f6bner bases structure associated to linear codes. J. Discrete Math. Sci. Cryptogr.\u00a010-2, 151\u2013191 (2007)","journal-title":"J. Discrete Math. Sci. Cryptogr."},{"key":"26_CR4","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1142\/9789812772022_0002","volume-title":"Advances in Coding Theory and Cryptography","author":"M. Borges-Quintana","year":"2007","unstructured":"Borges-Quintana, M., Borges-Trenard, M.A., Mart\u00ednez-Moro, E.: A Gr\u00f6bner representation of linear codes. In: Advances in Coding Theory and Cryptography, pp. 17\u201332. World Scientific, Singapore (2007)"},{"key":"26_CR5","doi-asserted-by":"publisher","first-page":"429","DOI":"10.1006\/jsco.1999.0415","volume":"30","author":"M. Borges-Quintana","year":"2000","unstructured":"Borges-Quintana, M., Borges-Trenard, M.A., Mora, T.: Computing Gr\u00f6bner Bases by FGLM Techniques in a Noncommutative Settings. J. Symb.Comp.\u00a030, 429\u2013449 (2000)","journal-title":"J. Symb.Comp."},{"key":"26_CR6","unstructured":"Cameron, P.: Codes, matroids and trellises, citeseerx.ist.psu.edu\/343758.html"},{"key":"26_CR7","doi-asserted-by":"crossref","unstructured":"Cox, D., Little, J., O\u2019Shea, D.: Ideals, varieties, and algorithms (1992)","DOI":"10.1007\/978-1-4757-2181-2"},{"key":"26_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"130","DOI":"10.1007\/BFb0025141","volume-title":"Information Theory and Applications II","author":"M. Esmaeili","year":"1996","unstructured":"Esmaeili, M., Gulliver, T., Secord, N.: Trellis complexity of linear block codes via atomic codewords. In: Chouinard, J.-Y., Fortier, P., Gulliver, T.A. (eds.) Information Theory 1995. LNCS, vol.\u00a01133, pp. 130\u2013148. Springer, Heidelberg (1996)"},{"issue":"4","key":"26_CR9","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1006\/jsco.1993.1051","volume":"16","author":"J. Faug\u00e8re","year":"1993","unstructured":"Faug\u00e8re, J., Gianni, P., Lazard, D., Mora, T.: Efficient Computation of Zero-Dimensional Gr\u00f6bner Bases by Change of Ordering. J. Symb. Comp.\u00a016(4), 329\u2013344 (1993)","journal-title":"J. Symb. Comp."},{"key":"26_CR10","doi-asserted-by":"publisher","first-page":"1924","DOI":"10.1109\/18.476317","volume":"41","author":"F.R. Kschischang","year":"1995","unstructured":"Kschischang, F.R., Sorokine, V.: On the trellis structure of block codes. IEEE Trans. Inform. Theory\u00a041, 1924\u20131937 (1995)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"26_CR11","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781107340954","volume-title":"Solving Polynomial Equation Systems II : Macaulay\u2019s Paradigm and Gr\u00f6bner Technology","author":"T. Mora","year":"2005","unstructured":"Mora, T.: Solving Polynomial Equation Systems II: Macaulay\u2019s Paradigm and Gr\u00f6bner Technology. Cambridge Univ. Press, Cambridge (2005)"},{"key":"26_CR12","unstructured":"Mora, T.: The FGLM Problem and M\u00f6ller\u2019s Algorithm on Zero-dimensional Ideals. In: [15]"},{"key":"26_CR13","doi-asserted-by":"crossref","unstructured":"Muder, D.J.: Minimal trellises for block codes. IEEE Trans. Inform. Theory\u00a034(5, part 1), 1049\u20131053 (1988)","DOI":"10.1109\/18.21228"},{"key":"26_CR14","volume-title":"Matroid Theory","author":"J.G. Oxley","year":"1992","unstructured":"Oxley, J.G.: Matroid Theory. Oxford University Press, Oxford (1992)"},{"volume-title":"Gr\u00f6bner Bases, Coding, and Cryptography","year":"2009","key":"26_CR15","unstructured":"Sala, M., Mora, T., Perret, L., Sakata, S., Traverso, C. (eds.): Gr\u00f6bner Bases, Coding, and Cryptography. Springer, Heidelberg (2009) (to appear)"},{"key":"26_CR16","first-page":"171","volume-title":"Proc. ISSAC 1998","author":"B. Reinert","year":"1998","unstructured":"Reinert, B., Madlener, K., Mora, T.: A Note on Nielsen Reduction and Coset Enumeration. In: Proc. ISSAC 1998, pp. 171\u2013178. ACM, New York (1998)"}],"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_26","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,20]],"date-time":"2019-05-20T14:30:03Z","timestamp":1558362603000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-02181-7_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642021800","9783642021817"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-02181-7_26","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}