Cantitate/Preț
Produs
Total produse
Vezi coșul
Algebraic Coding de Gerard Cohen

Algebraic Coding

Editat de Gerard Cohen, Simon Litsyn, Antoine Lobstein, Gilles Zemor
en Limba Engleză Paperback – 28 apr 1994
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.
Citește tot Restrânge

Preț: 32441 lei

Preț vechi: 40551 lei
-20%

Puncte Express: 487

Carte tipărită la comandă

Livrare economică 27 iulie-10 august

Livrare prin curier în România Termenul estimat este afișat lângă disponibilitate.
Transport gratuit de la 40000 lei Plată online sau ramburs, în funcție de opțiunile comenzii.
Retur gratuit în 14 zile Comandă securizată și suport în română.
 Adaugă în coș

Wish list
Gift list
Am citit!
Adaugă în listă

Specificații

ISBN-13: 9783540578437
ISBN-10: 3540578439
Pagini: 344
Ilustrații: XII, 332 p.
Dimensiuni: 155 x 235 x 19 mm
Greutate: 0.52 kg
Ediția:1994
Editura: Springer
Locul publicării:Berlin, Heidelberg, Germany

Public țintă

Research

Cuprins

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.