ON MINIMAL COSET COVERING OF SOLUTIONS OF A BOOLEAN EQUATION

Ashot Minasyan

Received N/A; revised N/A; accepted N/A

This work is licensed under Creative Commons Attribution–NonCommercial International License (CC BY-NC 4.0).

For the equation x1x2…xn+xn+1xn+2…x2n+x2n+1x2n+2…x3n=1 over the finite field F2 we estimate the minimal number of systems of linear equations over the same field such that the union of their solutions exactly coincides with the set of solutions of the equation. We prove in this article that the number in the question is not greater than 9nlog2⁡3+4.

Author(s)

Related Articles

ON UNIQUENESS OF HOLOMORPHIC AND BOUNDED OUTSIDE THE CLOSED LOGARITHMIC SECTOR FUNCTIONS REPRESENTABLE BY LACUNARY POWER SERIES

COMPUTER DETECTING AND PROCESSING OF THE SIGNALS OF A FLAT-COIL ABSOLUTE-POSITION SENSOR BASED SEISMIC DETECTOR

ON q-LATTICES AND q-ALGEBRAS

ON INCREASING HAZARD RATE OF WAITING TIME IN THE ||1|∞MG MODEL

ON DISTRIBUTION’S CONSTANT SLOWLY VARYING COMPONENT

ON MINIMAL COSET COVERING OF SOLUTIONS OF A BOOLEAN EQUATION

Subscribe to TheGufo Newsletter​

Subscribe to TheGufo Newsletter