Boolean functions: degree and support
type: Item
instance of: scholarly article
title: Boolean functions: degree and support
zbMATH Open document ID: 1432.06008
author: R. Smith
published in: Mathematics in Computer Science
publication date: 2018-11-01T00:00:00Z
Mathematics Subject Classification ID: 06E30
Mathematics Subject Classification ID: 94A60
Mathematics Subject Classification ID: 94D10
zbMATH DE Number: 6969823
zbMATH Keywords: Boolean function
zbMATH Keywords: support
zbMATH Keywords: weight
zbMATH Keywords: algebraic normal form
zbMATH Keywords: degree
zbMATH Keywords: linear space
MaRDI profile type: Publication
full work available at URL: s11786-018-0350-8
OpenAlex ID: W2811104640
cites work: Representing Boolean functions as polynomials modulo composite numbers
cites work: On the Covering Radii of Binary Reed–Muller Codes in the Set of Resilient Boolean Functions
cites work: Progress in Cryptology - INDOCRYPT 2004
cites work: Covering sequences of Boolean functions and their cryptographic significance
cites work: Homogeneous bent functions, invariants, and designs
cites work: Q4373628
cites work: Transformation of the canonical disjunctive normal form of a Boolean function to its Zhegalkin-polynomial and back
cites work: Invited paper. Boolean matrix representation for the conversion of minterms to Reed–Muller coefficients and the minimization of Exclusive-OR switching functions
cites work: New Covering Radius of Reed–Muller Codes for&lt;tex&gt;$t$&lt;/tex&gt;-Resilient Functions
cites work: Almost Security of Cryptographic Boolean Functions
cites work: Q4146667
cites work: Primal-Dual Distance Bounds of Linear Codes With Application to Cryptography
cites work: Advances in Cryptology - EUROCRYPT 2004
cites work: Q5202622
cites work: On the degree of Boolean functions as real polynomials
cites work: Q4520764
cites work: SOFSEM 2005: Theory and Practice of Computer Science
cites work: Q4945349
cites work: Q4036868
cites work: Q4250626
cites work: Analysis and design of stream ciphers
cites work: Products of linear recurring sequences with maximum complexity
cites work: Universal affine classification of Boolean functions
cites work: Q3993492
cites work: Constructions of Almost Optimal Resilient Boolean Functions on Large Even Number of Variables
cites work: Q4373627
DOI: 10.1007/S11786-018-0350-8
description: scientific article; zbMATH DE number 6969823