Algebraic Coding : First French-Israeli Workshop Paris, France, July 19-21, 1993 Proceedings /

Saved in:

Bibliographic Details
Imprint:	Berlin, Heidelberg : Springer-Verlag, 1994.
Description:	1 online resource : v.: digital.
Language:	English
Series:	Lecture Notes in Computer Science, 0302-9743 ; 781 Lecture notes in computer science ; 781.
Subject:	Computer science. Data encryption (Computer science) Coding theory. Combinatorial analysis. Telecommunication. Coding theory. Combinatorial analysis. Computer science. Data encryption (Computer science) Telecommunication.
Format:	E-Resource Book
URL for this record:	http://pi.lib.uchicago.edu/1001/cat/bib/11078082

Hidden Bibliographic Details
Other authors / contributors:	Cohen, G. Litsyn, Simon, 1957- Lobstein, A. (Antoine) Zémor, G.
ISBN:	9783540483571 3540483578 0387578439 9780387578439 3540578439 9783540578437 9783540578437
Digital file characteristics:	text file PDF
Notes:	Includes bibliographical references. English.
Summary:	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.
Other form:	Print version: Algebraic Coding. Berlin, Heidelberg : Springer-Verlag, 1994
Standard no.:	10.1007/3-540-57843-9

Table of Contents:

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.

Algebraic Coding : First French-Israeli Workshop Paris, France, July 19-21, 1993 Proceedings /

Similar Items