EUROCODE '90 | International Symposium on Coding Theory and Applications, Udine, Italy, November 5-9, 1990. Proceedings. Questo articolo non è disponibile.EUROCODE '90 | International Symposium on Coding Theory and Applications, Udine, Italy, November 5-9, 1990. Proceedings

This book presents a selection of the papers presented at EUROCODE '90, the symposium on coding theory held in Udine, Italy, November 1990. It gives the state of the art on coding in Europe and ranges from theoretical top- ics like algebraic geometry and combinatorial coding to applications like modulation, real-space decoding and VLSI implementation. The book is divided into eight sections: - Algebraic codes - Combinatorial codes - Geometric codes - Protection of information - Convolutional codes - Information theory - Modulation - Applications of coding. Five of the sections are introduced by an invited contribution.

Concatenated spherical codes codes sphériques concaténés.- A note on automorphism groups of codes and symbol error probability computation.- A direct proof for the automorphism group of reed solomon codes.- A family of binary codes with asymptotically good distance distribution.- A transformation on boolean functions, its consequences on some problems related to reed-muller codes.- Covering radius of RM(1,9) in RM(3,9).- The weights of the duals of binary bch codes of designed distance ?=9.- The minimum distance of some binary codes via the newton's identities.- Minimum-change binary block-codes which are well balanced.- Construction of unequal error protection codes.- Unidirectional error detecting codes.- Coherent partitions and codes.- $$\frac{1}{\lambda }$$ -regular and $$\frac{1}{\lambda }$$ -homogeneous tournaments.- Decoding of codes on hyperelliptic curves.- Decoding of codes on the klein quartic.- Asymptotically good families of geometric goppa codes and the gilbert-varshamov bound.- Multiplicative character sums and non linear geometric codes.- A survey of identification schemes.- A correlation cryptographic scheme.- Pseudorandom permutations based on the D.E.S. scheme.- Linear complexity of transformed sequences.- Some remarks on a LFSR “disturbed” by other sequences.- Parameters for complex FFTs in finite residue class rings.- A cryptographic tool for programs protection.- Decoding techniques for convolutional codes.- A weighted-output variant of the viterbi algorithm for concatenated schemes using a convolutional inner code / Une Variante À Sortie Pondérée De L'Algorithme De Viterbi Pour Des Schémas Concaténés À Code Intérieur Convolutif.- Coded modulation with convolutional codes over rings.- A shannon-theoretic coding theorem in authentication theory.- Joint fractional entropy.- On the adaptive source coding / Sur Le Codage De Source Adaptatif.- Minimum codeword length and redundancy of Huffman codes.- Binary covering codes and high speed data transmission.- Coding and modulation for the gaussian channel, in the absence or in the presence of fluctuations / Codage Et Modulation Pour Le Canal Gaussien, Sans Ou Avec Fluctuations.- Comparison of two modulation-coding schemes for low-rate digital land mobile radiocommunication.- Chernoff bound of trellis coded modulation over correlated rayleigh channel.- A hybrid FEC-ARQ communication system using sequential decoding.- A 30 Mbits/s (255,223) reed-solomon decoder.