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.
The accidental webmaster [[electronic resource] /] / Julie M. Still
| The accidental webmaster [[electronic resource] /] / Julie M. Still |
| Autore | Still Julie |
| Pubbl/distr/stampa | Medford, N.J., : Information Today, c2003 |
| Descrizione fisica | 1 online resource (209 p.) |
| Disciplina | 005.7/2 |
| Soggetto topico |
Web sites - Design
Webmasters |
| Soggetto genere / forma | Electronic books. |
| ISBN |
1-283-37913-9
9786613379139 1-57387-974-6 |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Record Nr. | UNINA-9910457807003321 |
Still Julie
|
||
| Medford, N.J., : Information Today, c2003 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
The accidental webmaster [[electronic resource] /] / Julie M. Still
| The accidental webmaster [[electronic resource] /] / Julie M. Still |
| Autore | Still Julie |
| Pubbl/distr/stampa | Medford, N.J., : Information Today, c2003 |
| Descrizione fisica | 1 online resource (209 p.) |
| Disciplina | 005.7/2 |
| Soggetto topico |
Web sites - Design
Webmasters |
| ISBN |
1-283-37913-9
9786613379139 1-57387-974-6 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Record Nr. | UNINA-9910779063403321 |
|
Still Julie
|
||
| Medford, N.J., : Information Today, c2003 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
The accidental webmaster [[electronic resource] /] / Julie M. Still
| The accidental webmaster [[electronic resource] /] / Julie M. Still |
| Autore | Still Julie |
| Pubbl/distr/stampa | Medford, N.J., : Information Today, c2003 |
| Descrizione fisica | 1 online resource (209 p.) |
| Disciplina | 005.7/2 |
| Soggetto topico |
Web sites - Design
Webmasters |
| ISBN |
1-283-37913-9
9786613379139 1-57387-974-6 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Record Nr. | UNINA-9910808295503321 |
|
Still Julie
|
||
| Medford, N.J., : Information Today, c2003 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Applied Algebra, Algebraic Algorithms and Error-Correcting Codes [[electronic resource] ] : 15th International Symposium, AAECC-15, Toulouse, France, May 12-16, 2003, Proceedings / / edited by Marc Fossorier, Tom Hoeholdt, Alain Poli
| Applied Algebra, Algebraic Algorithms and Error-Correcting Codes [[electronic resource] ] : 15th International Symposium, AAECC-15, Toulouse, France, May 12-16, 2003, Proceedings / / edited by Marc Fossorier, Tom Hoeholdt, Alain Poli |
| Edizione | [1st ed. 2003.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2003 |
| Descrizione fisica | 1 online resource (X, 270 p.) |
| Disciplina | 005.7/2 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Algebra
Coding theory Information theory Data encryption (Computer science) Algorithms Computer science—Mathematics Coding and Information Theory Cryptology Algorithm Analysis and Problem Complexity Discrete Mathematics in Computer Science Symbolic and Algebraic Manipulation |
| ISBN | 3-540-44828-4 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Cryptography and the Methodology of Provable Security -- Dynamical Systems Generated by Rational Functions -- Homotopy Methods for Equations over Finite Fields -- Three Constructions of Authentication/Secrecy Codes -- The Jacobi Model of an Elliptic Curve and Side-Channel Analysis -- Fast Point Multiplication on Elliptic Curves through Isogenies -- Interpolation of the Elliptic Curve Diffie-Hellman Mapping -- An Optimized Algebraic Method for Higher Order Differential Attack -- Fighting Two Pirates -- Copyright Control and Separating Systems -- Unconditionally Secure Homomorphic Pre-distributed Commitments -- A Class of Low-Density Parity-Check Codes Constructed Based on Reed-Solomon Codes with Two Information Symbols -- Relative Duality in MacWilliams Identity -- Good Expander Graphs and Expander Codes: Parameters and Decoding -- On the Covering Radius of Certain Cyclic Codes -- Unitary Error Bases: Constructions, Equivalence, and Applications -- Differentially 2-Uniform Cocycles — The Binary Case -- The Second and Third Generalized Hamming Weights of Algebraic Geometry Codes -- Error Correcting Codes over Algebraic Surfaces -- A Geometric View of Decoding AG Codes -- Performance Analysis of M-PSK Signal Constellations in Riemannian Varieties -- Improvements to Evaluation Codes and New Characterizations of Arf Semigroups -- Optimal 2-Dimensional 3-Dispersion Lattices -- On g-th MDS Codes and Matroids -- On the Minimum Distance of Some Families of ?2 k-Linear Codes -- Quasicyclic Codes of Index ? over F q Viewed as F q[x]-Submodules of F q ?[x]/?x m?1? -- Fast Decomposition of Polynomials with Known Galois Group. |
| Record Nr. | UNINA-9910144030303321 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2003 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Applied Algebra, Algebraic Algorithms and Error-Correcting Codes [[electronic resource] ] : 15th International Symposium, AAECC-15, Toulouse, France, May 12-16, 2003, Proceedings / / edited by Marc Fossorier, Tom Hoeholdt, Alain Poli
| Applied Algebra, Algebraic Algorithms and Error-Correcting Codes [[electronic resource] ] : 15th International Symposium, AAECC-15, Toulouse, France, May 12-16, 2003, Proceedings / / edited by Marc Fossorier, Tom Hoeholdt, Alain Poli |
| Edizione | [1st ed. 2003.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2003 |
| Descrizione fisica | 1 online resource (X, 270 p.) |
| Disciplina | 005.7/2 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Algebra
Coding theory Information theory Data encryption (Computer science) Algorithms Computer science—Mathematics Coding and Information Theory Cryptology Algorithm Analysis and Problem Complexity Discrete Mathematics in Computer Science Symbolic and Algebraic Manipulation |
| ISBN | 3-540-44828-4 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Cryptography and the Methodology of Provable Security -- Dynamical Systems Generated by Rational Functions -- Homotopy Methods for Equations over Finite Fields -- Three Constructions of Authentication/Secrecy Codes -- The Jacobi Model of an Elliptic Curve and Side-Channel Analysis -- Fast Point Multiplication on Elliptic Curves through Isogenies -- Interpolation of the Elliptic Curve Diffie-Hellman Mapping -- An Optimized Algebraic Method for Higher Order Differential Attack -- Fighting Two Pirates -- Copyright Control and Separating Systems -- Unconditionally Secure Homomorphic Pre-distributed Commitments -- A Class of Low-Density Parity-Check Codes Constructed Based on Reed-Solomon Codes with Two Information Symbols -- Relative Duality in MacWilliams Identity -- Good Expander Graphs and Expander Codes: Parameters and Decoding -- On the Covering Radius of Certain Cyclic Codes -- Unitary Error Bases: Constructions, Equivalence, and Applications -- Differentially 2-Uniform Cocycles — The Binary Case -- The Second and Third Generalized Hamming Weights of Algebraic Geometry Codes -- Error Correcting Codes over Algebraic Surfaces -- A Geometric View of Decoding AG Codes -- Performance Analysis of M-PSK Signal Constellations in Riemannian Varieties -- Improvements to Evaluation Codes and New Characterizations of Arf Semigroups -- Optimal 2-Dimensional 3-Dispersion Lattices -- On g-th MDS Codes and Matroids -- On the Minimum Distance of Some Families of ?2 k-Linear Codes -- Quasicyclic Codes of Index ? over F q Viewed as F q[x]-Submodules of F q ?[x]/?x m?1? -- Fast Decomposition of Polynomials with Known Galois Group. |
| Record Nr. | UNISA-996465965103316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2003 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Applied Algebra, Algebraic Algorithms and Error-Correcting Codes [[electronic resource] ] : 14th International Symposium, AAECC-14, Melbourne, Australia, November 26-30, 2001. Proceedings / / edited by Serdar Boztas, Igor E. Shparlinski
| Applied Algebra, Algebraic Algorithms and Error-Correcting Codes [[electronic resource] ] : 14th International Symposium, AAECC-14, Melbourne, Australia, November 26-30, 2001. Proceedings / / edited by Serdar Boztas, Igor E. Shparlinski |
| Edizione | [1st ed. 2001.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2001 |
| Descrizione fisica | 1 online resource (XII, 404 p.) |
| Disciplina | 005.7/2 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Algebra
Coding theory Information theory Computer science—Mathematics Data encryption (Computer science) Algorithms Computer mathematics Coding and Information Theory Symbolic and Algebraic Manipulation Cryptology Algorithm Analysis and Problem Complexity Computational Mathematics and Numerical Analysis |
| Soggetto genere / forma | Online resources. |
| ISBN | 3-540-45624-4 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Invited Contributions -- The Ubiquity of Reed-Muller Codes -- Self-dual Codes-Theme and Variations -- Design of Differential Space-Time Codes Using Group Theory -- Ideal Error-Correcting Codes: Unifying Algebraic and Number-Theoretic Algorithms -- Block Codes -- Self-dual Codes Using Image Restoration Techniques -- Low Complexity Tail-Biting Trellises of Self-dual codes of Length 24, 32 and 40 over GF(2) and Z4 of Large Minimum Distance -- F q -Linear Cyclic Codes over F q m: DFT Characterization -- Code Constructions -- Cyclic Projective Reed-Muller Codes -- Codes Identifying Sets of Vertices -- Duality and Greedy Weights of Linear Codes and Projective Multisets -- Codes and Algebra:Rings and Fields -- Type II Codes over IF2r -- On Senary Simplex Codes -- Optimal Double Circulant Z4-Codes -- Constructions of Codes from Number Fields -- On Generalized Hamming Weights for Codes over Finite Chain Rings -- Information Rates and Weights of Codes in Structural Matrix Rings -- Codes and Algebra:Algebraic Geometry Codes -- On Hyperbolic Codes -- On Fast Interpolation Method for Guruswami-Sudan List Decoding of One-Point Algebraic-Geometry Codes -- Computing the Genus of a Class of Curves -- Sequences -- Iterations of Multivariate Polynomials and Discrepancy of Pseudorandom Numbers -- Even Length Binary Sequence Families with Low Negaperiodic Autocorrelation -- On the Non-existence of (Almost-)Perfect Quaternary Sequences -- Maximal Periods of x2 + c in Fq -- On the Aperiodic Correlation Function of Galois Ring m-Sequences -- Euclidean Modules and Multisequence Synthesis -- Cryptography -- On Homogeneous Bent Functions -- Partially Identifying Codes for Copyright Protection -- On the Generalised Hidden Number Problem and Bit Security of XTR -- CRYPTIM: Graphs as Tools for Symmetric Encryption -- Algorithms -- An Algorithm for Computing Cocyclic Matrices Developed over Some Semidirect Products -- Algorithms for Large Integer Matrix Problems -- On the Identification of Vertices and Edges Using Cycles -- Algorithms:Decoding -- On Algebraic Soft Decision Decoding of Cyclic Binary Codes -- Lifting Decoding Schemes over a Galois Ring -- Sufficient Conditions on Most Likely Local Sub-codewords in Recursive Maximum Likelihood Decoding Algorithms -- A Unifying System-Theoretic Framework for Errors-and-Erasures Reed-Solomon Decoding -- An Algorithm for Computing Rejection Probability of MLD with Threshold Test over BSC -- Algebraic Constructions -- Cartan’s Characters and Stairs of Characteristic Sets -- On the Invariants of the Quotients of the Jacobian of a Curve of Genus 2 -- Algebraic Constructions for PSK Space-Time Coded Modulation. |
| Record Nr. | UNISA-996465911903316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2001 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Applied Algebra, Algebraic Algorithms and Error-Correcting Codes [[electronic resource] ] : 14th International Symposium, AAECC-14, Melbourne, Australia, November 26-30, 2001. Proceedings / / edited by Serdar Boztas, Igor E. Shparlinski
| Applied Algebra, Algebraic Algorithms and Error-Correcting Codes [[electronic resource] ] : 14th International Symposium, AAECC-14, Melbourne, Australia, November 26-30, 2001. Proceedings / / edited by Serdar Boztas, Igor E. Shparlinski |
| Edizione | [1st ed. 2001.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2001 |
| Descrizione fisica | 1 online resource (XII, 404 p.) |
| Disciplina | 005.7/2 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Algebra
Coding theory Information theory Computer science—Mathematics Data encryption (Computer science) Algorithms Computer mathematics Coding and Information Theory Symbolic and Algebraic Manipulation Cryptology Algorithm Analysis and Problem Complexity Computational Mathematics and Numerical Analysis |
| Soggetto genere / forma | Online resources. |
| ISBN | 3-540-45624-4 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Invited Contributions -- The Ubiquity of Reed-Muller Codes -- Self-dual Codes-Theme and Variations -- Design of Differential Space-Time Codes Using Group Theory -- Ideal Error-Correcting Codes: Unifying Algebraic and Number-Theoretic Algorithms -- Block Codes -- Self-dual Codes Using Image Restoration Techniques -- Low Complexity Tail-Biting Trellises of Self-dual codes of Length 24, 32 and 40 over GF(2) and Z4 of Large Minimum Distance -- F q -Linear Cyclic Codes over F q m: DFT Characterization -- Code Constructions -- Cyclic Projective Reed-Muller Codes -- Codes Identifying Sets of Vertices -- Duality and Greedy Weights of Linear Codes and Projective Multisets -- Codes and Algebra:Rings and Fields -- Type II Codes over IF2r -- On Senary Simplex Codes -- Optimal Double Circulant Z4-Codes -- Constructions of Codes from Number Fields -- On Generalized Hamming Weights for Codes over Finite Chain Rings -- Information Rates and Weights of Codes in Structural Matrix Rings -- Codes and Algebra:Algebraic Geometry Codes -- On Hyperbolic Codes -- On Fast Interpolation Method for Guruswami-Sudan List Decoding of One-Point Algebraic-Geometry Codes -- Computing the Genus of a Class of Curves -- Sequences -- Iterations of Multivariate Polynomials and Discrepancy of Pseudorandom Numbers -- Even Length Binary Sequence Families with Low Negaperiodic Autocorrelation -- On the Non-existence of (Almost-)Perfect Quaternary Sequences -- Maximal Periods of x2 + c in Fq -- On the Aperiodic Correlation Function of Galois Ring m-Sequences -- Euclidean Modules and Multisequence Synthesis -- Cryptography -- On Homogeneous Bent Functions -- Partially Identifying Codes for Copyright Protection -- On the Generalised Hidden Number Problem and Bit Security of XTR -- CRYPTIM: Graphs as Tools for Symmetric Encryption -- Algorithms -- An Algorithm for Computing Cocyclic Matrices Developed over Some Semidirect Products -- Algorithms for Large Integer Matrix Problems -- On the Identification of Vertices and Edges Using Cycles -- Algorithms:Decoding -- On Algebraic Soft Decision Decoding of Cyclic Binary Codes -- Lifting Decoding Schemes over a Galois Ring -- Sufficient Conditions on Most Likely Local Sub-codewords in Recursive Maximum Likelihood Decoding Algorithms -- A Unifying System-Theoretic Framework for Errors-and-Erasures Reed-Solomon Decoding -- An Algorithm for Computing Rejection Probability of MLD with Threshold Test over BSC -- Algebraic Constructions -- Cartan’s Characters and Stairs of Characteristic Sets -- On the Invariants of the Quotients of the Jacobian of a Curve of Genus 2 -- Algebraic Constructions for PSK Space-Time Coded Modulation. |
| Record Nr. | UNINA-9910768478203321 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2001 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
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 | ||
| ||
