000 | 03793nam a22005175i 4500 | ||
---|---|---|---|
001 | 978-3-540-46726-7 | ||
003 | DE-He213 | ||
005 | 20160624102017.0 | ||
007 | cr nn 008mamaa | ||
008 | 121227s1989 gw | s |||| 0|eng d | ||
020 |
_a9783540467267 _9978-3-540-46726-7 |
||
024 | 7 |
_a10.1007/BFb0019841 _2doi |
|
050 | 4 | _aQA268 | |
072 | 7 |
_aGPJ _2bicssc |
|
072 | 7 |
_aGPF _2bicssc |
|
072 | 7 |
_aCOM031000 _2bisacsh |
|
082 | 0 | 4 |
_a003.54 _223 |
245 | 1 | 0 |
_aCoding Theory and Applications _h[electronic resource] : _b3rd International Colloquium Toulon, France, November 2–4, 1988 Proceedings / _cedited by Gérard Cohen, Jacques Wolfmann. |
260 | 1 |
_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg, _c1989. |
|
264 | 1 |
_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg, _c1989. |
|
300 |
_aIX, 331 p. _bonline resource. |
||
336 |
_atext _btxt _2rdacontent |
||
337 |
_acomputer _bc _2rdamedia |
||
338 |
_aonline resource _bcr _2rdacarrier |
||
347 |
_atext file _bPDF _2rda |
||
490 | 1 |
_aLecture Notes in Computer Science, _x0302-9743 ; _v388 |
|
505 | 0 | _aCodes 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. | |
650 | 0 | _aComputer science. | |
650 | 0 | _aData encryption (Computer science). | |
650 | 0 | _aCoding theory. | |
650 | 0 | _aCombinatorics. | |
650 | 1 | 4 | _aComputer Science. |
650 | 2 | 4 | _aCoding and Information Theory. |
650 | 2 | 4 | _aData Encryption. |
650 | 2 | 4 | _aCombinatorics. |
700 | 1 |
_aCohen, Gérard. _eeditor. |
|
700 | 1 |
_aWolfmann, Jacques. _eeditor. |
|
710 | 2 | _aSpringerLink (Online service) | |
773 | 0 | _tSpringer eBooks | |
776 | 0 | 8 |
_iPrinted edition: _z9783540516439 |
786 | _dSpringer | ||
830 | 0 |
_aLecture Notes in Computer Science, _x0302-9743 ; _v388 |
|
856 | 4 | 0 | _uhttp://dx.doi.org/10.1007/BFb0019841 |
942 |
_2EBK5877 _cEBK |
||
999 |
_c35171 _d35171 |