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] ] : 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 : 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 : 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 | ||
| ||
Character sums with exponential functions and their applications / / Sergei V. Konyagin, Igor E. Shparlinski
| Character sums with exponential functions and their applications / / Sergei V. Konyagin, Igor E. Shparlinski |
| Autore | Koniagin S. V (Sergei Vladimirovich) |
| Edizione | [1st ed.] |
| Pubbl/distr/stampa | Cambridge ; ; New York, : Cambridge University Press, 1999 |
| Descrizione fisica | 1 online resource (viii, 163 pages) : digital, PDF file(s) |
| Disciplina | 512/.73 |
| Altri autori (Persone) | ShparlinskiIgor E |
| Collana | Cambridge tracts in mathematics |
| Soggetto topico | Exponential sums |
| ISBN |
1-107-12817-X
1-280-43245-4 9786610432455 0-511-17763-1 0-511-04036-9 0-511-14804-6 0-511-33017-0 0-511-54293-3 0-511-05179-4 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | pt. 1. Preliminaries -- 1. Introduction -- 2. Notation and Auxiliary Results -- pt. 2. Bounds of Character Sums -- 3. Bounds of Long Character Sums -- 4. Bounds of Short Character Sums -- 5. Bounds of Character Sums for Almost All Moduli -- 6. Bounds of Gaussian Sums -- pt. 3. Multiplicative Translations of Sets -- 7. Multiplicative Translations of Subgroups of F*[subscript p] -- 8. Multiplicative Translations of Arbitrary Sets Modulo p -- pt. 4. Applications to Algebraic Number Fields -- 9. Representatives of Residue Classes -- 10. Cyclotomic Fields and Gaussian Periods -- pt. 5. Applications to Pseudo-Random Number Generators -- 11. Prediction of Pseudo-Random Number Generators -- 12. Congruential Pseudo-Random Number Generators -- pt. 6. Applications to Finite Fields -- 13. Small mth Roots Modulo p -- 14. Supersingular Hyperelliptic Curves -- 15. Distribution of Powers of Primitive Roots -- pt. 7. Applications to Coding Theory and Combinatorics -- 16. Difference Sets in V[subscript p] -- 17. Dimension of BCH Codes -- 18. An Enumeration Problem in Finite Fields. |
| Record Nr. | UNINA-9910812797303321 |
Koniagin S. V (Sergei Vladimirovich)
|
||
| Cambridge ; ; New York, : Cambridge University Press, 1999 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||