<E-Book>
Coding Theory and Applications : 3rd International Colloquium, Toulon, France, November 2-4, 1988. Proceedings / edited by Gerard Cohen, Jacques Wolfmann
(Lecture Notes in Computer Science. ISSN:16113349 ; 388)
Edition | 1st ed. 1989. |
---|---|
Publisher | Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer |
Year | 1989 |
Language | English |
Size | IX, 331 p : online resource |
Authors | Cohen, Gerard editor Wolfmann, Jacques editor SpringerLink (Online service) |
Subjects | LCSH:Coding theory LCSH:Information theory LCSH:Discrete mathematics LCSH:Cryptography LCSH:Data encryption (Computer science) FREE:Coding and Information Theory FREE:Discrete Mathematics FREE:Cryptology |
Notes | Codes and character sums -- Codes from some Artin-Schreier curves -- Families of codes exceeding the Varshamov-Gilbert bound -- Polynomial factorization using Brill-Noether algorithm -- New bounds on cyclic codes from algebraic curves -- Exponential sums and the Carlitz-Uchiyama bound -- Bounds on the use of the postal channel -- A new authentication algorithm -- A method for finding codewords of small weight -- Generating codewords in real space: Application to decoding -- Weighted decoding of linear block codes by solving a system of implicit equations -- Suboptimum weighted-output symbol-by-symbol decoding of block codes -- Results of generalized minimum distance decoding for block code of rate 1/2 -- An overview of recent results in the theory of burst-correcting codes -- Note for computing the minimun polynomial of elements in large finite fields -- A quaternary cyclic code, and a family of quadriphase sequences with low correlation properties -- A simple description of Kerdock codes -- Relation between the minimum weight of a linear code over GF(qm) and its q-ary image over GF(q) -- Covering in hypercubes -- More on the plane of order 10 -- Linear recurrence relations and an extended subresultant algorithm -- The future pan European mobile radiotelephone system a short overview -- Experimental direct-sequence spread-spectrum digital mobile radio transmission -- Concatenated coding schemes for H.F. (High Frequency) channels -- Bandwidth efficient coding on channels disturbed by jamming and impulse noise -- Error correcting coding scheme against partial time jammers -- Evaluation of a coding design for a very noisy channel / Evaluation d'une Configuration de Codage Pour une Ligne tres Bruitee -- Design and implementation of an asynchronous transmission process by code division multiple access -- Is minimal distance a good criterion? -- Open problem 1: Covering radius of the circuit code -- Open problem 2: Cyclic codes over rings and p-adic fields HTTP:URL=https://doi.org/10.1007/BFb0019841 |
TOC
Hide book details.
E-Book | Location | Media type | Volume | Call No. | Status | Reserve | Comments | ISBN | Printed | Restriction | Designated Book | Barcode No. |
---|---|---|---|---|---|---|---|---|---|---|---|---|
E-Book | オンライン | 電子ブック |
|
|
Springer eBooks | 9783540467267 |
|
電子リソース |
|
EB00224933 |