WCC 99

Journées "Codage et Cryptographie"

11-14 janvier 1999, PARIS (France)

Programme préliminaire

Dimanche 10 janvier

Apéritif et Accueil 18h30-20h30

Lundi 11 janvier

Accueil à partir de 8h
Conférence invitée 9h-10h On Self-Dual and Formally Self-Dual Codes
Vera Pless
Matin 10h-12h30
(pause café 10h25-10h50) 		Code structure
Déjeuner
Après-midi I 14h-15h40 Block codes, spherical codes and hash functions
Pause café
Après-midi II 16h-17h40 Decoding of block codes

Mardi 12 janvier

Conférence invitée 9h-10h New permutation polynomials and applications to codes, sequences and Boolean functions
Hans Dobbertin
Matin 10h-12h30
(pause café 10h25-10h50) 		Cryptography I
Déjeuner
Après-midi I.a (parallèle) 14h-15h40 Finite fields
Après-midi I.b (parallèle) 14h-15h40 Channel coding
Pause café
Après-midi II 16h-17h40 Coding Theory
Banquet 20h00

Mercredi 13 janvier

Conférence invitée 9h-10h Metrics generated by linear codes in cryptography
Ernst Gabidulin
Matin I 10h-11h15 Cryptography II
Pause café
Matin II 11h15-12h30 Codes over Z4
Déjeuner
Après-midi I 14h-15h40 Codes over rings
Pause café
Après-midi II 16h-17h40 Lattices and designs

Jeudi 14 janvier

Conférence invitée 9h-10h Invited talk on cryptography
Jim Massey
Matin 10h-12h30
(pause café 10h25-10h50) 		Convolutional codes

Lundi matin -- Code structure
Construction and classification of quasicyclic codes
K. Lally, P. Fitzpatrick
On the complexity of calculating the minimum norm of a binary code
I. Honkala, A. Lobstein
Perfect binary codes components
F.I. Soloveva
Permutation groups of error-correcting codes
N. Sendrier, G. Skersys
Recognition of a binary linear code as a vector-subspace
A. Valembois

Lundi après-midi I -- Block codes, spherical codes and hash functions
Bounds on the sizes of ternary weight-constrained codes
M. Svanstrom
On the quaternary [18,9,8] code
J. Olsson
Spherical codes generated by weighted unions
T. Ericson, V. Zinoviev
A new practical algorithm for the construction of a perfect hash function
M. Atici, D.R. Stinson, R. Wei

Lundi après-midi II -- Decoding of block codes
Iterative multistage maximum likelihood decoding of multi-level codes
D. Stojanovic, M.P.C. Fossorier, S. Lin
Permutation soft decision decoding of some expanded Reed-Solomon codes
E. Delpeyroux, J. Lacan
Bit-level soft-decision sequential decoding for Reed Solomon codes
M. Oh, P. Sweeney
On bounding the probability of decoding error with the minimum distance
J.-P. Tillich, G. Zémor

Mardi matin -- Cryptography I
On the relation of error correction and cryptography to an off line biometric based identification scheme
G.I. Davida, B.J. Matt, R. Peralta, Y. Frankel
Verifiable self-certified public keys
S. Kim, S. Oh, S. Park, D. Won
Authentication frauds from the point of view of rate-distortion theory
A. Sgarro
Cheating in split-knowledge RSA parameter generation
M. Joye, R. Pinch
Fair and efficient proof that two secrets are (not) equal -- How to solve the socialist millionaires' problem
F. Boudot, J. Traoré

Mardi après-midi I.a (parallèle) -- Finite fields
Finite fields, primitive normal bases with prescribed trace
D. Hachenberger
Bounds on the bilinear complexity of multiplication in any extension of $F_q$
S. Ballet
The a-invariant of some Reed-Muller type codes over the Veronese variety
C. Renteria, H. Tapia-Recillas
Multiplicative characters and design of sequences with good autocorrelation
C. Boursier

Mardi après-midi I.b (parallèle) -- Channel coding
On the capacity of distance enhancing constraints for high density magnetic recording channels
E. Soljanin, A.J. van Wijngaarden
Algebraic construction of good collision resistant signal sets
M. Greferath, E. Viterbo
Code constructions for block coded modulation systems with inter\discretionary {-block memory
C.-N. Peng, H. Chen, J.T. Coffey, R.G. C. Williams
Efficient multiplex for band-limited channels: Galois-field division multiple access
H.M. de Oliveira, R.M. Campello de Souza, A.N. Kauffman

Mardi après-midi II -- Coding Theory
Perfect codes and balanced generalized weighing matrices
D. Jungnickel, V. Tonchev
Higher order covering radii
P. Solé
Strengthening the Gilbert-Varshamov bound
A. Barg, S. Guritman, J. Simonis
Recursive MDS-codes
E. Couselo, S. Gonzalez, V. Markov, A. Nechaev

Mercredi matin I -- Cryptography II
A construction of systematic authentication codes based on error-correcting codes
S. Xu, H. van Tilborg
Arithmetic coding and data integrity
X. Liu, P.G. Farrell, C. Boyd

Mercredi matin II -- Codes over Z4
Negacyclic and cyclic codes over Z4
J. Wolfmann
Codes of constant Lee or Euclidean weight
J.A. Wood
On the covering radius of Z4-codes and their lattices
T. Aoki, P. Gaborit, M. Harada, M. Ozeki, P. Solé

Mercredi après-midi I -- Codes over rings
Permutation groups of extended cyclic codes over Galois rings
T. Blackford
Complete weight enumerators of generalized Kerdock code and linear recursive codes over Galois ring
A. Kuzmin, A. Nechaev
On the structure and Hamming distance of linear codes over Galois rings
G. Norton, A. Salagean-Mandache
Cyclic and affine invariant codes
K.S. Abdukhalikov

Mercredi après-midi II -- Lattices and designs
Lattices, codes and Radon transforms
M. Boguslavsky
Designs, harmonic functions, and codes
C. Bachoc
Extremal polynomials of degree $\tau + 2$ and $\tau + 3$, which improve the Delsarte bound for $\tau $-designs
S. Nikova, V. Nikov
On the maximum T-wise independent systems of Boolean functions
V. Levenshtein

Jeudi matin -- Convolutional codes
Decoding convolutional codes using a multiprocessor Bidirectional Creeper Algorithm
V. Imtawil, D.J. Tait
On low-density parity-check convolutional codes
K. Engdahl, K.S. Zigangirov
A Gallager-Tanner construction based on convolutional codes
S. Vialle, J. Boutros
New algorithm to identify rate k/n catastrophic punctured convolutional encoders
C. O'Donoghue, C. Burkley
Convolutional-like codes over discrete valuation rings and an application to 2-adic codes
N. Lagorce
retour à la page principale de WCC99.
Dernière modification le 21 décembre 1998.