Large systems of Boolean functions: realization by modular arithmetic methods (Q2487679)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 2193766
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Large systems of Boolean functions: realization by modular arithmetic methods |
scientific article; zbMATH DE number 2193766 |
Statements
Large systems of Boolean functions: realization by modular arithmetic methods (English)
0 references
8 August 2005
0 references
The author introduces and studies modular arithmetical polynomial representations of systems of Boolean functions. Such codings may be used in computationally efficient methods to treat large systems of Boolean functions. Both unimodular and multimodular representations are considered, and upper bounds for the ranges of coefficients needed are presented. All concepts and methods are illustrated by detailed examples.
0 references
Boolean functions
0 references
digital signal processing
0 references
modular arithmetics
0 references
0.8065999746322632
0 references
0.7985061407089233
0 references
0.7687371373176575
0 references
0.7647753357887268
0 references
0.7540547847747803
0 references
