2 citations · 2 across the 1 of their papers we have counts for
2 papers
cs.IT2015
On the shape of the general error locator polynomial for cyclic codes
Fabrizio Caruso, Emmanuela Orsini, Massimiliano Sala +1
A general result on the explicit form of the general error locator polynomial for all cyclic codes is given, along with several results for infinite classes of cyclic codes with $t…
cs.DM2014★ 2 cited
A Discrete Logarithm-based Approach to Compute Low-Weight Multiples of Binary Polynomials
P. Peterlongo, M. Sala, C. Tinnirello
Being able to compute efficiently a low-weight multiple of a given binary polynomial is often a key ingredient of correlation attacks to LFSR-based stream ciphers. The best known g…