Skip to main content
SpringerLink
Log in

Description of some classes of equiprobable Boolean functions with no zero Fourier coefficients

  • Published:
Cybernetics and Systems Analysis Aims and scope

Abstract

Theory of groups and methods of combinatorial analysis are used to obtain some classes of equiprobable Boolean functions with no zero Fourier coefficients.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. S. Lang, Algebra, Springer Verlag, New York (2002).

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. V. M. Glushkov Institute of Cybernetics, National Academy of Sciences of Ukraine, Kyiv, Ukraine

    A. A. Levitskaya

Authors
  1. A. A. Levitskaya
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

__________

Translated from Kibernetika i Sistemnyi Analiz, No. 6, pp. 95–111, November–December 2006.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Levitskaya, A.A. Description of some classes of equiprobable Boolean functions with no zero Fourier coefficients. Cybern Syst Anal 42, 851–865 (2006). https://doi.org/10.1007/s10559-006-0125-0

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10559-006-0125-0

Keywords

Search

Navigation