{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,31]],"date-time":"2025-12-31T00:44:12Z","timestamp":1767141852919,"version":"build-2238731810"},"reference-count":16,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2011,4,17]],"date-time":"2011-04-17T00:00:00Z","timestamp":1302998400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Des. Codes Cryptogr."],"published-print":{"date-parts":[[2012,2]]},"DOI":"10.1007\/s10623-011-9506-0","type":"journal-article","created":{"date-parts":[[2011,4,16]],"date-time":"2011-04-16T03:47:53Z","timestamp":1302925673000},"page":"209-223","source":"Crossref","is-referenced-by-count":3,"title":["Intersection of Hamming codes avoiding Hamming subcodes"],"prefix":"10.1007","volume":"62","author":[{"given":"J.","family":"Rif\u00e0","sequence":"first","affiliation":[]},{"given":"F. I.","family":"Solov\u2019eva","sequence":"additional","affiliation":[]},{"given":"M.","family":"Villanueva","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2011,4,17]]},"reference":[{"key":"9506_CR1","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1016\/S0021-9800(67)80025-5","volume":"2","author":"E.F. Assmus","year":"1967","unstructured":"Assmus E.F., Mattson H.F.: On tactical configurations and error correcting codes. J. Comb. Theory 2, 243\u2013257 (1967)","journal-title":"J. Comb. Theory"},{"issue":"9","key":"9506_CR2","doi-asserted-by":"crossref","first-page":"4160","DOI":"10.1109\/TIT.2006.880036","volume":"52","author":"T.P. Berger","year":"2006","unstructured":"Berger T.P., Canteaut A., Charpin P., Laigle-Chapuy Y.: On almost perfect nonlinear functions over $${{\\mathbb{F}}^n_2}$$ . IEEE Trans. Inform. Theory 52(9), 4160\u20134170 (2006)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"9506_CR3","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1007\/s10623-008-9194-6","volume":"49","author":"M. Brinkmann","year":"2008","unstructured":"Brinkmann M., Leander G.: On the classification of APN functions up to dimension 5. Des. Codes Cryptogr. 49, 273\u2013288 (2008)","journal-title":"Des. Codes Cryptogr."},{"issue":"1\u20134","key":"9506_CR4","first-page":"135","volume":"34","author":"K.A. Browning","year":"2009","unstructured":"Browning K.A., Dillon J.F., Kibler R.E., Mcquistan M.T.: APN polynomials and related codes. J. Comb. Inform. Syst. Sci. 34(1\u20134), 135\u2013159 (2009)","journal-title":"J. Comb. Inform. Syst. Sci."},{"key":"9506_CR5","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1090\/conm\/518\/10194","volume":"518","author":"K.A. Browning","year":"2010","unstructured":"Browning K.A., Dillon J.F., McQuistan M.T., Wolfe A.J.: An APN permutation in dimension six. Contemp. Math. 518, 33\u201342 (2010)","journal-title":"Contemp. Math."},{"issue":"A","key":"9506_CR6","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1016\/0097-3165(90)90011-K","volume":"54","author":"A.R. Calderbank","year":"1990","unstructured":"Calderbank A.R.: Covering radius and chromatic numbers of Kneser graphs. J. Combin. Theory 54(A), 129\u2013131 (1990)","journal-title":"J. Combin. Theory"},{"key":"9506_CR7","volume-title":"Handbook of Magma Functions.","year":"2006","unstructured":"Cannon, J.J., Bosma, W. (eds): Handbook of Magma Functions. 2.13 edn. University of Sydney, Sydney (2006)","edition":"2.13"},{"issue":"2","key":"9506_CR8","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1023\/A:1008344232130","volume":"15","author":"C. Carlet","year":"1998","unstructured":"Carlet C., Charpin P., Zinoviev V.: Codes, bent functions and permutations suitable for DES-like cryptosystems. Des. Codes Cryptogr. 15(2), 125\u2013156 (1998)","journal-title":"Des. Codes Cryptogr."},{"key":"9506_CR9","unstructured":"Dodunekov S.M., Zinoviev V.A.: A note on preparata codes. In: Proceedings of the Sixth International Symposium on Information Theory, Moscow\u2014Tashkent Part 2, pp. 78\u201380 (1984)."},{"issue":"6","key":"9506_CR10","doi-asserted-by":"crossref","first-page":"1706","DOI":"10.1109\/18.104338","volume":"37","author":"X.-D. Hou","year":"1991","unstructured":"Hou X.-D.: On the covering radius of subcodes of a code. IEEE Trans. Inform. Theory 37(6), 1706\u20131707 (1991)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"9506_CR11","unstructured":"Hou X.-D.: Affinity of permutations of $${{\\mathbb{F}}_2^n}$$ . In: Proceedings of the Workshop on Coding and Cryptography, pp. 273\u2013280 (2003)."},{"key":"9506_CR12","first-page":"48","volume":"19","author":"M. Kurlyandchik Ya","year":"1971","unstructured":"Kurlyandchik Ya M.: On logariphm asysmptotic of length of maximal sparce cycle r\u00a0>\u00a02. Methody Discretnogo Analiza 19, 48\u201355 (1971) (in Russian)","journal-title":"Methody Discretnogo Analiza"},{"key":"9506_CR13","volume-title":"The Theory of Error-Correcting Codes","author":"F.J. MacWilliams","year":"1977","unstructured":"MacWilliams F.J., Sloane N.J.A.: The Theory of Error-Correcting Codes. North-Holland Publishing Company, New York (1977)"},{"key":"9506_CR14","unstructured":"Nyberg K.: Perfect non-linear S-boxes. In: Proceedings of EUROCRYPT\u2019 91. Lecture Notes in Computer Science, vol. 547, pp. 378\u2013386 (1992)."},{"key":"9506_CR15","unstructured":"Rif\u00e0 J., Solov\u2019eva F.I., Villanueva M.: Hamming codes avoiding Hamming subcodes. In: Proceedings of the 12th International Workshop on Algebraic and Combinatorial Coding Theory (ACCT\u20192010), Novosibirsk (Russia), September 5\u201311, pp. 256\u2013261 (2010)."},{"key":"9506_CR16","first-page":"375","volume":"8","author":"Y.L. Vasil\u2019ev","year":"1962","unstructured":"Vasil\u2019ev Y.L.: On nongroup close-packed codes. Probl. Cybern. 8, 375\u2013378 (1962)","journal-title":"Probl. Cybern."}],"updated-by":[{"DOI":"10.1007\/s10623-014-0011-0","type":"correction","label":"Correction","source":"publisher","updated":{"date-parts":[[2014,9,25]],"date-time":"2014-09-25T00:00:00Z","timestamp":1411603200000}}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-011-9506-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10623-011-9506-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-011-9506-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,30]],"date-time":"2019-05-30T15:58:30Z","timestamp":1559231910000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10623-011-9506-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,4,17]]},"references-count":16,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2012,2]]}},"alternative-id":["9506"],"URL":"https:\/\/doi.org\/10.1007\/s10623-011-9506-0","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"value":"0925-1022","type":"print"},{"value":"1573-7586","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,4,17]]}}}