Skip to main content
SpringerLink
Log in

Identification of boolean functions by methods of linear algebra

  • Published:
Ukrainian Mathematical Journal Aims and scope

Abstract

We prove that the problem of identification of a Boolean function by using methods of the theory of linear spaces over finite fields is solvable.

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. V. Yablonskii and O. B. Lupanov (editors),Discrete Mathematics and Mathematical Problems of Cybernetics [in Russian], Vol. 1, Nauka, Moscow (1974).

    Google Scholar 

  2. R. E. Blahut,Theory and Practice of Codes Controlling Errors [Russian translation], Mir, Moscow (1986).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Applied Mathematics and Mechanics, Ukrainian Academy of Sciences, Donetsk

    V. G. Skobelev & D. V. Speranskii

Authors
  1. V. G. Skobelev
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. D. V. Speranskii
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Translated from Ukrainskii Matematicheskii Zhurnal, Vol. 47, No. 2, pp. 260–268, February, 1995.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Skobelev, V.G., Speranskii, D.V. Identification of boolean functions by methods of linear algebra. Ukr Math J 47, 306–315 (1995). https://doi.org/10.1007/BF01056721

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01056721

Keywords

Search

Navigation