|
|
|
|
| LEADER |
03747nmm a2200433 u 4500 |
| 001 |
EB000658532 |
| 003 |
EBX01000000000000001349472 |
| 005 |
00000000000000.0 |
| 007 |
cr||||||||||||||||||||| |
| 008 |
140122 ||| eng |
| 020 |
|
|
|a 9783540483571
|
| 100 |
1 |
|
|a Cohen, Gerard
|e [editor]
|
| 245 |
0 |
0 |
|a Algebraic Coding
|h Elektronische Ressource
|b First French-Israeli Workshop, Paris, France, July 19 - 21, 1993. Proceedings
|c edited by Gerard Cohen, Simon Litsyn, Antoine Lobstein, Gilles Zemor
|
| 250 |
|
|
|a 1st ed. 1994
|
| 260 |
|
|
|a Berlin, Heidelberg
|b Springer Berlin Heidelberg
|c 1994, 1994
|
| 300 |
|
|
|a XII, 332 p
|b online resource
|
| 505 |
0 |
|
|a A necessary and sufficient condition for time-variant convolutional encoders to be noncatastrophic -- On the design and selection of convolutional codes for a bursty Rician channel -- Modulo-2 separable linear codes -- Estimation of the size of the list when decoding over an arbitrarily varying channel -- A lower bound on binary codes with covering radius one -- On some mixed covering codes of small length -- The length function: A revised table -- On the covering radius of convolutional codes -- Efficient multi-signature schemes for cooperating entities -- Montgomery-suitable cryptosystems -- Secret sharing schemes with veto capabilities -- Group-theoretic hash functions -- On constructions for optimal optical orthogonal codes -- On complementary sequences -- Spectral-null codes and null spaces of Hadamard submatrices -- On small families of sequences with low periodic correlation -- Disjoint systems (Extended abstract) -- Some sufficient conditions for 4-regular graphs to have 3-regular subgraphs -- Detection and location of given sets of errors by nonbinary linear codes -- Quaternary constructions of formally self-dual binary codes and unimodular lattices -- New lower bounds for some spherical designs -- Lattices based on linear codes -- Quantizing and decoding for usual lattices in the L p -metric -- Bounded-distance decoding of the Leech lattice and the Golay code -- Some restrictions on distance distribution of optimal binary codes -- Two new upper bounds for codes of distance 3 -- On Plotkin-Elias type bounds for binary arithmetic codes -- Bounds on generalized weights -- Threshold effects in codes -- Decoding a bit more than the BCH bound -- Product codes and the singleton bound -- Erasure correction performance of linear block codes
|
| 653 |
|
|
|a Coding and Information Theory
|
| 653 |
|
|
|a Coding theory
|
| 653 |
|
|
|a Computer science
|
| 653 |
|
|
|a Cryptography
|
| 653 |
|
|
|a Information theory
|
| 653 |
|
|
|a Data encryption (Computer science)
|
| 653 |
|
|
|a Telecommunication
|
| 653 |
|
|
|a Communications Engineering, Networks
|
| 653 |
|
|
|a Discrete Mathematics
|
| 653 |
|
|
|a Cryptology
|
| 653 |
|
|
|a Discrete mathematics
|
| 653 |
|
|
|a Theory of Computation
|
| 700 |
1 |
|
|a Litsyn, Simon
|e [editor]
|
| 700 |
1 |
|
|a Lobstein, Antoine
|e [editor]
|
| 700 |
1 |
|
|a Zemor, Gilles
|e [editor]
|
| 041 |
0 |
7 |
|a eng
|2 ISO 639-2
|
| 989 |
|
|
|b SBA
|a Springer Book Archives -2004
|
| 490 |
0 |
|
|a Lecture Notes in Computer Science
|
| 028 |
5 |
0 |
|a 10.1007/3-540-57843-9
|
| 856 |
4 |
0 |
|u https://doi.org/10.1007/3-540-57843-9?nosfx=y
|x Verlag
|3 Volltext
|
| 082 |
0 |
|
|a 004.0151
|
| 520 |
|
|
|a This volume presents the proceedings of the first French-Israeli Workshop on Algebraic Coding, which took place in Paris in July 1993. The workshop was a continuation of a French-Soviet Workshop held in 1991 and edited by the same board. The thoroughly refereed papers in this volume are grouped into parts on: convolutional codes and special channels, covering codes, cryptography, sequences, graphs and codes, sphere packings and lattices, and bounds for codes
|