Algebraic Coding: First French-Israeli Workshop, Paris, France, July 19 - 21, 1993. Proceedings: Lecture Notes in Computer Science, cartea 781
Editat de Gerard Cohen, Simon Litsyn, Antoine Lobstein, Gilles Zemoren Limba Engleză Paperback – 28 apr 1994
Din seria Lecture Notes in Computer Science
- 20%
Preț: 1020.28 lei - 20%
Preț: 629.71 lei -
Preț: 395.25 lei - 20%
Preț: 1359.66 lei - 20%
Preț: 342.61 lei - 20%
Preț: 327.36 lei - 20%
Preț: 336.86 lei - 20%
Preț: 487.46 lei - 20%
Preț: 324.19 lei - 20%
Preț: 432.78 lei - 20%
Preț: 293.24 lei - 20%
Preț: 984.64 lei - 20%
Preț: 620.33 lei - 20%
Preț: 850.42 lei - 20%
Preț: 328.94 lei - 20%
Preț: 573.45 lei - 20%
Preț: 1033.45 lei - 20%
Preț: 679.09 lei - 20%
Preț: 373.16 lei - 20%
Preț: 782.57 lei - 20%
Preț: 434.17 lei - 20%
Preț: 489.11 lei - 20%
Preț: 904.16 lei - 20%
Preț: 375.72 lei - 20%
Preț: 400.17 lei - 20%
Preț: 631.96 lei - 20%
Preț: 373.80 lei - 20%
Preț: 556.96 lei - 20%
Preț: 731.97 lei - 20%
Preț: 560.93 lei - 20%
Preț: 733.68 lei - 15%
Preț: 558.12 lei - 20%
Preț: 400.77 lei - 20%
Preț: 488.90 lei - 20%
Preț: 340.04 lei - 20%
Preț: 403.00 lei - 20%
Preț: 327.36 lei - 20%
Preț: 330.54 lei - 20%
Preț: 568.70 lei - 20%
Preț: 563.29 lei - 20%
Preț: 315.62 lei - 20%
Preț: 355.27 lei - 20%
Preț: 733.68 lei - 20%
Preț: 793.92 lei - 20%
Preț: 1391.87 lei - 20%
Preț: 519.32 lei
Preț: 321.98 lei
Preț vechi: 402.47 lei
-20%
Puncte Express: 483
Preț estimativ în valută:
56.94€ • 66.82$ • 49.39£
56.94€ • 66.82$ • 49.39£
Carte tipărită la comandă
Livrare economică 09-23 martie
Specificații
ISBN-13: 9783540578437
ISBN-10: 3540578439
Pagini: 344
Ilustrații: XII, 332 p.
Dimensiuni: 155 x 235 x 18 mm
Greutate: 0.48 kg
Ediția:1994
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seria Lecture Notes in Computer Science
Locul publicării:Berlin, Heidelberg, Germany
ISBN-10: 3540578439
Pagini: 344
Ilustrații: XII, 332 p.
Dimensiuni: 155 x 235 x 18 mm
Greutate: 0.48 kg
Ediția:1994
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seria Lecture Notes in Computer Science
Locul publicării:Berlin, Heidelberg, Germany
Public țintă
ResearchCuprins
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.