Algebraic Coding [[electronic resource] ] : First French-Israeli Workshop, Paris, France, July 19 - 21, 1993. Proceedings / / edited by Gerard Cohen, Simon Litsyn, Antoine Lobstein, Gilles Zemor |
Edizione | [1st ed. 1994.] |
Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1994 |
Descrizione fisica | 1 online resource (XII, 332 p.) |
Disciplina | 004.0151 |
Collana | Lecture Notes in Computer Science |
Soggetto topico |
Computers
Coding theory Information theory Data encryption (Computer science) Combinatorics Electrical engineering Theory of Computation Coding and Information Theory Cryptology Communications Engineering, Networks |
ISBN | 3-540-48357-8 |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | 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. |
Record Nr. | UNISA-996465794303316 |
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1994 | ||
Materiale a stampa | ||
Lo trovi qui: Univ. di Salerno | ||
|
Algebraic Coding [[electronic resource] ] : First French-Soviet Workshop, Paris, July 22-24, 1991. Proceedings / / edited by Gerard Cohen, Simon N. Litsyn, Antoine Lobstein, Gilles Zemor |
Edizione | [1st ed. 1992.] |
Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1992 |
Descrizione fisica | 1 online resource (XI, 161 p.) |
Disciplina | 003/.54 |
Collana | Lecture Notes in Computer Science |
Soggetto topico |
Computers
Coding theory Information theory Algebraic geometry Combinatorics Electrical engineering Theory of Computation Coding and Information Theory Algebraic Geometry Communications Engineering, Networks |
ISBN | 3-540-46739-4 |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | On the correlation of sequences -- On Gaussian sums for finite fields and elliptic curves -- Exponential sums and constrained error-correcting codes -- Constructions of codes with covering radius 2 -- On perfect weighted coverings with small radius -- An extremal problem related to the covering radius of binary codes -- Bounds on covering radius of dual product codes -- Remarks on greedy codes -- On nonbinary codes with fixed distance -- Saddle point techniques in asymptotic coding theory -- Non-binary low rate convolutional codes with almost optimum weight spectrum -- Position recovery on a circle based on coding theory -- The lower bound for cardinality of codes correcting errors and defects -- Soft decoding for block codes obtained from convolutional codes -- Partial ordering of error patterns for maximum likelihood soft decoding -- A fast matrix decoding algorithm for rank-error-correcting codes -- A fast search for the maximum element of the fourier spectrum -- Coding theorem for discrete memoryless channels with given decision rule -- Decoding for multiple-access channels. |
Record Nr. | UNISA-996465642403316 |
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1992 | ||
Materiale a stampa | ||
Lo trovi qui: Univ. di Salerno | ||
|