On the annihilators of Boolean polynomials
From MaRDI portal
Publication:5090146
DOI10.33048/DAIO.2020.27.646zbMATH Open1495.94172OpenAlexW4245633777MaRDI QIDQ5090146FDOQ5090146
Authors: V. K. Leont'ev, Eh. N. Gordeev
Publication date: 15 July 2022
Published in: Diskretnyi analiz i issledovanie operatsii (Search for Journal in Brave)
Full work available at URL: http://mathnet.ru/eng/da945
Recommendations
Cites Work
- A New Upper Bound on the Block Error Probability After Decoding Over the Erasure Channel
- A secondary construction and a transformation on rotation symmetric functions, and their action on bent and semi-bent functions
- Title not available (Why is that?)
- Maximal values of generalized algebraic immunity
- Constructions of balanced odd-variable rotation symmetric Boolean functions with optimal algebraic immunity and high nonlinearity
- Concatenations of the hidden weighted bit function and their cryptographic properties
- On a method of derivation of lower bounds for the nonlinearity of Boolean functions
- Improving the Lower Bound on the Higher Order Nonlinearity of Boolean Functions With Prescribed Algebraic Immunity
- Exact relation between nonlinearity and algebraic immunity
- Improving the high order nonlinearity lower bound for Boolean functions with given algebraic immunity
- Exact relations between nonlinearity and algebraic immunity
- Boolean polynomials and linear transformations
- On equivalence classes of Boolean functions
- The algebraic immunity of Boolean functions
- On the zeros of Boolean polynomials
- Constructions of even-variable RSBFs with optimal algebraic immunity and high nonlinearity
- Asymptotic lower bound on the algebraic immunity of random balanced multi-output Boolean functions
- Symmetric boolean polynomials
- Fast algebraic immunity of Boolean functions
Cited In (7)
- Hilbert function and complexity lower bounds for symmetric Boolean functions
- An enhanced algorithm to search for low-degree annihilators for a Zhegalkin polynomial
- Boolean polynomials and linear transformations
- Annihilator characterizations of Boolean rings and Boolean lattices
- On the number of roots of Boolean polynomials
- Level structure of Zhegalkin polynomials, properties of test sets, and an annihilator search algorithm
- Title not available (Why is that?)
This page was built for publication: On the annihilators of Boolean polynomials
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5090146)