{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,28]],"date-time":"2026-02-28T12:59:30Z","timestamp":1772283570564,"version":"3.50.1"},"reference-count":26,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2014,12,16]],"date-time":"2014-12-16T00:00:00Z","timestamp":1418688000000},"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":["Des. Codes Cryptogr."],"published-print":{"date-parts":[[2015,7]]},"DOI":"10.1007\/s10623-014-0028-4","type":"journal-article","created":{"date-parts":[[2014,12,15]],"date-time":"2014-12-15T16:21:54Z","timestamp":1418660514000},"page":"3-21","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["Efficient representation of binary nonlinear codes: constructions and minimum distance computation"],"prefix":"10.1007","volume":"76","author":[{"given":"Merc\u00e8","family":"Villanueva","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fanxuan","family":"Zeng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jaume","family":"Pujol","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2014,12,16]]},"reference":[{"key":"28_CR1","doi-asserted-by":"crossref","unstructured":"Bauer H., Ganter B., Hergert F.: Algebraic techniques for nonlinear codes. Combinatorica 3, 21\u201333 (1983).","DOI":"10.1007\/BF02579339"},{"key":"28_CR2","unstructured":"Betten A., Braun M., Fripertinger H., Kerber A., Kohnert A., Wassermann A.: Error-Correcting Linear Codes: Classification by Isometry and Applications. Springer, Berlin (2006)."},{"key":"28_CR3","unstructured":"Borges J., Fern\u00e1ndez C.: Plotkin construction: rank and kernel, pp. 1\u20133. arXiv:0707.3878v1 (July 26, 2007)."},{"key":"28_CR4","doi-asserted-by":"crossref","unstructured":"Borges J., Fern\u00e1ndez C., Pujol J., Rif\u00e0 J., Villanueva M.: $${\\mathbb{Z}}_{2}{\\mathbb{Z}}_{4} $$ Z 2 Z 4 -linear codes: generator matrices and duality. Des. Codes Cryptogr. 54(2), 167\u2013179 (2010).","DOI":"10.1007\/s10623-009-9316-9"},{"key":"28_CR5","doi-asserted-by":"crossref","unstructured":"Borges-Qintana M., Borges-Trenard M. A., M\u00e1rquez-Corbella I., Mart\u00ednez-Moro E.: Computing coset leaders and leader codewords of binary codes. J. Algebra Appl. (2014)","DOI":"10.1142\/S0219498815501285"},{"key":"28_CR6","doi-asserted-by":"crossref","unstructured":"Bouyukliev I., Bakoev V.: A method for efficiently computing the number of codewords of fixed weights in linear codes. Discret. Appl. Math. 156(15), 2986\u20133004 (2008).","DOI":"10.1016\/j.dam.2008.01.003"},{"key":"28_CR7","unstructured":"Cannon J.J., Bosma W. (eds.).: Handbook of Magma Functions, 2.13 edn, p. 4350. http:\/\/magma.maths.usyd.edu.au\/magma\/ (2006)."},{"key":"28_CR8","doi-asserted-by":"crossref","unstructured":"Canteaut A., Chabaud F.: A new algorithm for finding minimum-weight words in a linear code: application to McEliece\u2019s cryptosystem and to narrow-sense BCH codes of length 511. IEEE Trans. Inf. Theory 44(1), 367\u2013378 (1998).","DOI":"10.1109\/18.651067"},{"key":"28_CR9","doi-asserted-by":"crossref","unstructured":"Elssel K., Zimmermann K.-H.: Two new nonlinear binary codes. IEEE Trans. Inf. Theory 51(3), 1189\u20131190 (2005).","DOI":"10.1109\/TIT.2004.842767"},{"key":"28_CR10","doi-asserted-by":"crossref","unstructured":"Grassl M.: Searching for linear codes with large minimum distance. In: Bosma W., Cannon J. (eds.) Discovering Mathematics with Magma. Springer, Berlin (2006).","DOI":"10.1007\/978-3-540-37634-7_13"},{"key":"28_CR11","doi-asserted-by":"crossref","unstructured":"Guerrini E., Orsini E., Sala M.: Computing the distance distribution of systematic non-linear codes. J. Algebra Appl. 9(2), 241\u2013256 (2010).","DOI":"10.1142\/S0219498810003884"},{"key":"28_CR12","doi-asserted-by":"crossref","unstructured":"Hammons A.R., Kumar P.V., Calderbank A.R., Sloane N.J.A., Sol\u00e9 P.: The $${\\mathbb{Z}}_4$$ Z 4 -linearity of kerdock, preparata, goethals and related codes. IEEE Trans. Inf. Theory 40(2), 301\u2013319 (1994).","DOI":"10.1109\/18.312154"},{"key":"28_CR13","doi-asserted-by":"crossref","unstructured":"Heden O.: On perfect $$p$$ p -ary codes of length $$p+1$$ p + 1 . Des. Codes Cryptogr. 46(1), 45\u201356 (2008).","DOI":"10.1007\/s10623-007-9133-y"},{"key":"28_CR14","doi-asserted-by":"crossref","unstructured":"Huffman W.C., Pless V.: Fundamentals of Error-Correcting Codes. Cambridge University Press, Cambridge, MA (2003).","DOI":"10.1017\/CBO9780511807077"},{"key":"28_CR15","doi-asserted-by":"crossref","unstructured":"Lison\u011bk P., Trummer L.: An extension of the Brouwer\u2013Zimmermann minimum weight algorithm. Presented at the 4th International Castle Meeting on Coding Theory and Applications, Palmela, Portugal, 15\u201318, Sept, 2014.","DOI":"10.1007\/978-3-319-17296-5_27"},{"key":"28_CR16","unstructured":"MacWilliams F.J., Sloane N.J.A.: The Theory of Error-Correcting Codes. North-Holland, Amsterdam (1977)."},{"key":"28_CR17","unstructured":"Mohri M., Morii M.: On computing the minimum distance of linear codes. Electron. Commun. Jpn. 3 83(11), 32\u201342, (2000)."},{"key":"28_CR18","doi-asserted-by":"crossref","unstructured":"\u00d6sterg\u00e5rd P.R.J.: Two new four-error-correcting binary codes. Des. Codes Cryptogr. 36(3), 327\u2013329 (2005).","DOI":"10.1007\/s10623-004-1723-3"},{"key":"28_CR19","doi-asserted-by":"crossref","unstructured":"\u00d6sterg\u00e5rd P.R.J., Pottonen O.: The perfect binary one-error-correcting codes of length 15: part I\u2014classification. IEEE Trans. Inf. Theory 55(10), 4657\u20134660 (2009).","DOI":"10.1109\/TIT.2009.2027525"},{"key":"28_CR20","doi-asserted-by":"crossref","unstructured":"\u00d6sterg\u00e5rd P.R.J., Pottonen O., Phelps K.T.: The perfect binary one-error-correcting codes of length 15: part II properties. IEEE Trans. Inf. Theory 56(6), 2571\u20132582 (2010).","DOI":"10.1109\/TIT.2010.2046197"},{"key":"28_CR21","doi-asserted-by":"crossref","unstructured":"Phelps K.T., Rif\u00e0 J., Villanueva M.: Kernels and $$p$$ p -kernels of $$p^r$$ p r -ary 1-perfect codes. Des. Codes Cryptogr. 37(2), 243\u2013261 (2001).","DOI":"10.1007\/s10623-004-3989-x"},{"key":"28_CR22","unstructured":"Pujol J., Zeng F., Villanueva M.: Representation, constructions and minimum distance computation of binary nonlinear codes. In: Proceedings in Aplications of Computer Algebra, M\u00e1laga, Spain, pp. 142\u2013143 (2013)."},{"key":"28_CR23","doi-asserted-by":"crossref","unstructured":"Vardy A.: The intractability of computing the minimum distance of a code. IEEE Trans. Inf. Theory 43(6), 1757\u20131773 (1997).","DOI":"10.1109\/18.641542"},{"key":"28_CR24","unstructured":"White, G.: Enumeration-based algorithms in coding theory. PhD Thesis, University of Sydney, (2006)."},{"key":"28_CR25","unstructured":"White G., Grassl M.: A new minimum weight algorithm for additive codes. In: ISIT 2006, Seattle, WA, vol. 9(14), pp. 1119\u20131123, July, 2006."},{"key":"28_CR26","unstructured":"Zimmermann K.-H.: Integral hecke modules, integral generalized Reed\u2013Muller codes, and linear codes. Tech. Rep. 3\u201396, Technische Universit\u00e4t Hamburg-Harburg (1996)."}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-014-0028-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10623-014-0028-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-014-0028-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,7,30]],"date-time":"2023-07-30T17:52:24Z","timestamp":1690739544000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10623-014-0028-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,12,16]]},"references-count":26,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2015,7]]}},"alternative-id":["28"],"URL":"https:\/\/doi.org\/10.1007\/s10623-014-0028-4","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"value":"0925-1022","type":"print"},{"value":"1573-7586","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,12,16]]}}}