Keywords:
Combinatorics
;
Computer science
;
Data encryption (Computer science)
;
Coding theory
;
Telecommunication
;
Information theory.
;
Discrete mathematics.
;
Cryptography.
;
Communications Engineering, Networks
;
Coding and Information Theory
;
Computer Science
;
Combinatorics
;
Data Encryption
;
Konferenzschrift
;
Codierungstheorie
Description / 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.
Type of Medium:
Online Resource
Pages:
Online-Ressource (XII, 326 S.)
Edition:
Online-Ausg. Berlin [u.a.] Springer 2006 Springer lecture notes archive
ISBN:
9783540483571
Series Statement:
Lecture notes in computer science 781
URL:
http://www.springerlink.com/content/kk0868431037
URL:
http://www.springerlink.de/openurl.asp?genre=book&isbn=978-3-540-57843-7
URL:
http://dx.doi.org/10.1007/3-540-57843-9
URL:
https://doi.org/10.1007/3-540-57843-9
URL:
https://zbmath.org/?q=an:0866.00068
URL:
https://external.dandelon.com/download/attachments/dandelon/ids/DEAGI14CBA.pdf
DOI:
10.1007/3-540-57843-9
Language:
English
Note:
Literaturangaben
Permalink