Info
- Utilizzare la checkbox di selezione a fianco di ciascun documento per attivare le funzionalità di stampa, invio email, download nei formati disponibili del (i) record.
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
| 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
| 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 | ||
| ||
Applied Algebra, Algebraic Algorithms and Error-Correcting Codes [[electronic resource] ] : 11th International Symposium, AAECC-11, Paris, France, July 17-22, 1995. Proceedings / / edited by Gerard Cohen, Marc Giusti, Teo Mora
| Applied Algebra, Algebraic Algorithms and Error-Correcting Codes [[electronic resource] ] : 11th International Symposium, AAECC-11, Paris, France, July 17-22, 1995. Proceedings / / edited by Gerard Cohen, Marc Giusti, Teo Mora |
| Edizione | [1st ed. 1995.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1995 |
| Descrizione fisica | 1 online resource (XI, 484 p.) |
| Disciplina | 005.7/2 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Computers
Computer security Data encryption (Computer science) Coding theory Information theory Computer science—Mathematics Combinatorics Theory of Computation Systems and Data Security Cryptology Coding and Information Theory Symbolic and Algebraic Manipulation |
| ISBN | 3-540-49440-5 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Supports of a code -- Chemical isomerism, a challenge for algebraic combinatorics and for computer science -- On algebraic methods in covering radius problems -- How lower and upper complexity bounds meet in elimination theory -- Bivariate polynomial multiplication patterns -- Division of entire functions by polynomial ideals -- Variations on minimal codewords in linear codes -- On the computation of the radical of polynomial complete intersection ideals -- Which families of long binary linear codes have a binomial weight distribution? -- The discovery of simple 7-designs with automorphism group P?L(2, 32) -- Fast exponentation in cryptography -- On maximal spherical codes I -- Formal computation of Galois groups with relative resolvents -- A case of automatic theorem proving in Euclidean geometry: the Maclane 83 theorem -- Isometry classes of indecomposable linear codes -- When polynomial equation systems can be “solved” fast? -- Using symmetric functions to describe the solution set of a zero dimensional ideal -- Triangular systems and factorized Gröbner bases -- Computation in algebraic function fields for effective construction of algebraic-geometric codes -- Singly-even self-dual codes and Hadamard matrices -- Implicitization of curves parameterized by generalized trigonometric polynomials -- Randomness properties of partial ? - ? planes as LSI test inputs and their implementations -- Mixed covering codes with two binary and four ternary coordinates -- About approximations of exponentials -- A note on normal bases -- On the covering radius of long Goppa codes -- Integration of multivariate rational functions given by straight-line programs -- Polynomial gcd computations over towers of algebraic extensions -- Displacements of matrix products -- Testing identities of series defined by algebraic partial differential equations -- The complexity of formal resolution of linear partial differential equations -- A fast parallel implementation of the Berlekamp-Massey algorithm with a 1D systolic array architecture -- Tomography of constructible functions -- On the determination of formal solutions of a system of partial differential equations -- D 4, E 6, E 8 and the AGM -- Computation of the Galois groups of the resolvent factors for the direct and inverse Galois problems -- First integrals and Darboux polynomials of homogeneous linear differential systems. |
| Record Nr. | UNISA-996466132903316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1995 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Applied Algebra, Algebraic Algorithms and Error-Correcting Codes [[electronic resource] ] : 10th International Symposium, AAECC-10, San Juan de Puerto Rico, Puerto Rico, May 10-14, 1993. Proceedings / / edited by Gerard Cohen, Teo Mora, Oscar Moreno
| Applied Algebra, Algebraic Algorithms and Error-Correcting Codes [[electronic resource] ] : 10th International Symposium, AAECC-10, San Juan de Puerto Rico, Puerto Rico, May 10-14, 1993. Proceedings / / edited by Gerard Cohen, Teo Mora, Oscar Moreno |
| Edizione | [1st ed. 1993.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1993 |
| Descrizione fisica | 1 online resource (X, 362 p.) |
| Disciplina | 005.7/2 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Number theory
Algebra Computers Coding theory Information theory Computer science—Mathematics Combinatorics Number Theory Theory of Computation Coding and Information Theory Symbolic and Algebraic Manipulation |
| ISBN | 3-540-47630-X |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Sequence based methods for data transmission and source compression -- On the apparent duality of the Kerdock and Preparata codes -- Bounds for codes as solutions of extremum problems for systems of orthogonal polynomials -- Systems of algebraic equations solved by means of endomorphisms -- Criteria for sequence set design in CDMA communications -- Using Groebner bases to determine the algebraic and transcendental nature of field extensions: Return of the killer tag variables -- A “Divide and conquer” algorithm for Hilbert-Poincaré series, multiplicity and dimension of monomial ideals -- An efficient algorithm for the sparse mixed resultant -- Some features of binary block codes for correcting asymmetric errors -- Fixed-parameter complexity and cryptography -- A class of algebraic geometric codes from curves in high-dimensional projective spaces -- A new class of sequences: Mapping sequences -- A zero-test and an interpolation algorithm for the shifted sparse polynomials -- Parallelization of quantifier elimination on a workstation network -- Hyperplane sections of fermat varieties in P 3 in char. 2 and some applications to cyclic codes -- Analysis of Coppersmith's block Wiedemann algorithm for the parallel solution of sparse linear systems -- Relations among Lie formal series and construction of symplectic integrators -- Exponential sums as discrete fourier transform with invariant phase functions -- Application of finite fields to memory interleaving -- An elementary proof of a partial improvement to the Ax-Katz Theorem -- Energy functions associated with error-correcting codes -- On determining all codes in semi-simple group rings -- On hyperbolic cascaded Reed-Solomon codes -- Peak-shift and bit error-correction with channel side information in runlength-limited sequences -- On a third order differential equation whose differential Galois group is the simple group of 168 elements -- Approximating the number of error locations within a constant ratio is NP-complete -- Two chosen-plaintext attacks on the Li-Wang joint authentication and encryption scheme -- Some constructions of perfect binary codes. |
| Record Nr. | UNISA-996466080103316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1993 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Coding Theory and Applications [[electronic resource] ] : 3rd International Colloquium, Toulon, France, November 2-4, 1988. Proceedings / / edited by Gerard Cohen, Jacques Wolfmann
| Coding Theory and Applications [[electronic resource] ] : 3rd International Colloquium, Toulon, France, November 2-4, 1988. Proceedings / / edited by Gerard Cohen, Jacques Wolfmann |
| Edizione | [1st ed. 1989.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1989 |
| Descrizione fisica | 1 online resource (IX, 331 p.) |
| Disciplina | 003.54 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Coding theory
Information theory Discrete mathematics Data encryption (Computer science) Combinatorics Coding and Information Theory Discrete Mathematics Cryptology |
| ISBN | 3-540-46726-2 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Codes and character sums -- Codes from some Artin-Schreier curves -- Families of codes exceeding the Varshamov-Gilbert bound -- Polynomial factorization using Brill-Noether algorithm -- New bounds on cyclic codes from algebraic curves -- Exponential sums and the Carlitz-Uchiyama bound -- Bounds on the use of the postal channel -- A new authentication algorithm -- A method for finding codewords of small weight -- Generating codewords in real space: Application to decoding -- Weighted decoding of linear block codes by solving a system of implicit equations -- Suboptimum weighted-output symbol-by-symbol decoding of block codes -- Results of generalized minimum distance decoding for block code of rate 1/2 -- An overview of recent results in the theory of burst-correcting codes -- Note for computing the minimun polynomial of elements in large finite fields -- A quaternary cyclic code, and a family of quadriphase sequences with low correlation properties -- A simple description of Kerdock codes -- Relation between the minimum weight of a linear code over GF(qm) and its q-ary image over GF(q) -- Covering in hypercubes -- More on the plane of order 10 -- Linear recurrence relations and an extended subresultant algorithm -- The future pan European mobile radiotelephone system a short overview -- Experimental direct-sequence spread-spectrum digital mobile radio transmission -- Concatenated coding schemes for H.F. (High Frequency) channels -- Bandwidth efficient coding on channels disturbed by jamming and impulse noise -- Error correcting coding scheme against partial time jammers -- Evaluation of a coding design for a very noisy channel / Evaluation d'une Configuration de Codage Pour une Ligne tres Bruitee -- Design and implementation of an asynchronous transmission process by code division multiple access -- Is minimal distance a good criterion? -- Open problem 1: Covering radius of the circuit code -- Open problem 2: Cyclic codes over rings and p-adic fields. |
| Record Nr. | UNISA-996465728603316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1989 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Coding Theory and Applications [[electronic resource] ] : 2nd International Colloquium, Cachan-Paris, France, November 24-26, 1986. Proceedings / / edited by Gerard Cohen, Philippe Godlewski
| Coding Theory and Applications [[electronic resource] ] : 2nd International Colloquium, Cachan-Paris, France, November 24-26, 1986. Proceedings / / edited by Gerard Cohen, Philippe Godlewski |
| Edizione | [1st ed. 1988.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1988 |
| Descrizione fisica | 1 online resource (XVI, 200 p.) |
| Disciplina | 003.54 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Coding theory
Information theory Discrete mathematics Computers Coding and Information Theory Discrete Mathematics Theory of Computation |
| ISBN | 3-540-39243-2 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Information theory in random fields -- Linear complexity in coding theory -- K-permutivity -- On the density of best coverings in hamming spaces -- The les association scheme -- On modular weights in arithmetic codes / Au Sujet des Poids Modulaires dans les codes Arithmetiques -- Optimum ’1’ — Ended binary prefix codes -- Optimality of right leaning trees -- Specification, synchronisation, a verage length -- Amelioration of the McWilliams-Sloane tables using geometric codes from curves with genus 1,2 or 3 -- A [32,17,14]-geometric code coming from a singular curve / Un Code Geometrique Sur F16 de Parametres [32,17,14] Construit a Partir D'Une Courbe Singuliere -- The generalized Goppa codes and related discrete designs from hermitian surfaces in PG(3, s2) -- Projective reed-muller codes -- A lower bound on the minimum euclidean distance of trellis codes -- On the inherent intractability of soft decision decoding of linear codes -- Weighted decoding as a means for reestimating a probability distribution (abstract) -- A weighted-output symbol-by-symbol decoding algorithm of binary convolutional codes -- Search for sequences with zero autocorrelation -- Adapted codes for communication through multipath channel / Codages Adaptés à la Communication avec Tsrajets multiples -- Coding and decoding algorithms of Reed-Solomon codes executed on a M68000 microprocessor. |
| Record Nr. | UNISA-996465687303316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1988 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
EUROCODE '90 [[electronic resource] ] : International Symposium on Coding Theory and Applications, Udine, Italy, November 5-9, 1990. Proceedings / / edited by Gerard Cohen, Pascale Charpin
| EUROCODE '90 [[electronic resource] ] : International Symposium on Coding Theory and Applications, Udine, Italy, November 5-9, 1990. Proceedings / / edited by Gerard Cohen, Pascale Charpin |
| Edizione | [1st ed. 1991.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1991 |
| Descrizione fisica | 1 online resource (XII, 396 p.) |
| Disciplina | 003/.54 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Computers
Discrete mathematics Data encryption (Computer science) Coding theory Information theory Theory of Computation Discrete Mathematics Cryptology Coding and Information Theory |
| ISBN | 3-540-47546-X |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Concatenated spherical codes codes sphériques concaténés -- A note on automorphism groups of codes and symbol error probability computation -- A direct proof for the automorphism group of reed solomon codes -- A family of binary codes with asymptotically good distance distribution -- A transformation on boolean functions, its consequences on some problems related to reed-muller codes -- Covering radius of RM(1,9) in RM(3,9) -- The weights of the duals of binary bch codes of designed distance δ=9 -- The minimum distance of some binary codes via the newton's identities -- Minimum-change binary block-codes which are well balanced -- Construction of unequal error protection codes -- Unidirectional error detecting codes -- Coherent partitions and codes -- 1λ-regular and1λ-homogeneous tournaments -- Decoding of codes on hyperelliptic curves -- Decoding of codes on the klein quartic -- Asymptotically good families of geometric goppa codes and the gilbert-varshamov bound -- Multiplicative character sums and non linear geometric codes -- A survey of identification schemes -- A correlation cryptographic scheme -- Pseudorandom permutations based on the D.E.S. scheme -- Linear complexity of transformed sequences -- Some remarks on a LFSR “disturbed” by other sequences -- Parameters for complex FFTs in finite residue class rings -- A cryptographic tool for programs protection -- Decoding techniques for convolutional codes -- A weighted-output variant of the viterbi algorithm for concatenated schemes using a convolutional inner code / Une Variante À Sortie Pondérée De L'Algorithme De Viterbi Pour Des Schémas Concaténés À Code Intérieur Convolutif -- Coded modulation with convolutional codes over rings -- A shannon-theoretic coding theorem in authentication theory -- Joint fractional entropy -- On the adaptive source coding / Sur Le Codage De Source Adaptatif -- Minimum codeword length and redundancy of Huffman codes -- Binary covering codes and high speed data transmission -- Coding and modulation for the gaussian channel, in the absence or in the presence of fluctuations / Codage Et Modulation Pour Le Canal Gaussien, Sans Ou Avec Fluctuations -- Comparison of two modulation-coding schemes for low-rate digital land mobile radiocommunication -- Chernoff bound of trellis coded modulation over correlated rayleigh channel -- A hybrid FEC-ARQ communication system using sequential decoding -- A 30 Mbits/s (255,223) reed-solomon decoder. |
| Record Nr. | UNISA-996465542403316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1991 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||