Skip to main content
Log in

Computation of a basis of symmetric functions in finite fields

  • Published:
Mathematical notes of the Academy of Sciences of the USSR Aims and scope Submit manuscript

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

Access this article

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

Instant access to the full article PDF.

Literature cited

  1. M. V. Mikhailyuk, “Complexity of computation of elementary symmetric functions in finite fields,” Dokl. Akad. Nauk SSSR,244, No. 5, 1072–1076 (1979).

    Google Scholar 

  2. B. L. van der Waerden, Algebra [Russian translation], Mir, Moscow (1976).

    Google Scholar 

  3. S. V. Yablonskii, “Introduction to the theory of functions of k-valued logic,” in: Discrete Mathematics and Mathematical Problems of Cybernetics [in Russian], Fizmatgiz, Moscow (1974), pp. 9–66.

    Google Scholar 

  4. E. R. Berlekamp, Algebraic Coding Theory, McGraw-Hill, New York (1968).

    Google Scholar 

  5. O. B. Lupanov, “On a certain approach to the synthesis of control systems — the principle of local coding,” in: Problems of Cybernetics [in Russian], No. 14, Nauka, Moscow (1965), pp. 31–110.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Additional information

Translated from Matematicheskie Zametki, Vol. 30, No. 2, pp. 291–304, August, 1981.

In conclusion, the author expresses deep gratitude to O. B. Lupanov for assistance in the preparation of the present note.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Mikhailyuk, M.V. Computation of a basis of symmetric functions in finite fields. Mathematical Notes of the Academy of Sciences of the USSR 30, 634–641 (1981). https://doi.org/10.1007/BF01708847

Download citation

  • Received:

  • Issue Date:

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

Keywords

Navigation