References🔗

Bibliography (13)

• Claude Carlet, 2010. “Boolean Functions for Cryptography and Error-Correcting Codes”. In Boolean Models and Methods in Mathematics, Computer Science, and Engineering, pp. 257--397.
  Cited from (1)

  • Document root
• Claude Carlet and Sihem Mesnager (2007). “Improving the Upper Bounds on the Covering Radii of Binary Reed--Muller Codes”. IEEE Transactions on Information Theory. 53(1), pp. 162–173.
  Cited from (4)

  • Chapter 3: Boolean functions and cryptography, Section 3.3: Higher-order nonlinearity
  • Chapter 3: Boolean functions and cryptography, Section 3.3: Higher-order nonlinearity
  • Chapter 3: Boolean functions and cryptography, Section 3.3: Higher-order nonlinearity
  • Chapter 3: Boolean functions and cryptography, Section 3.3: Higher-order nonlinearity
• Eric M. Rains and Neil J. A. Sloane, 1998. “Self-Dual Codes”. In Handbook of Coding Theory, Volume I, pp. 177--294.
  Cited from (2)

  • Chapter 3: Boolean functions and cryptography, Section 3.3: Higher-order nonlinearity
  • Chapter 3: Boolean functions and cryptography, Section 3.3: Higher-order nonlinearity
• François Rodier (2006). “Asymptotic Nonlinearity of Boolean Functions”. Designs, Codes and Cryptography. 40(1), pp. 59–70.
  Cited from (1)

  • Chapter 3: Boolean functions and cryptography, Section 3.2: Nonlinearity
• Nathan John Russell, 2016. “Self Dual Codes and the Indecomposable Building Blocks”. In Eastern Kentucky University Online Theses and Dissertations, no. 421.
  Cited from (0)

  • No citation uses recorded.
• Ryan O'Donnell, 2021. “Analysis of Boolean Functions, May 2021 Revision”. In Cambridge University Press.
  Cited from (0)

  • No citation uses recorded.
• Sihem Mesnager and Alexey Oblaukhov (2022). “Classification of the Codewords of Weights 16 and 18 of the Reed--Muller Code RM(n-3,n)”. IEEE Transactions on Information Theory. 68(2), pp. 940–952.
  Cited from (2)

  • Chapter 3: Boolean functions and cryptography, Section 3.3: Higher-order nonlinearity
  • Chapter 3: Boolean functions and cryptography, Section 3.3: Higher-order nonlinearity
• Tadao Kasami and Nobuki Tokura (1970). “On the Weight Structure of Reed--Muller Codes”. IEEE Transactions on Information Theory. 16(6), pp. 752–759.
  Cited from (2)

  • Chapter 3: Boolean functions and cryptography, Section 3.3: Higher-order nonlinearity
  • Chapter 3: Boolean functions and cryptography, Section 3.3: Higher-order nonlinearity
• Tadao Kasami, Nobuki Tokura, and Saburo Azumi (1976). “On the Weight Enumeration of Weights Less than 2.5d of Reed--Muller Codes”. Information and Control. 30(4), pp. 380–395.
  Cited from (2)

  • Chapter 3: Boolean functions and cryptography, Section 3.3: Higher-order nonlinearity
  • Chapter 3: Boolean functions and cryptography, Section 3.3: Higher-order nonlinearity
• Thomas W. Cusick and Pantelimon Stănică, 2017. “Cryptographic Boolean Functions and Applications, Second Edition”. In Academic Press.
  Cited from (0)

  • No citation uses recorded.
• Vera Pless (1972). “A Classification of Self-Orthogonal Codes over GF(2)”. Discrete Mathematics. 3(1--3), pp. 209–246.
  Cited from (2)

  • Chapter 3: Boolean functions and cryptography, Section 3.3: Higher-order nonlinearity
  • Chapter 3: Boolean functions and cryptography, Section 3.3: Higher-order nonlinearity
• Yuri Borissov and Nickolai Manev (2004). “Minimal Codewords in Linear Codes”. Serdica Mathematical Journal. 30, pp. 303–324.
  Cited from (2)

  • Chapter 3: Boolean functions and cryptography, Section 3.3: Higher-order nonlinearity
  • Chapter 3: Boolean functions and cryptography, Section 3.3: Higher-order nonlinearity
• Yuri Borissov, Nickolai Manev, and Svetla Nikova (2003). “On the Non-Minimal Codewords in Binary Reed--Muller Codes”. Discrete Applied Mathematics. 128(1), pp. 65–74.
  Cited from (2)

  • Chapter 3: Boolean functions and cryptography, Section 3.3: Higher-order nonlinearity
  • Chapter 3: Boolean functions and cryptography, Section 3.3: Higher-order nonlinearity