TY - GEN
T1 - Synthesizing all linearized shift-registers of the minimal or required length
AU - Sidorenko, Vladimir R.
AU - Bossert, Martin
PY - 2010
Y1 - 2010
N2 - 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.
AB - 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.
UR - https://www.scopus.com/pages/publications/77952781235
M3 - Conference contribution
AN - SCOPUS:77952781235
SN - 9781424468720
T3 - 2010 International ITG Conference on Source and Channel Coding, SCC 2010
BT - 2010 International ITG Conference on Source and Channel Coding, SCC 2010
T2 - 2010 International ITG Conference on Source and Channel Coding, SCC 2010
Y2 - 18 January 2010 through 21 January 2010
ER -