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


Probl. Peredachi Inf., 1999, Volume 35, Issue 2, Pages 38–50 (Mi ppi441)  

This article is cited in 4 scientific papers (total in 4 papers)

Coding Theory

The Berlekamp–Massey Algorithm over a Finite Commutative Ring

V. L. Kurakin


Abstract: An algorithm for finding a monic polynomial of the least degree that generates a given sequence of length $\ell$ over a finite commutative ring $R$ with identity is presented. The complexity of the algorithm is $O(\ell_2)$ operations in $R$ as $\ell\to\infty$.

Full text: PDF file (1290 kB)

English version:
Problems of Information Transmission, 1999, 35:2, 125–135

Bibliographic databases:
UDC: 621.391.15
Received: 20.04.1998

Citation: V. L. Kurakin, “The Berlekamp–Massey Algorithm over a Finite Commutative Ring”, Probl. Peredachi Inf., 35:2 (1999), 38–50; Problems Inform. Transmission, 35:2 (1999), 125–135

Citation in format AMSBIB
\Bibitem{Kur99}
\by V.~L.~Kurakin
\paper The Berlekamp--Massey Algorithm over a~Finite Commutative Ring
\jour Probl. Peredachi Inf.
\yr 1999
\vol 35
\issue 2
\pages 38--50
\mathnet{http://mi.mathnet.ru/ppi441}
\mathscinet{http://www.ams.org/mathscinet-getitem?mr=1728906}
\zmath{https://zbmath.org/?q=an:1158.94396}
\transl
\jour Problems Inform. Transmission
\yr 1999
\vol 35
\issue 2
\pages 125--135


Linking options:
  • http://mi.mathnet.ru/eng/ppi441
  • http://mi.mathnet.ru/eng/ppi/v35/i2/p38

    SHARE: VKontakte.ru FaceBook Twitter Mail.ru Livejournal Memori.ru


    Citing articles on Google Scholar: Russian citations, English citations
    Related articles on Google Scholar: Russian articles, English articles

    This publication is cited in the following articles:
    1. V. R. Sidorenko, G. Schmidt, “A linear algebraic approach to multisequence shift-register synthesis”, Problems Inform. Transmission, 47:2 (2011), 149–165  mathnet  crossref  mathscinet  isi
    2. V. L. Kurakin, V. V. Vyazovich, “An algorithm for construction of the annihilator of a polylinear recurring sequence over a finite commutative ring”, Discrete Math. Appl., 21:5-6 (2011), 587–612  mathnet  crossref  crossref  mathscinet  elib
    3. O. E. Sergeeva, “Raspoznavanie rekurrentnykh posledovatelnostei, porozhdaemykh konservativnymi funktsiyami”, PDM. Prilozhenie, 2014, no. 7, 71–72  mathnet
    4. Sidorenko V., Bossert M., “Fast Skew-Feedback Shift-Register Synthesis”, Des. Codes Cryptogr., 70:1-2, SI (2014), 55–67  crossref  mathscinet  zmath  isi  elib
  • Проблемы передачи информации Problems of Information Transmission
    Number of views:
    This page:699
    Full text:256

     
    Contact us:
     Terms of Use  Registration  Logotypes © Steklov Mathematical Institute RAS, 2020