Skip to main content
SpringerLink
Log in

Some applications of algorithms for constructing subspaces over a finite field

  • Brief Communications
  • Published:
Ukrainian Mathematical Journal Aims and scope

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

Literature cited

  1. E. Calabi and H. S. Wilf, “On the sequential and random selection of subspaces over a finite field,” J. Combin. Theory A,22, No. 1, 107–109 (1977).

    Google Scholar 

  2. G. Éndryus, Theory of Partitions [in Russian], Nauka, Moscow (1982).

    Google Scholar 

  3. V. D. Goppa, “Codes and information,” Usp. Mat. Nauk,39, No. 1, 77–120 (1984).

    Google Scholar 

  4. V. N. Sachkov, Introduction to Combinatorial Methods of Discrete Mathematics [in Russian], Nauka, Moscow (1982).

    Google Scholar 

  5. J. R. Goldman and G.-C. Rota, “On the foundations of combinatorial theory. IV. Finite vector spaces and Eulerian generating functions,” Stud. Appl. Math.,49, No. 3, 239–258 (1970).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Kiev

    V. I. Masol

Authors
  1. V. I. Masol
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Translated from Ukrainskii Matematicheskii Zhurnal, Vol. 41, No. 8, pp. 1146–1148, August, 1989.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Masol, V.I. Some applications of algorithms for constructing subspaces over a finite field. Ukr Math J 41, 991–993 (1989). https://doi.org/10.1007/BF01058323

Download citation

  • Received:

  • Issue Date:

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

Keywords

Search

Navigation