A sharpening of the Johnson bound for binary linear codes and the nonexistence of linear codes with Preparata parameters
From MaRDI portal
Publication:1802186
DOI10.1007/BF01388407zbMath0770.94005MaRDI QIDQ1802186
L. M. G. M. Tolhuizen, Andries E. Brouwer
Publication date: 21 July 1993
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Related Items
An infinite class of counterexamples to a conjecture concerning nonlinear resilient functions, Notes on APN functions, semibiplanes and dimensional dual hyperovals, New ring-linear codes from dualization in projective Hjelmslev geometries, Almost perfect and planar functions, Maximal arcs in projective three-spaces and double-error-correcting cyclic codes, A proof of the Welch and Niho conjectures on cross-correlations of binary \(m\)-sequences, Crooked binomials, Zero-Sum Distinguishers for Iterated Permutations and Application to Keccak-f and Hamsi-256, On cryptographic propagation criteria for Boolean functions, Codes, graphs, and schemes from nonlinear functions
Cites Work
