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, 1984, Volume 20, Issue 1, Pages 47–55 (Mi ppi1120)  
This article is cited in 2 scientific papers (total in 2 papers)

Coding Theory

Modular Curves and Codes with Polynomial Construction Complexity

S. G. Vlăduţ, G. L. Katsman, M. A. Tsfasman
Full-text PDF (1066 kB) Citations (2)
Abstract: The authors construct and analyze linear $q$-ary codes that arise from modular Drinfeld, and the associated binary codes. All these codes have polynomial complexity of construction and “good” asymptotic parameters: $q4-ary codes for $q=p^{2m}\geq 49$ lie above the Varshamov–Gilbert bound on some segment, while binary codes lie above the Blokh–Zyablov bound everywhere.
Received: 02.08.1982
Revised: 15.04.1983
Bibliographic databases:
Document Type: Article
UDC: 621.391.15:519.72
Language: Russian
Citation: S. G. Vlăduţ, G. L. Katsman, M. A. Tsfasman, “Modular Curves and Codes with Polynomial Construction Complexity”, Probl. Peredachi Inf., 20:1 (1984), 47–55; Problems Inform. Transmission, 20:1 (1984), 35–42
Citation in format AMSBIB
\Bibitem{VlaKatTsf84}
\by S.~G.~Vl{\u a}du\c t, G.~L.~Katsman, M.~A.~Tsfasman
\paper Modular Curves and Codes with Polynomial Construction Complexity
\jour Probl. Peredachi Inf.
\yr 1984
\vol 20
\issue 1
\pages 47--55
\mathnet{http://mi.mathnet.ru/ppi1120}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=776765}
\zmath{https://zbmath.org/?q=an:0555.94008}
\transl
\jour Problems Inform. Transmission
\yr 1984
\vol 20
\issue 1
\pages 35--42
Linking options:
  • https://www.mathnet.ru/eng/ppi1120
  • https://www.mathnet.ru/eng/ppi/v20/i1/p47
    • This publication is cited in the following 2 articles:
    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:478
    Full-text PDF :195
    First page:2
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024