TY - JOUR
T1 - The non-gap sequence of a subcode of a generalized Reed-Solomon code
AU - Márquez-Corbella, I.
AU - Martínez-Moro, E.
AU - Pellikaan, G.R.
PY - 2013
Y1 - 2013
N2 - This paper addresses the question how often the square code of an arbitrary l-dimensional subcode of the code GRS k (a, b) is exactly the code GRS2k-1(a, b * b). To answer this question we first introduce the notion of gaps of a code which allows us to characterize such subcodes easily. This property was first used and stated by Wieschebrink where he applied the Sidelnikov–Shestakov attack to break the Berger–Loidreau cryptosystem.
AB - This paper addresses the question how often the square code of an arbitrary l-dimensional subcode of the code GRS k (a, b) is exactly the code GRS2k-1(a, b * b). To answer this question we first introduce the notion of gaps of a code which allows us to characterize such subcodes easily. This property was first used and stated by Wieschebrink where he applied the Sidelnikov–Shestakov attack to break the Berger–Loidreau cryptosystem.
U2 - 10.1007/s10623-012-9694-2
DO - 10.1007/s10623-012-9694-2
M3 - Article
SN - 0925-1022
VL - 66
SP - 317
EP - 333
JO - Designs, Codes and Cryptography
JF - Designs, Codes and Cryptography
IS - 1
ER -