EUROCODE 1990: Udine, Italy

Gérard D. Cohen, Pascale Charpin (Eds.): EUROCODE '90, International Symposium on Coding Theory and Applications, Udine, Italy, November 5-9, 1990, Proceedings. Lecture Notes in Computer Science 514 Springer 1991, ISBN 3-540-54303-1

1. Codes

Thomas H. E. Ericson, Victor A. Zinoviev:
Concatenated spherical codes. 2-5
Michele Elia, Giorgio Taricco:
A note on automorphism groups of codes and symbol error probability computation. 6-20
Thierry P. Berger:
A direct proof for the automorphism group of Reed-Solomon codes. 21-29
Thomas Beth, Dejan E. Lazic, Vojin Senk:
A family of binary codes with asymptotically good distance distribution. 30-41
Claude Carlet:
A transformation of boolean functions, its consequences on some problems related to Reed-Muller codes. 42-50
Philippe Langevin:
Covering radius of RM (1, 9) in RM (3, 9). 51-59
François Rodier:
The weights of the duals of binary BCH codes of designed distance delta=9. 60-64
Daniel Augot, Pascale Charpin, Nicolas Sendrier:
The minimum distance of some binary codes via the Newton's identities. 65-73

J. Burger, Hervé Chabanne, Marc Girault:
Minimum-change binary block-codes which are well balanced. 76-86
A. O. Mabogunje, Patrick G. Farrell:
Construction of unequal error protection codes. 87-93
Gérard D. Cohen, Luisa Gargano, Ugo Vaccaro:
Unidirectional error-detecting codes. 94-105
André Montpetit:
Coherent partitions and codes. 106-113
Annie Astié-Vidal, Vincent Dugat:
(1/lambda)-regular and (1/lambda)-homogeneous tournaments. 114-124

Dominique Le Brigand:
Decoding of codes on hyperelliptic curves. 126-134
D. Rotillon, J. A. Thiong-Ly:
Decoding of codes on the Klein Quartic. 135-149
Conny Voss:
Asymptotically good families of geometric Goppa codes and the Gilbert-Varshamov bound. 150-157
Marc Perret:
Multiplicative character sums and non linear geometric codes. 158-165

Marc Girault:
A survey of identification schemes. 168-179
Sami Harari:
A correlation cryptographic scheme. 180-192
Jacques Patarin:
Pseudorandom permutations based on the DES scheme. 193-204
Harriet J. Fell:
Linear complexity of transformed sequences. 205-214
Guy Chassé:
Some remarks on a LFSR "disturbed" by other sequences. 215-221
Reiner Creutzburg:
Paramters for complex FFTs infinite residue class rings. 222-226
Josep Domingo-Ferrer, Llorenç Huguet i Rotger:
A cryptographic tool for programs protection. 227-240

David Haccoun:
Decoding techniques for convolutional codes. 242-258
Rémi Sfez, Gerard Battail:
A weighted-output variant of the Viterbi algorithm for concatenated schemes using a convolutional inner code. 259-270
Renato Baldini Filho, Patrick G. Farrell:
Coded modulation with convolutional codes over rings. 271-280

Andrea Sgarro:
A Shannon-theoretic coding theorem in authentication theory. 282-291
Anna Fioretto, Andrea Sgarro:
Joint fractional entropy. 292-297
Gerard Battail, Mauro Guazzo:
On the adaptive source coding. 298-308
Renato M. Capocelli, Alfredo De Santis:
Minimum codeword length and redundancy of Huffman codes. 309-317

A. Robert Calderbank:
Binary covering codes and high speed data transmission. 320-336
Gerard Battail, Hélio Magalhães De Oliveira, Zhang Weidong:
Coding and modulation for the Gaussian channel, in the absence or in the presence of fluctuations. 337-349
Rémi Sfez, J. C. Belfiore, K. Leeuwin, A. Fihel:
Comparison of two modulation-coding schemes for low-rate digital land mobile radio communication. 350-363
K. Leeuwin, J. C. Belfiore, Ghassan Kawas Kaleh:
Chernoff bound of trellis coded modulation over correlated Rayleigh channel. 364-376

Marc M. Darmon, Philippe R. Sadot:
A hybrid FEC-ARQ communication system using sequential decoding. 378-384
Jean-Luc Politano, Dominique Deprey:
A 30 Mbits/s (255, 223) Reed-Solomon decoder. 385-392