### Abstract

This paper addresses the question of how often the square code of an arbitrary l-dimensional subcode of the code GRSk(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 stated and used in [10] where Wieschebrink applied the Sidelnikov-Shestakov attack [8] to brake the Berger-Loidreau cryptostystem [1].

Original language | English |
---|---|

Title of host publication | Seventh International Workshop on Coding and Cryptography 2011 (WCC 2011, Paris, France, April 11-15, 2011) |

Pages | 1-10 |

Publication status | Published - 2011 |

## Fingerprint Dive into the research topics of 'The non-gap sequence of a subcode of a generalized Reed-Solomon code'. Together they form a unique fingerprint.

## Cite this

Márquez-Corbella, I., Martínez-Moro, E., & Pellikaan, G. R. (2011). The non-gap sequence of a subcode of a generalized Reed-Solomon code. In

*Seventh International Workshop on Coding and Cryptography 2011 (WCC 2011, Paris, France, April 11-15, 2011)*(pp. 1-10)