webcal

Description

Coding Theory and Cryptography Seminar

Speaker: Tovohery Randrianarisoa, University of Zurich, Switzerland

Date & Time: 15th February (Thursday), 4-5:30pm

Venue: Ramanujan Hall

Title: On a metric using the linear complexity on finite sequences.

Abstract: Using the linear complexity on finite sequences over a finite
field F,
I will define a metric on F^n. We will develop a coding theory using the
new
metric. I will also give the exact expression of number of finite sequences
of
length n with a fixed linear complexity l. A possible application is a new
cryptosystem similar to the McEliece cryptosystem but with a different
metric
on the code.