Applied Algebra, Algebraic Algorithms and Error-Correcting Codes [[electronic resource] ] : 16th International Symposium, AAECC-16, Las Vegas, NV, USA, February 20-24, 2006, Proceedings / / edited by Marc Fossorier, Hideki Imai, Shu Lin, Alain Poli |
Edizione | [1st ed. 2006.] |
Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2006 |
Descrizione fisica | 1 online resource (XII, 344 p.) |
Disciplina | 005.72 |
Collana | Theoretical Computer Science and General Issues |
Soggetto topico |
Coding theory
Information theory Cryptography Data encryption (Computer science) Computer science—Mathematics Discrete mathematics Algorithms Coding and Information Theory Cryptology Discrete Mathematics in Computer Science Symbolic and Algebraic Manipulation |
ISBN | 3-540-31424-5 |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | On Bent and Highly Nonlinear Balanced/Resilient Functions and Their Algebraic Immunities -- On Generalized Parity Checks -- Cryptography Based on Bilinear Maps -- The Merit Factor Problem for Binary Sequences -- Quantum Period Reconstruction of Binary Sequences -- The Vector Key Equation and Multisequence Shift Register Synthesis -- A General Framework for Applying FGLM Techniques to Linear Codes -- A Theory of Highly Nonlinear Functions -- The Solutions of the Third Power Sum Equation for Niho Type Decimations -- On Constructing AG Codes Without Basis Functions for Riemann-Roch Spaces -- Computing Gröbner Bases for Vanishing Ideals of Finite Sets of Points -- A Class of Fermat Curves for which Weil-Serre’s Bound Can Be Improved -- Nonbinary Quantum Codes from Hermitian Curves -- A Genetic Algorithm for Cocyclic Hadamard Matrices -- Unconditionally Secure Chaffing-and-Winnowing: A Relationship Between Encryption and Authentication -- A Fast Calculus for the Linearizing Attack and Its Application to an Attack on KASUMI -- On Achieving Chosen Ciphertext Security with Decryption Errors -- Applying Fujisaki-Okamoto to Identity-Based Encryption -- A Short Random Fingerprinting Code Against a Small Number of Pirates -- A General Formulation of Algebraic and Fast Correlation Attacks Based on Dedicated Sample Decimation -- Traitor Tracing Against Powerful Attacks Using Combinatorial Designs -- New Bounds on the Capacity of Multi-dimensional RLL-Constrained Systems -- LDPC Codes for Fading Channels: Two Strategies -- Low-Floor Tanner Codes Via Hamming-Node or RSCC-Node Doping -- Algebraic Constructions of Quasi-cyclic LDPC Codes – Part I: For AWGN and Binary Random Erasure Channels -- Algebraic Construction of Quasi-cyclic LDPC Codes – Part II: For AWGN and Binary Random and Burst Erasure Channels -- New Constructions of Quasi-cyclic LDPC Codes Based on Two Classes of Balanced Incomplete Block Designs: For AWGN and Binary Erasure Channels -- Long Extended BCH Codes Are Spanned by Minimum Weight Words -- On the Feng-Rao Bound for Generalized Hamming Weights -- Nested Codes for Constrained Memory and for Dirty Paper -- Complementary Sets and Reed-Muller Codes for Peak-to-Average Power Ratio Reduction in OFDM -- Hadamard Codes of Length 2 t s (s Odd). Rank and Kernel. |
Record Nr. | UNISA-996466118503316 |
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2006 | ||
Materiale a stampa | ||
Lo trovi qui: Univ. di Salerno | ||
|
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 : 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] ] : 5th International Conference, AAECC-5, Menorca, Spain, June 15-19, 1987. Proceedings / / edited by Llorenc Huguet, Alain Poli |
Edizione | [1st ed. 1989.] |
Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1989 |
Descrizione fisica | 1 online resource (VIII, 420 p.) |
Disciplina | 005.74 |
Collana | Lecture Notes in Computer Science |
Soggetto topico |
Data structures (Computer science)
Coding theory Information theory Computer science—Mathematics Data Structures and Information Theory Coding and Information Theory Symbolic and Algebraic Manipulation |
ISBN | 3-540-46150-7 |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Non simple tournaments : Theoretical properties and a polynomial algorithm -- Covering radius for codes obtained from T(m) triangular graphs -- Searching for weakly autocorrelated binary sequences -- On the prefixes of a random trace and the membership problem for context-free trace languages -- On decoding binary quadratic residue codes -- Pseudometrics associated with fuzzy relations having weak properties -- Towards an expert system for error correcting codes: SECC -- An Iterative Euclidean Algorithm -- Gröbner bases and differential algebra -- A procedure to prove geometrical statements -- Some applications of a classification of affine-invariant codes -- On the computation of the local and global analytic branches of a real algebraic curve -- Distribution of codewords and decoding error rate in rs codes with application to performance evaluation from optical disc -- On generalized minimum distance decoding -- Newton symmetric functions and the arithmetic of algebraically closed fields -- Non linear covering codes : A few results and conjectures -- Grobner bases, Ritt's algorithm and decision procedures for algebraic theories -- An algebraic model for the storage of data in parallel memories -- Algebrric solution of systems of polynomirl equations using Groebher bases -- How to decide whether a polynomial ideal is primary or not -- On the computational complexity of polynomials and bilinear mappings. A survey -- Coding theory and its applications in Japan -- Binary sequences with good correlation properties -- Hankel matrices and polynomials -- On the (d,D,D,s)-digraph problem -- It is decidable in polynomial time whether a monoid presented by a finite weight-reducing and confluent thue system is torsion-free -- A shift-remainder GCD algorithm -- New class of cyclic, random and burst error correcting codes -- A conjecture on the free distance of (2,1,m) binary convolutional codes -- On the construction of completely regular linear codes from distance — Regular graphs -- Synthesis of two-dimensional linear feedback shift registers and Groebner bases -- Constructing universal Gröbner bases. |
Record Nr. | UNISA-996465636903316 |
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1989 | ||
Materiale a stampa | ||
Lo trovi qui: Univ. di Salerno | ||
|
Applied Algebra, Algorithmics and Error-Correcting Codes [[electronic resource] ] : 2nd International Conference, AAECC-2, Toulouse, France, October 1-5, 1984. Proceedings / / edited by Alain Poli |
Edizione | [1st ed. 1986.] |
Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1986 |
Descrizione fisica | 1 online resource (VIII, 268 p.) |
Disciplina | 004.0151 |
Collana | Lecture Notes in Computer Science |
Soggetto topico |
Computers
Algorithms Coding theory Information theory Theory of Computation Algorithm Analysis and Problem Complexity Coding and Information Theory |
ISBN | 3-540-38813-3 |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | On associative algebras of minimal rank -- Construction of primitive idempotents for a variable codes -- Multivariate polynomials in coding theory -- Enumeration of self dual 2k circulant codes -- Codes, groups and invariants -- On a conjecture concerning coverings of Hamming space -- An improved upper bound on covering radius -- Association schemes and difference sets defined on two weight codes -- Automorphisms of two families of extended non binary cyclic Goppa Codes -- Some quasi-perfect cyclic codes -- Explicit Kerdock codes over GF(2) -- Une classe de codes 2-correcteurs adaptes aux systems d'information formates -- LOUSTICC simulation software : Experimental results of coding systems -- An algorithm of complete decoding of double-error-correcting goppa codes -- On the number of divisors of a polynomial over GF(2) -- Multivariate polynomial factoring and detection of true factors -- Discriminants and the irreducibility of a class of polynomials -- Computational aspects of reduction strategies to construct resolutions of monomial ideals -- Designs arising from symplectic geometry -- Distance — transitive graphs and the problem of maximal subgroups of symmetric groups -- Can a fast signature scheme without secret key be secure / Un Schema de Signature Courte et Rapide N'Utilisant pas de CLE Secrete Peut-IL Etre Fiable? -- Manipulation of recurrence relations in computer algebra -- Some design principles for a mathematical knowledge representation system: A new approach to scientific calculation. |
Record Nr. | UNISA-996465709303316 |
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1986 | ||
Materiale a stampa | ||
Lo trovi qui: Univ. di Salerno | ||
|
Finite Fields and Applications [[electronic resource] ] : 7th International Conference, Fq7, Toulouse, France, May 5-9, 2003, Revised Papers / / edited by Gary L. Mullen, Alain Poli, Henning Stichtenoth |
Edizione | [1st ed. 2004.] |
Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2004 |
Descrizione fisica | 1 online resource (VIII, 263 p.) |
Disciplina | 512.3 |
Collana | Lecture Notes in Computer Science |
Soggetto topico |
Algebra
Numerical analysis Coding theory Information theory Algorithms Computer science—Mathematics Field theory (Physics) Numeric Computing Coding and Information Theory Algorithm Analysis and Problem Complexity Symbolic and Algebraic Manipulation Field Theory and Polynomials |
ISBN |
1-280-30720-X
9786610307203 3-540-24633-9 |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | On the Autocorrelation of Cyclotomic Generators -- The Weierstrass Semigroup of an m-tuple of Collinear Points on a Hermitian Curve -- On Cyclic Top-Associative Generalized Galois Rings -- Linear Recurrences with Polynomial Coefficients and Computation of the Cartier-Manin Operator on Hyperelliptic Curves -- Mutual Irreducibility of Certain Polynomials -- Lattice Profile and Linear Complexity Profile of Pseudorandom Number Sequences -- Symplectic Spreads and Permutation Polynomials -- What Do Random Polynomials over Finite Fields Look Like? -- Combinatorics of the Two-Variable Zeta Function -- Constructions of Mutually Unbiased Bases -- A Construction of Matrices with No Singular Square Submatrices -- Everywhere Ramified Towers of Global Function Fields -- On the Construction of Some Towers over Finite Fields -- The Covering Radius of Some Primitive Ternary BCH Codes -- The Gray Map on GR(p 2, n) and Repeated-Root Cyclic Codes -- Primitive Polynomials over Small Fields -- Vectorial Functions and Covering Sequences -- u q -Sharp Subsets of a Finite Field -- Cyclic Decomposition of Permutations of Finite Fields Obtained Using Monomials. |
Record Nr. | UNISA-996465547203316 |
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2004 | ||
Materiale a stampa | ||
Lo trovi qui: Univ. di Salerno | ||
|
Finite Fields and Applications : 7th International Conference, Fq7, Toulouse, France, May 5-9, 2003, Revised Papers / / edited by Gary L. Mullen, Alain Poli, Henning Stichtenoth |
Edizione | [1st ed. 2004.] |
Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2004 |
Descrizione fisica | 1 online resource (VIII, 263 p.) |
Disciplina | 512.3 |
Collana | Lecture Notes in Computer Science |
Soggetto topico |
Algebra
Numerical analysis Coding theory Information theory Algorithms Computer science—Mathematics Field theory (Physics) Numeric Computing Coding and Information Theory Algorithm Analysis and Problem Complexity Symbolic and Algebraic Manipulation Field Theory and Polynomials |
ISBN |
1-280-30720-X
9786610307203 3-540-24633-9 |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | On the Autocorrelation of Cyclotomic Generators -- The Weierstrass Semigroup of an m-tuple of Collinear Points on a Hermitian Curve -- On Cyclic Top-Associative Generalized Galois Rings -- Linear Recurrences with Polynomial Coefficients and Computation of the Cartier-Manin Operator on Hyperelliptic Curves -- Mutual Irreducibility of Certain Polynomials -- Lattice Profile and Linear Complexity Profile of Pseudorandom Number Sequences -- Symplectic Spreads and Permutation Polynomials -- What Do Random Polynomials over Finite Fields Look Like? -- Combinatorics of the Two-Variable Zeta Function -- Constructions of Mutually Unbiased Bases -- A Construction of Matrices with No Singular Square Submatrices -- Everywhere Ramified Towers of Global Function Fields -- On the Construction of Some Towers over Finite Fields -- The Covering Radius of Some Primitive Ternary BCH Codes -- The Gray Map on GR(p 2, n) and Repeated-Root Cyclic Codes -- Primitive Polynomials over Small Fields -- Vectorial Functions and Covering Sequences -- u q -Sharp Subsets of a Finite Field -- Cyclic Decomposition of Permutations of Finite Fields Obtained Using Monomials. |
Record Nr. | UNINA-9910144205503321 |
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2004 | ||
Materiale a stampa | ||
Lo trovi qui: Univ. Federico II | ||
|