WCC 2001: Preliminary program

Sunday January 7

18:00 - 20:00 Cocktail and Registration

Monday January 8

8:00 - 9:00Registration
9:00 - 10:00 Invited talk -- Sequences with good correlations and some open problems - T. Helleseth
Coffee break
10:30 - 11:20 Public-key cryptography
11:20 - 12:35 Codes and Cryptography
Lunch
15:00 - 16:40 Sequences
Coffee break
17:00 - 18:15 Boolean functions

Tuesday January 9

9:00 - 10:00Invited talk -- Distance regular spherical codes - T. Ericson
Coffee break
10:30-12:35 Weights of codes
Lunch
15:00-16:40(Parallel)
Codes over weak structures I Protocols
Coffee break
17:10-18:00(Parallel)
Constellations and spherical codes Designs
20:00 Banquet

Wednesday January 10

9:00 - 10:00 Invited talk -- Code duality and orthogonal arrays: relationships and applications - J. Massey
Coffee break
10:30 - 11:20 Symmetric cryptography
11:20 - 12:35 Decoding I
Lunch

Thursday January 11

9:00 - 10:00Invited talk -- Cryptography and biodiversity - F. Morain
Coffee break
10:30 - 11:45 Discrete logarithm
11:45 - 12:35 Codes over weak structures II
Lunch
15:00-16:15(Parallel)
Automorphisms of codes Geometric codes
Coffee break
16:45 - 18:00(Parallel)
Codes over weak structures III Decoding II

Friday January 12

9:00-10:15Self-dual codes
Coffee break
10:45-12:00 Block codes
Buffet

Monday, 10:30-11:20 -- Public-key cryptography
A lattice-based McEliece scheme for encryption and signature
P. Solé, C. Charnes, B. Martin
Modified GPT PKC with Right Scrambler
E. M. Gabidulin and A. V. Ourivski

Monday, 11:20-12:35 -- Codes and Cryptography
Intersecting codes and partially identifying codes
G. Cohen, S. Encheva, S. Litsyn
Codes for Strong Identification
Iiro Honkala, Tero Laihonen and Sanna Ranto
Multicovering Bounds from Linear Inequalities
Andrew Klapper

Monday, 15:00-16:40 -- Sequences
Perfect Codes and Balanced Generalized Weighing Matrices, II
Dieter Jungnickel and Vladimir D. Tonchev
(2^m-1, w, 2) Optical Orthogonal Codes with w = 11 and 13
Cunsheng Ding and Chaoping Xing
New Families of Ideal 2-level Autocorrelation Ternary Sequences From Second Order DHT
Michael Ludkovski and Guang Gong
Generalised Rudin-Shapiro Constructions
Matthew G. Parker, C. Tellambura

Monday, 17:00-18:15 -- Boolean functions
New Constructions of Resilient and Correlation Immune Boolean Functions achieving Upper Bounds on Nonlinearity
Enes Pasalic, Thomas Johansson, Subhamoy Maitra and Palash Sarkar
Highly Nonlinear Balanced Boolean Functions with very good Autocorrelation Property
Subhamoy Maitra
On the Non-Minimal codewords of weight $2d_{min}$ in the binary Reed-Muller Code
Yuri Borissov, Nickolay Manev, Svetla Nikova

Tuesday, 10:30-12:35 -- Weights of codes
Polynomial invariants for binary linear codes
Johannes Maks and Juriaan Simonis
On Weight Hierarchies of Product Codes. The Wei-Yang Conjecture and more.
Conchita Martínez-Pérez, Hans Georg Schaathun, and Wolfgang Willems
Estimates of the distance distribution of codes and designs
A. Ashikhmin, A. Barg, S. Litsyn
On Equidistant Constant Weight Codes
Fang-Wei Fu, Torleiv Kloeve, Yuan Luo, Victor K. Wei
The Structure of Linear Codes of Constant Weight
Jay A. Wood

Tuesday, 15:00-16:40 -- Codes over weak structures I
Cyclic Codes over Z_4 of Oddly Even Length
Tom Blackford
Cyclic Codes of Length 2^e over Z4
T. Abualrub, and R. Oehmke
On extremal additive F4 codes of length 10 to 18
Christine Bachoc, Philippe Gaborit
A Griesmer Bound for Codes over Finite Quasi-Frobenius Rings
Keisuke Shiromoto and Leo Storme

Tuesday, 15:00-16:40 -- Protocols
Quantum Identification Protocol with Technologically Bounded Parties.
Anderson C. A. Nascimento, Joern Mueller-Quade and Hideki Imai
Linear Broadcast Encryption Schemes
C. Padro, I. Gracia, S. Martin and P. Morillo
A Ramp Model for Distributed Key Distribution Schemes
Carlo Blundo, Paolo D'Arco, and Carles Padro
Generation of Key Predistribution Schemes using Secret Sharing Schemes
Germán Sáez

Tuesday, 17:10-18:00 -- Constellations and spherical codes
On the Optimality of Finite Constellations from Algebraic Lattices
J. Carmelo Interlando, Michele Elia and Trajano Pires da Nobrega Neto
Superimposed Codes in $R^n$ Obtained from Spherical Codes
Danyo Danev

Tuesday, 17:10-18:00 -- Designs
Efficient 2-Stage Group Testing
Toby Berger and Vladimir Levenshtein
On the metrical rigidity of binary codes
S.V. Avgustinovich and F.I. Soloveva

Wednesday, 10:30-11:20 -- Symmetric cryptography
An analysis of the 3gpp-MAC scheme
L.R. Knudsen and C.J. Mitchell
Linear and Differential Cryptanalysis of Russian GOST
V. V. Shorin, V. V. Jelezniakov and E. M. Gabidulin

Wednesday, 11:20-12:35 -- Decoding I
Symbol-by-symbol Decoding as an Approximation of Word-by-word Decoding
Gérard Battail
Performance limits of compound codes with symbol-based iterative decoding
Sawaya, Vialle, Boutros and Zemor
New Decoding Error Probability Bounds for Fixed Convolutional Codes used in BSC
Dmitri V. Truhachev, Karin Engdahl and Kamil Sh. Zigangirov

Thursday, 10:30-11:45 -- Discrete logarithm
On Some Uniformity of Distribution Properties of ESIGN
Edwin El Mahassni and Igor Shparlinski
Weil Descent Of Jacobians
Steven D. Galbraith
Interpolation of the discrete logarithm by Boolean functions
Tanja Lange and Arne Winterhof

Thursday, 11:45-12:35 -- Codes over weak structures II
Binary Images of Cyclic codes over Z4
Jacques Wolfmann
A Generalization of Negacyclic Codes
H. Tapia-Recillas and G. Vega

Thursday, 15:00-16:15 -- Automorphisms of codes
The number of inequivalent irreducible Goppa codes
John A. Ryan and Patrick Fitzpatrick
Defining sets of cyclic codes invariant under the affine group.
Kanat Abdukhalikov
Decomposing Quasi-Cyclic Codes
San Ling and Patrick Solé

Thursday, 15:00-16:15 -- Geometric codes
Dependent rational points on curves over finite fields - Lefschetz theorems and exponential sums
Johan P. Hansen
Bounding minimum distances of cyclic codes using algebraic geometry
Nigel Boston
Goppa-like bounds for the generalized Feng-Rao distances
J. I. Farran and C. Munuera

Thursday, 16:45-18:00 -- Codes over weak structures III
Strong Groebner bases and cyclic codes over a finite-chain ring
Graham H. Norton and Ana Salagean
Z4-linear Hadamard and extended perfect codes
Krotov D. S.

Thursday, 16:45-18:00 -- Decoding II
Reliability-Based Soft-Decision Decoding with Iterative Information Set Reduction
Marc Fossorier
LDPC codes: a group algebra formulation
Elke Offer and Emina Soljanin
Decoding a class of alternant codes for the Lee metric
Eimear Byrne

Friday, 9:00-10:15 -- Self-dual codes
On Quadratic Double Circulant Codes
Philippe Gaborit
Higher Weights and Binary Self-Dual Codes
Steven T. Dougherty and T. Aaron Gulliver
On the Minimum Weights of Type IV codes over Z_4 with Certain Lengths
Stefka Bouyuklieva

Friday, 10:45-12:00 -- Block codes
Linear Recursive MDS-Codes and Asturian Codes
Elena Couselo, Santos Gonzalez, Victor Markov, Alexandr Nechaev
A hypergraph approach to the identifying parent property: the case of multiple parents
A. Barg, G. Cohen, S. Encheva, G. Kabatiansky, G. Zemor
The average dimension of the hull of cyclic codes
Gintaras Skersys

Back to the Home Page of WCC 2001.
Anne Canteaut (Anne.Canteaut@inria.fr)
Last modification on December, 13th 2000.