Cryptography and Coding

DOI10.1007/B93924MaRDI QIDQ5428154zbMATH OpenOpenAlexFDO

Authors Yuri Borissov, An Braeken, Svetla Nikova, Bart Preneel

Publication date 28 November 2007

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/b93924

Mathematics Subject Classification ID

Boolean functions (06E30) Cryptography (94A60) Applications of the theory of convex sets and geometry of numbers (covering radius, etc.) to coding theory (94B75)

Recommendations

• On the Covering Radii of Binary Reed–Muller Codes in the Set of Resilient Boolean Functions
• New Covering Radius of Reed–Muller Codes for<tex>$t$</tex>-Resilient Functions
• Some results on the covering radii of Reed-Muller codes
• New bounds on the covering radius of the second order Reed-Muller code of length 128
• scientific article; zbMATH DE number 2085196

Cited in

(6)

• On the covering radius of the third order Reed-Muller code \(\mathrm{RM}(3, 7)\)
• Nonlinearity of some invariant Boolean functions
• New Covering Radius of Reed–Muller Codes for<tex>$t$</tex>-Resilient Functions
• On the Covering Radii of Binary Reed–Muller Codes in the Set of Resilient Boolean Functions
• scientific article; zbMATH DE number 2085196 (Why is no real title available?)
• A refinement of Cusick-Cheon bound for the second order binary Reed-Muller code

This page was built for publication: Cryptography and Coding

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5428154)