Coding Theory and Applications: 3rd International Colloquium Toulon, France, November 2–4, 1988 Proceedings

Codes and character sums....Pages 1-12
Codes from some Artin-Schreier curves....Pages 13-27
Families of codes exceeding the Varshamov-Gilbert bound....Pages 28-36
Polynomial factorization using Brill-Noether algorithm....Pages 37-46
New bounds on cyclic codes from algebraic curves....Pages 47-62
Exponential sums and the Carlitz-Uchiyama bound....Pages 63-75
Bounds on the use of the postal channel....Pages 77-90
A new authentication algorithm....Pages 91-105
A method for finding codewords of small weight....Pages 106-113
Generating codewords in real space: Application to decoding....Pages 114-122
Weighted decoding of linear block codes by solving a system of implicit equations....Pages 123-133
Suboptimum weighted-output symbol-by-symbol decoding of block codes....Pages 134-146
Results of generalized minimum distance decoding for block code of rate 1/2....Pages 147-161
An overview of recent results in the theory of burst-correcting codes....Pages 163-184
Note for computing the minimun polynomial of elements in large finite fields....Pages 185-192
A quaternary cyclic code, and a family of quadriphase sequences with low correlation properties....Pages 193-201
A simple description of Kerdock codes....Pages 202-208
Relation between the minimum weight of a linear code over GF(q m ) and its q-ary image over GF(q)....Pages 209-212
Covering in hypercubes....Pages 213-225
More on the plane of order 10....Pages 226-231
Linear recurrence relations and an extended subresultant algorithm....Pages 232-243
The future pan European mobile radiotelephone system a short overview....Pages 245-254
Experimental direct-sequence spread-spectrum digital mobile radio transmission....Pages 255-268
Concatenated coding schemes for H.F. (High Frequency) channels....Pages 269-278
Bandwidth efficient coding on channels disturbed by jamming and impulse noise....Pages 279-293
Error correcting coding scheme against partial time jammers....Pages 294-300
Evaluation of a coding design for a very noisy channel....Pages 301-311
Design and implementation of an asynchronous transmission process by code division multiple access....Pages 312-322
Is minimal distance a good criterion?....Pages 323-327
Open problem 1: Covering radius of the circuit code....Pages 328-328
Open problem 2: Cyclic codes over rings and p -adic fields....Pages 329-329