RUS  ENG JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB
General information
Latest issue
Archive
Impact factor

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., 2011, Volume 47, Issue 2, Pages 72–89 (Mi ppi2046)  

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

Automata Theory

A linear algebraic approach to multisequence shift-register synthesis

V. R. Sidorenkoab, G. Schmidtc

a Ulm University, Germany
b aKharkevich Institute for Information Transmission Problems, Russian Academy of Sciences, Moscow
c bEsslingen University of Applied Sciences, Germany

Abstract: An efficient algorithm which synthesizes all shortest linear-feedback shift registers generating $K$ given sequences with possibly different lengths over a field is derived, and its correctness is proved. The proposed algorithm generalizes the Berlekamp–Massey and Feng–Tzeng algorithms and is based on Massey's ideas. The time complexity of the algorithm is $O(K\lambda N)\lesssim O(KN^2)$, where $N$ is the length of a longest sequence and $\lambda$ is the linear complexity of the sequences.

Full text: PDF file (302 kB)
References: PDF file   HTML file

English version:
Problems of Information Transmission, 2011, 47:2, 149–165

Bibliographic databases:

UDC: 621.391.1+004.7
Received: 31.03.2008
Revised: 29.12.2010

Citation: V. R. Sidorenko, G. Schmidt, “A linear algebraic approach to multisequence shift-register synthesis”, Probl. Peredachi Inf., 47:2 (2011), 72–89; Problems Inform. Transmission, 47:2 (2011), 149–165

Citation in format AMSBIB
\Bibitem{SidSch11}
\by V.~R.~Sidorenko, G.~Schmidt
\paper A linear algebraic approach to multisequence shift-register synthesis
\jour Probl. Peredachi Inf.
\yr 2011
\vol 47
\issue 2
\pages 72--89
\mathnet{http://mi.mathnet.ru/ppi2046}
\mathscinet{http://www.ams.org/mathscinet-getitem?mr=2857788}
\transl
\jour Problems Inform. Transmission
\yr 2011
\vol 47
\issue 2
\pages 149--165
\crossref{https://doi.org/10.1134/S0032946011020062}
\isi{http://gateway.isiknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=PARTNER_APP&SrcAuth=LinksAMR&DestLinkType=FullRecord&DestApp=ALL_WOS&KeyUT=000299375200006}
\scopus{http://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-80051684992}


Linking options:
  • http://mi.mathnet.ru/eng/ppi2046
  • http://mi.mathnet.ru/eng/ppi/v47/i2/p72

    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. Sidorenko V., Richter G., Bossert M., “Linearized shift-register synthesis”, IEEE Trans. Inform. Theory, 57:9 (2011), 6025–6032  crossref  mathscinet  isi  elib  scopus
    2. 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  scopus
    3. Puchinger S. Nielsen Johan Rosenkilde Ne Li W. Sidorenko V., “Row Reduction Applied to Decoding of Rank-Metric and Subspace Codes”, Designs Codes Cryptogr., 82:1-2, SI (2017), 389–409  crossref  mathscinet  zmath  isi  scopus
    4. Rosenkilde J., “Power Decoding Reed-Solomon Codes Up to the Johnson Radius”, Adv. Math. Commun., 12:1 (2018), 81–106  crossref  mathscinet  zmath  isi  scopus
  • Проблемы передачи информации Problems of Information Transmission
    Number of views:
    This page:256
    Full text:58
    References:28
    First page:14

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