Date: 12-16 July 2010
Place: Soria, Spain
General timetable PDF file
Contributed talks:
Monday 12/7
- Thomas Feulner (University of Bayreuth) Canonization of Linear Codes
- Relinde Jurrius(Eindhoven University of Technology) Extended coset leader weight enumerator
- Irene Marquez (UVa) The relationship between GDD algorithms and the Gröbner representation of a linear code
- Hakan Ozadan (METU) The Hamming distance of cyclic codes of length p^s over GR(p^2,m)
Wednesday 14/7
- Johannes Zwanzger (University of Bayreuth) Construction of a new Z4-linear code whose Gray image has excellent minimum distance
- Guillaume Quintin (Laboratoire d'Informatique de l'Ecole Polytechnique) Root-finding in function fields for list-decoding
- Bernat Gastón Brasó (Universidad Autónoma de Barcelona) Optimal and Efficient Systematic Embedded Circulant Minimum Storage Regenerating Codes for d = k + 1 and n = 2k
- Felice Manganiello (Universität Zürich) Orbit codes in Network Coding
- Justin D. Peachey (Clemson University) Extended norm-trace codes
Thursday 15/7
- Stanislav Bulygin (Center for Advanced Security Research Darmstadt) Multivariate cryptography in CASED
- Houda Soudan (National school of engineering of Tunis) Study of cryptographic perfomances of G-SD identification scheme based on rank metric codes
- Morgan Barbier (Laboratoire d'Informatique de l'Ecole Polytechnique) How Coding Theory Can Help Steganography
- Albert Vico-Oton (Universitat Rovira i Virgili) On the size of the colluder set in fingerprinting attacks