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, 1986, Volume 22, Issue 2, Pages 98–103 (Mi ppi939)  
Сorrespondence

Fast Correlation Decoding of $p$-ary Codes of Maximal Length

L. V. Kanatova, V. L. Litvinov, L. M. Fink
Full-text PDF (711 kB)
Abstract: We consider a fast correlation decoding algorithm in the basis of Vilenkin–Chrestenson functions, which reduces computations over against known fast algorithms of spectral transforms.
Received: 28.05.1984
Revised: 19.11.1985
Bibliographic databases:
Document Type: Article
UDC: 621.391.15
Language: Russian
Citation: L. V. Kanatova, V. L. Litvinov, L. M. Fink, “Fast Correlation Decoding of $p$-ary Codes of Maximal Length”, Probl. Peredachi Inf., 22:2 (1986), 98–103
Citation in format AMSBIB
\Bibitem{KanLitFin86}
\by L.~V.~Kanatova, V.~L.~Litvinov, L.~M.~Fink
\paper Fast Correlation Decoding of $p$-ary Codes of Maximal Length
\jour Probl. Peredachi Inf.
\yr 1986
\vol 22
\issue 2
\pages 98--103
\mathnet{http://mi.mathnet.ru/ppi939}
\zmath{https://zbmath.org/?q=an:0622.94025}
Linking options:
  • https://www.mathnet.ru/eng/ppi939
  • https://www.mathnet.ru/eng/ppi/v22/i2/p98
    • 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:394
    Full-text PDF :166
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024