Coding Theory And Applications: 2nd International Colloquium, Cachan-paris, France, November 24-26, 1986. Proceedings (lecture Notes In Computer Science)
معرفی کتاب «Coding Theory And Applications: 2nd International Colloquium, Cachan-paris, France, November 24-26, 1986. Proceedings (lecture Notes In Computer Science)» نوشتهٔ Toby Berger (auth.), G. Cohen, P. Godlewski (eds.)، منتشرشده توسط نشر Springer-Verlag Berlin Heidelberg در سال 1988. این کتاب در 20 صفحه، فرمت djvu، زبان انگلیسی ارائه شده است.
This book contains a selection of papers presented at a Symposium on coding theory: "3 Journées sur le Codage", held November 24-26, 1986, in Cachan near Paris, France. It gives an account of the state of the art of research in France on Coding, ranging from rather theoretical topics like algebraic geometry and combinatorial coding to applications like modulation, real-space decoding and implementation of coding algorithms on microcomputers. The symposium was the second one of this type. With its broad spectrum, it was a unique opportunity for contacts between university and industry on the topics of information and coding theory. Information theory in random fields....Pages 1-18 Linear complexity in coding theory....Pages 19-32 K-permutivity....Pages 33-38 On the density of best coverings in hamming spaces....Pages 39-44 The les association scheme....Pages 45-55 On modular weights in arithmetic codes....Pages 56-67 Optimum ’1’ — Ended binary prefix codes....Pages 68-75 Optimality of right leaning trees....Pages 76-85 Specification, synchronisation, a verage length....Pages 86-95 Amelioration of the McWilliams-Sloane tables using geometric codes from curves with genus 1,2 or 3....Pages 96-105 A [32,17,14]-geometric code coming from a singular curve....Pages 106-115 The generalized Goppa codes and related discrete designs from hermitian surfaces in PG(3, s 2 )....Pages 116-124 Projective reed-muller codes....Pages 125-129 A lower bound on the minimum euclidean distance of trellis codes....Pages 130-140 On the inherent intractability of soft decision decoding of linear codes....Pages 141-149 Weighted decoding as a means for reestimating a probability distribution (abstract)....Pages 150-153 A weighted-output symbol-by-symbol decoding algorithm of binary convolutional codes....Pages 154-158 Search for sequences with zero autocorrelation....Pages 159-172 Adapted codes for communication through multipath channel....Pages 173-182 Coding and decoding algorithms of Reed-Solomon codes executed on a M68000 microprocessor....Pages 183-196 This book contains a selection of papers presented at a Symposium on coding theory: "3 Journees sur le Codage", held November 24-26, 1986, in Cachan near Paris, France. The purpose of this survey is to show how character sums can be used in order to get upper bounds on the covering radius and on the minimum distance of a code.
دانلود کتاب Coding Theory And Applications: 2nd International Colloquium, Cachan-paris, France, November 24-26, 1986. Proceedings (lecture Notes In Computer Science)