{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,2]],"date-time":"2026-06-02T18:20:42Z","timestamp":1780424442846,"version":"3.54.1"},"reference-count":22,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2014,2,26]],"date-time":"2014-02-26T00:00:00Z","timestamp":1393372800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["AAECC"],"published-print":{"date-parts":[[2014,4]]},"DOI":"10.1007\/s00200-014-0217-4","type":"journal-article","created":{"date-parts":[[2014,2,25]],"date-time":"2014-02-25T06:50:43Z","timestamp":1393311043000},"page":"21-37","source":"Crossref","is-referenced-by-count":12,"title":["A note on cyclic codes from APN functions"],"prefix":"10.1007","volume":"25","author":[{"given":"Chunming","family":"Tang","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yanfeng","family":"Qi","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Maozhi","family":"Xu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2014,2,26]]},"reference":[{"key":"217_CR1","doi-asserted-by":"crossref","first-page":"120","DOI":"10.1109\/18.108256","volume":"38","author":"M Antweiler","year":"1992","unstructured":"Antweiler, M., Bomer, L.: complex sequences over $$\\text{ GF }(p^M)$$ GF ( p M ) with a two-level autocorrelation function and a large linear span. IEEE Trans. Inform. Theory 38, 120\u2013130 (1992)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"217_CR2","unstructured":"Beth, T., Ding, C.: On almost perfect nonlinear permutations. In: Advances in Cryptology-EUROCRYPT 93, Lecture Notes in Comput. Sci. 765, p. 6576. Springer, New York (1993)"},{"key":"217_CR3","volume-title":"The Mathematical Theory of Coding","author":"I Blake","year":"1975","unstructured":"Blake, I., Mullen, R.C.: The Mathematical Theory of Coding. Academic Press, New York (1975)"},{"issue":"1","key":"217_CR4","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1137\/S0895480198350057","volume":"13","author":"A Canteaut","year":"2000","unstructured":"Canteaut, A., Charpin, P., Dobbertin, H.: Weight divisibility of cyclic codes, highly nonlinear functions on $$F_{2^m}$$ F 2 m , and crosscorrelation of maximum-length sequences. SIAM. J. Discret. Math. 13(1), 105\u2013138 (2000)","journal-title":"SIAM. J. Discret. Math."},{"key":"217_CR5","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 cryptosys-tems. Des. Codes Cryptogr. 15, 125\u2013156 (1998)","journal-title":"Des. Codes Cryptogr."},{"issue":"6","key":"217_CR6","doi-asserted-by":"crossref","first-page":"2089","DOI":"10.1109\/TIT.2005.847722","volume":"51","author":"C Carlet","year":"2005","unstructured":"Carlet, C., Ding, C., Yuan, J.: Linear codes from highly nonlinear functions and their secret sharing schemes. IEEE Trans. Inform. Theory 51(6), 2089\u20132102 (2005)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"217_CR7","unstructured":"Charpin, P.: Open problems on cyclic codes. In: Pless, V.S., Huffman, W.C., Brualdi, R.A. (eds.) Handbook of Coding Theory, Part 1: Algebraic Coding. Elsevier, Amsterdam, The Netherlands, ch. 11 (1998)"},{"key":"217_CR8","doi-asserted-by":"crossref","first-page":"357","DOI":"10.1109\/TIT.1964.1053699","volume":"10","author":"RT Chien","year":"1964","unstructured":"Chien, R.T.: Cyclic decoding procedure for the Bose-Chaudhuri-Hocquenghem codes. IEEE Trans. Inform. Theory 10, 357\u2013363 (1964)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"217_CR9","doi-asserted-by":"crossref","unstructured":"Ding, C.: Cyclic codes from some monomials and trinomials. SIAM J. Discret. Math. 27(4), 1977\u20131994 (Dec. 2013)","DOI":"10.1137\/120882275"},{"key":"217_CR10","doi-asserted-by":"crossref","unstructured":"Ding, C., Xiao, G., Shan, W.: The stability theory of stream ciphers. In: Lecture Notes in Computer Science, vol. 561. Springer, Heidelberg (1991)","DOI":"10.1007\/3-540-54973-0"},{"key":"217_CR11","doi-asserted-by":"crossref","unstructured":"Ding, C., Zhou, Z.: Binary cyclic codes from explicit polynomials over $$\\text{ GF }(2^m)$$ GF ( 2 m ) . Discret. Math. (to appear) (2014)","DOI":"10.1016\/j.disc.2013.12.020"},{"key":"217_CR12","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1006\/inco.1998.2764","volume":"151","author":"H Dobbertin","year":"1999","unstructured":"Dobbertin, H.: Almost perfect nonlinear power functions on $$\\text{ GF }(2^n)$$ GF ( 2 n ) : the Niho case. Inform. Comput. 151, 57\u201372 (1999)","journal-title":"Inform. Comput."},{"issue":"4","key":"217_CR13","doi-asserted-by":"crossref","first-page":"549","DOI":"10.1109\/TIT.1965.1053825","volume":"11","author":"GD Forney","year":"1995","unstructured":"Forney, G.D.: On decoding BCH codes. IEEE Trans. Inform. Theory 11(4), 549\u2013557 (1995)","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"2","key":"217_CR14","doi-asserted-by":"crossref","first-page":"475","DOI":"10.1109\/18.748997","volume":"45","author":"T Helleseth","year":"1999","unstructured":"Helleseth, T., Rong, C., Sandberg, D.: New families of almost perfect nonlinear power mappings. IEEE Trans. Inform. Theory 45(2), 475\u2013485 (1999)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"217_CR15","doi-asserted-by":"crossref","first-page":"489","DOI":"10.1016\/S0019-9958(72)90887-X","volume":"20","author":"CRP Hartmann","year":"1972","unstructured":"Hartmann, C.R.P., Tzeng, K.K.: Generalizations of the BCH bound. Inf. Control 20, 489\u2013498 (1972)","journal-title":"Inf. Control"},{"key":"217_CR16","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511807077","volume-title":"Fundamentals of Error-Correcting Codes","author":"WC Huffman","year":"2003","unstructured":"Huffman, W.C., Pless, V.: Fundamentals of Error-Correcting Codes. Cambridge University Press, Cambridge (2003)"},{"key":"217_CR17","doi-asserted-by":"crossref","first-page":"229","DOI":"10.2307\/2369308","volume":"1","author":"E Lucas","year":"1878","unstructured":"Lucas, E.: Th\u00e9orie des fonctions num\u00e9riques simplement p\u00e9riodiques. Am. J. Math. 1, 229\u2013231 (1878)","journal-title":"Am. J. Math."},{"key":"217_CR18","volume-title":"Finite Fields","author":"L Lidl","year":"1997","unstructured":"Lidl, L., Niederreiter, H.: Finite Fields. Cambridge University Press, Cambridge (1997)"},{"key":"217_CR19","doi-asserted-by":"crossref","unstructured":"Nyberg, K.: Differentially uniform mappings for cryptography. In: Advances in Cryptology-EUROCRYPT 93, Lecture Notes in Comput. Sci. 765, pp. 55\u201364. Springer, New York (1993)","DOI":"10.1007\/3-540-48285-7_6"},{"key":"217_CR20","unstructured":"Prange, E.: Some Cyclic Error-Correcting Codes with Simple Decoding Algorithms. Air Force Cambridge Research Center-TN-58-156, Cambridge, MA (April 1958)"},{"issue":"2","key":"217_CR21","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1007\/s12095-011-0059-x","volume":"4","author":"W Si","year":"2012","unstructured":"Si, W., Ding, C.: A simple stream cipher with proven properties. Cryptogr. Commun. 4(2), 79\u2013104 (2012)","journal-title":"Cryptogr. Commun."},{"issue":"1","key":"217_CR22","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1109\/TIT.1986.1057134","volume":"32","author":"JH Lint van","year":"1986","unstructured":"van Lint, J.H., Wilson, R.M.: On the minimum distance of cyclic codes. IEEE Trans. Inform. Theory 32(1), 23\u201340 (1986)","journal-title":"IEEE Trans. Inform. Theory"}],"container-title":["Applicable Algebra in Engineering, Communication and Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00200-014-0217-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00200-014-0217-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00200-014-0217-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,7]],"date-time":"2019-08-07T23:15:13Z","timestamp":1565219713000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00200-014-0217-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,2,26]]},"references-count":22,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2014,4]]}},"alternative-id":["217"],"URL":"https:\/\/doi.org\/10.1007\/s00200-014-0217-4","relation":{},"ISSN":["0938-1279","1432-0622"],"issn-type":[{"value":"0938-1279","type":"print"},{"value":"1432-0622","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,2,26]]}}}