Coding theory and applications : 2nd international colloquium, Cachan-Paris, France, November 24-26, 1986 : proceedings
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...
Enregistré dans:
| Institution som forfatter: | |
|---|---|
| Andre forfattere: | , |
| Format: | Livre numérique |
| Sprog: | Anglais |
| Udgivet: |
Berlin [etc.] :
Springer
[20..].
Cham : Springer Nature |
| Serier: | Lecture notes in computer science
311 |
| Fag: | |
| Online adgang: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| Kommentar: |
Archives Springer e-books (Licence nationale) Archives Springer e-books (Licence nationale) |
| Autres localisations: | Voir dans le Sudoc |
| Edition sous un autre format: | • Coding theory and applications, proceedings, 2nd International Colloquium, Cachan-Paris, novembre 1986, Berlin, Springer-Verlag, 1986, 1 vol. (XIV-196 p.), Lecture notes in computer science, 3-540-19368-5 • Coding Theory and Applications, Texte imprimé, 9783662200766 |
Indholdsfortegnelse:
- Information theory in random fields
- Linear complexity in coding theory
- K-permutivity
- On the density of best coverings in hamming spaces
- The les association scheme
- On modular weights in arithmetic codes / Au Sujet des Poids Modulaires dans les codes Arithmetiques
- Optimum 1 Ended binary prefix codes
- Optimality of right leaning trees
- Specification, synchronisation, a verage length
- Amelioration of the McWilliams-Sloane tables using geometric codes from curves with genus 1,2 or 3
- A [32,17,14]-geometric code coming from a singular curve / Un Code Geometrique Sur F16 de Parametres [32,17,14] Construit a Partir D'Une Courbe Singuliere
- The generalized Goppa codes and related discrete designs from hermitian surfaces in PG(3, s2)
- Projective reed-muller codes
- A lower bound on the minimum euclidean distance of trellis codes
- On the inherent intractability of soft decision decoding of linear codes
- Weighted decoding as a means for reestimating a probability distribution (abstract)
- A weighted-output symbol-by-symbol decoding algorithm of binary convolutional codes
- Search for sequences with zero autocorrelation
- Adapted codes for communication through multipath channel / Codages Adaptés à la Communication avec Tsrajets multiples
- Coding and decoding algorithms of Reed-Solomon codes executed on a M68000 microprocessor.