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.
Applied Algebra, Algebraic Algorithms and Error-Correcting Codes [[electronic resource] ] : 12th International Symposium, AAECC-12, Toulouse, France, June, 23-27, 1997, Proceedings / / edited by Teo Mora, Harold F. Mattson
| Applied Algebra, Algebraic Algorithms and Error-Correcting Codes [[electronic resource] ] : 12th International Symposium, AAECC-12, Toulouse, France, June, 23-27, 1997, Proceedings / / edited by Teo Mora, Harold F. Mattson |
| Edizione | [1st ed. 1997.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1997 |
| Descrizione fisica | 1 online resource (X, 362 p.) |
| Disciplina | 005.7/2 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Computers
Algebra Applied mathematics Engineering mathematics Coding theory Information theory Computer science—Mathematics Numerical analysis Theory of Computation Applications of Mathematics Coding and Information Theory Symbolic and Algebraic Manipulation Numeric Computing |
| ISBN | 3-540-69193-6 |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Minimun distance decoding algorithms for linear codes -- Efficient multivariate factorization over finite fields -- On maximal codes in polynomial metric spaces -- Yet another ideal decomposition algorithm -- A resultant theory for ordinary algebraic differential equations -- The symmetry group of ? q n in the Lee space and the ? q n-linear codes -- On repeated-root cyclic codes and the two-way chain condition -- Exponentiation in finite fields: Theory and practice -- Computing minimum-link path in a homotopy class amidst semi-algebraic obstacles in the plane -- Certain self-dual codes over ?4 and the odd Leech lattice -- Order functions and evaluation codes -- Codes from cocycles -- A brief tour of split linear programming -- Elementary approximation of exponentials of Lie polynomials -- On the q-ary image of cyclic codes -- The split weight (w L , w R ) enumeration of Reed-Muller codes for w L +w R d min -- Optimal linear codes of dimension 4 over GF(5) -- Characterisations of lexicographic sets and simply-connected Hilbert schemes -- An iterative probabilistic decoding algorithm for binary linear block codes beyond the half minimum distance -- Security examination of a cellular automata based pseudorandom bit generator using an algebraic replica approach -- Formal duality of linearly presentable codes over a Galois field -- Trace-function on a Galois ring in coding theory -- A vector version of the BMS algorithm for implementing fast erasure-and-error decoding of one-point AG codes -- On generalized Hamming weights of codes constructed on affine algebraic sets -- Some results on regular mappings -- Extension theorems for linear codes over finite rings -- Nonperiodic cyclic equivalence classes of cyclic codes and algebraic constructions of cyclically permutable codes. |
| Record Nr. | UNISA-996465391903316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1997 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Applied Algebra, Algebraic Algorithms and Error-Correcting Codes [[electronic resource] ] : 12th International Symposium, AAECC-12, Toulouse, France, June, 23-27, 1997, Proceedings / / edited by Teo Mora, Harold F. Mattson
| Applied Algebra, Algebraic Algorithms and Error-Correcting Codes [[electronic resource] ] : 12th International Symposium, AAECC-12, Toulouse, France, June, 23-27, 1997, Proceedings / / edited by Teo Mora, Harold F. Mattson |
| Edizione | [1st ed. 1997.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1997 |
| Descrizione fisica | 1 online resource (X, 362 p.) |
| Disciplina | 005.7/2 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Computers
Algebra Applied mathematics Engineering mathematics Coding theory Information theory Computer science—Mathematics Numerical analysis Theory of Computation Applications of Mathematics Coding and Information Theory Symbolic and Algebraic Manipulation Numeric Computing |
| ISBN | 3-540-69193-6 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Minimun distance decoding algorithms for linear codes -- Efficient multivariate factorization over finite fields -- On maximal codes in polynomial metric spaces -- Yet another ideal decomposition algorithm -- A resultant theory for ordinary algebraic differential equations -- The symmetry group of ? q n in the Lee space and the ? q n-linear codes -- On repeated-root cyclic codes and the two-way chain condition -- Exponentiation in finite fields: Theory and practice -- Computing minimum-link path in a homotopy class amidst semi-algebraic obstacles in the plane -- Certain self-dual codes over ?4 and the odd Leech lattice -- Order functions and evaluation codes -- Codes from cocycles -- A brief tour of split linear programming -- Elementary approximation of exponentials of Lie polynomials -- On the q-ary image of cyclic codes -- The split weight (w L , w R ) enumeration of Reed-Muller codes for w L +w R d min -- Optimal linear codes of dimension 4 over GF(5) -- Characterisations of lexicographic sets and simply-connected Hilbert schemes -- An iterative probabilistic decoding algorithm for binary linear block codes beyond the half minimum distance -- Security examination of a cellular automata based pseudorandom bit generator using an algebraic replica approach -- Formal duality of linearly presentable codes over a Galois field -- Trace-function on a Galois ring in coding theory -- A vector version of the BMS algorithm for implementing fast erasure-and-error decoding of one-point AG codes -- On generalized Hamming weights of codes constructed on affine algebraic sets -- Some results on regular mappings -- Extension theorems for linear codes over finite rings -- Nonperiodic cyclic equivalence classes of cyclic codes and algebraic constructions of cyclically permutable codes. |
| Record Nr. | UNINA-9910768478003321 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1997 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
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 | ||
| ||
Applied Algebra, Algebraic Algorithms and Error-Correcting Codes [[electronic resource] ] : 9th International Symposium, AAECC-9, New Orleans, LA, USA, October 7-11, 1991. Proceedings / / edited by Harold F. Mattson, Teo Mora, T.R.N. Rao
| Applied Algebra, Algebraic Algorithms and Error-Correcting Codes [[electronic resource] ] : 9th International Symposium, AAECC-9, New Orleans, LA, USA, October 7-11, 1991. Proceedings / / edited by Harold F. Mattson, Teo Mora, T.R.N. Rao |
| Edizione | [1st ed. 1991.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1991 |
| Descrizione fisica | 1 online resource (XII, 496 p.) |
| Disciplina | 005.7/2 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Discrete mathematics
Algebra Computers Coding theory Information theory Computer science—Mathematics Combinatorics Discrete Mathematics Theory of Computation Coding and Information Theory Symbolic and Algebraic Manipulation |
| ISBN | 3-540-38436-7 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Algorithms for the shape of semialgebraic sets a new approach -- On the parameters of algebraic geometric codes -- On wiedemann's method of solving sparse linear systems -- Fast algorithms for decoding orthogonal and related codes -- Jacobian matrices and constructions in algebra -- Homogenity, pseudo-homogenity, and Gröbner basis computations -- Arithmetic on non supersingular elliptic curves -- Implementing some algorithms of kantor -- Computing roadmaps of general semi-algebraic sets -- An improved sign determination algorithm -- The 2-nd generalized Hamming weight of double-error correcting binary BCH codes and their dual codes -- Buchberger algorithm and integer programming -- New systolic architectures for cyclic code encoding -- Algebraic constructions of efficient broadcast networks -- Error-correction for WIMs and WUMs -- Some constructions in rings of differential polynomials -- Concurrent error detection in sequential circuits using convolutional codes -- An algorithm for the computation of the radical of an ideal in the ring of polynomials -- Integer multiplication in PARSAC-2 on stock microprocessors -- Polynomial-time construction of spherical codes -- Algorithms for a multiple algebraic extension II -- On the orphans and covering radius of the reed-muller codes -- A joint authentication and encryption scheme based on algebraic coding theory -- Arithmetic codes - Survey, recent and new results -- Some results on linear unequal-error-protection codes specified by their generator matrix -- An ackermannian polynomial ideal -- Complexity of the computation of the canonical Whitney stratification of an algebraic set in Cn -- Some undecidability results for weakly confluent monadic string-rewriting systems -- Calculating multidimensional symmetric functions using Jacobi's formula -- Multivariate Sturm theory -- Binary spherical geometric codes -- An algebraic construction of generalized Beenker's codes -- Improving the time complexity of the computation of irreducible and primitive polynomials in finite fields -- Completely transitive codes and distance transitive graphs -- Placement of curved polygons -- On the weights of the elements of the duals of binary BCH codes -- Computation of the openness of some loci of modules -- Random and byte error correcting codes for asymmetric or unidirectional error control -- Finding a minimal polynomial vector set of a vector of nD arrays -- Covering codes and combinatorial optimization -- Decoding of quadrature partial response- trellis coded signals (QPR-TCM) in the presence of intersymbol interference and noise -- On algebraic solutions of linear differential equations with primitive unimodular Galois group -- Error detection and correction in numerical computations -- d-Functions in V k (F 2) and self-decimation of m-sequences -- Multilevel modulation codes for rayleigh fading channels. |
| Record Nr. | UNISA-996465670303316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1991 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Applied Algebra, Algebraic Algorithms and Error-Correcting Codes [[electronic resource] ] : 6th International Conference, AAECC-6, Rome, Italy, July 4-8, 1988. Proceedings / / edited by Teo Mora
| Applied Algebra, Algebraic Algorithms and Error-Correcting Codes [[electronic resource] ] : 6th International Conference, AAECC-6, Rome, Italy, July 4-8, 1988. Proceedings / / edited by Teo Mora |
| Edizione | [1st ed. 1989.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1989 |
| Descrizione fisica | 1 online resource (XII, 488 p.) |
| Disciplina | 512 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Algebra
Applied mathematics Engineering mathematics Coding theory Information theory Computer science—Mathematics Applications of Mathematics Coding and Information Theory Symbolic and Algebraic Manipulation |
| ISBN | 3-540-46152-3 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | The coding theory of finite geometries and designs -- Recent results on covering problems -- Codes and curves -- Computer and commutative algebra -- The multiplicative complexity of boolean functions -- An algorithm on quasi-ordinary polynomials -- A computer-aided design for sampling a nonlinear analytic system -- Decoding of generalized concatenated codes -- Backtrack searching in the presence of symmetry -- Fast serial-parallel multipliers -- On the complexity of computing class groups of algebraic number fields -- Some new effectivity bounds in computational geometry -- Some remarks on the differential dimension -- On the asymptotic badness of cyclic codes with block-lengths composed from a fixed set of prime factors -- Big numbers p-adic arithmetic: A parallel approach -- Monomial ideals, group algebras and error correcting codes -- Fast integer multiplication by block recursive, number theoretical transforms -- Lambda-Upsilon-Omega: An assistant algorithms analyzer -- Global dimension of associative algebras -- Symmetry and duality in normal basis multiplication -- Multiple error correction with Analog Codes -- On the complexity of satisfiability problems for algebraic structures (preliminary report) -- A computational proof of the Noether normalization lemma -- A graphics interface to REDUCE -- Vlsi designs for multiplication over finite fields GF(2m) -- A primality test using cyclotomic extensions -- The method of syndrome coding and its application for data compression and processing in high energy physics experiments -- Nonassociative degree five identities not implied by commutativity: A computer approach -- On completely regular propelinear codes -- N-dimensional Berlekamp-Massey algorithm for multiple arrays and construction of multivariate polynomials with preassigned zeros -- Covering radius: Improving on the sphere-covering bound -- On Goldman's algorithm for solving first-order multinomial autonomous systems -- A covering problem in the odd graphs -- On the computation of Hilbert-Samuel series and multiplicity -- Succinct representations of counting problems -- How to guess ?-th roots modulo n by reducing lattice bases -- A study on Imai-Hirakawa trellis-coded modulation schemes -- Embedding flexible control strategies into object oriented languages -- Majority decoding of large repetition codes for the r-ary symmetric channel -- On binary codes of order 3 -- Polynomial decomposition algorithm of almost quadratic complexity -- The weights of the orthogonals of certain cyclic codes or extended GOPPA codes. |
| Record Nr. | UNISA-996465942803316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1989 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||