Skip to main content
Log in

Lagrange codes with simple realization

  • Published:
Cybernetics Aims and scope

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. V. M. Amerbaev and R. G. Biyashev, “Interpolation and error-correcting codes,” in: Coding Theory and Information Modeling [in Russian], Nauka, Alma-Ata (1973), pp. 57–63.

    Google Scholar 

  2. D. G. Zhimerin and V. I. Maksimenko, Elements of Construction of Large Data-Processing Computer Networks [in Russian], Statistika, Moscow (1976).

    Google Scholar 

  3. M. N. Belova, “Realization of an algorithm for the functioning of a specialized processor in a network of time-sharing computational centers using Lagrange codes,” Upravl. Sist. Mash., No. 1, 15–18 (1976).

    Google Scholar 

  4. R. G. Biyashev and M. N. Belova, “Computation of the fundamental polynomials for Lagrange codes correcting a single error,” Vopr. Kibern., Tashkent81, 141–147 (1975).

    Google Scholar 

  5. Yu. N. Cherkasov and S. S. Yurov, “Protection of semiconductor memory using parallel structure codes,” Élektron. Promst., No. 5, 52–55 (1977).

    Google Scholar 

Download references

Authors

Additional information

Translated from Kibernetika, No. 2, pp. 26–31, March–April, 1981.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Biyashev, R.G., Yurov, S.S. & Cherkasov, Y.N. Lagrange codes with simple realization. Cybern Syst Anal 17, 182–190 (1981). https://doi.org/10.1007/BF01069631

Download citation

  • Received:

  • Issue Date:

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

Keywords

Navigation