Problemy Peredachi Informatsii
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive
Impact factor
Guidelines for authors

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS


Probl. Peredachi Inf.:
Year:
Volume:
Issue:
Page:
Find




Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register

Problemy Peredachi Informatsii, 1972, Volume 8, Issue 1, Pages 36–44 (Mi ppi773)  
Coding Theory

Redundancy of Linear Codes with Orthogonal and $\lambda$-Connected Checks

V. S. Kugurakov
Full-text PDF (830 kB)
Abstract: Lower and upper bounds are derived for the minimum possible number of redundant symbols of linear (cyclic in particular) codes of length $n$ correcting one additive error by orthogonal and $\lambda$-connected checks. Some asymptotic results are also given
Received: 04.02.1971
Bibliographic databases:
Document Type: Article
UDC: 621.391.15
Language: Russian
Citation: V. S. Kugurakov, “Redundancy of Linear Codes with Orthogonal and $\lambda$-Connected Checks”, Probl. Peredachi Inf., 8:1 (1972), 36–44; Problems Inform. Transmission, 8:1 (1972), 25–32
Citation in format AMSBIB
\Bibitem{Kug72}
\by V.~S.~Kugurakov
\paper Redundancy of Linear Codes with Orthogonal and $\lambda$-Connected Checks
\jour Probl. Peredachi Inf.
\yr 1972
\vol 8
\issue 1
\pages 36--44
\mathnet{http://mi.mathnet.ru/ppi773}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=359990}
\zmath{https://zbmath.org/?q=an:0286.94011}
\transl
\jour Problems Inform. Transmission
\yr 1972
\vol 8
\issue 1
\pages 25--32
Linking options:
  • https://www.mathnet.ru/eng/ppi773
  • https://www.mathnet.ru/eng/ppi/v8/i1/p36
    • Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Проблемы передачи информации Problems of Information Transmission
    Statistics & downloads:
    Abstract page:221
    Full-text PDF :79
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024