Talk abstract:
We consider binary primitive cyclic codes generated by a product of two minimal generators. We first present the links between these codes and other objects appearing in cryptography, mainly sequences and boolean functions.
Although these objects, and their "good" properties, are known for a long time, many problems remain open. We next explain recent results which have concern with the classification of such cyclic codes by means of their minimal distance.
Below are the complete materials used during the talk.
| slide 1 | slide 2 | slide 3 | slide 4 | slide 5 | slide 6 | slide 7 | slide 8 | slide 9 | slide 10 | slide 11 |
| slide 12 | slide 13 | slide 14 | slide 15 | slide 16 | slide 17 | slide 18 | slide 19 | slide 20 | slide 21 | slide 22 |
Institute for Mathematics and Its
Applications home page
Back to Workshop Schedule
Back to top