Synthesizing all linearized shift-registers of the minimal or required length

Vladimir R. Sidorenko, Martin Bossert

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

5 Citations (Scopus)

Abstract

An efficient algorithm synthesizing all q-linearized shift-registers of the minimal or required length generating a sequence of length N over a finite field IFqm is considered. This algorithm, which is a generalization of the Berlekamp-Massey algorithm, has time complexity O(N2) operations in IFqm, and can be applied for efficient solving the key equation when decoding Gabidulin codes up to and beyond half the minimum rank distance.

Original languageEnglish
Title of host publication2010 International ITG Conference on Source and Channel Coding, SCC 2010
Publication statusPublished - 2010
Externally publishedYes
Event2010 International ITG Conference on Source and Channel Coding, SCC 2010 - Siegen, Germany
Duration: 18 Jan 201021 Jan 2010

Publication series

Name2010 International ITG Conference on Source and Channel Coding, SCC 2010

Conference

Conference2010 International ITG Conference on Source and Channel Coding, SCC 2010
Country/TerritoryGermany
CitySiegen
Period18/01/1021/01/10

Fingerprint

Dive into the research topics of 'Synthesizing all linearized shift-registers of the minimal or required length'. Together they form a unique fingerprint.

Cite this