top

  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.

  Info

  • Utilizzare questo link per rimuovere la selezione effettuata.

Biblioteca

MARC Lista (tabellare)
ACM communications in computer algebra
ACM communications in computer algebra
Pubbl/distr/stampa New York, : Association for Computing Machinery
Disciplina 005
Soggetto topico Algebra - Data processing
Mathematics
Soggetto genere / forma Periodicals.
Soggetto non controllato Algebra
ISSN 1932-2240
Formato Materiale a stampa
Livello bibliografico Periodico
Lingua di pubblicazione eng
Altri titoli varianti Association for Computing Machinery communications in computer algebra
Communications in computer algebra
SIGSAM communications in computer algebra
Record Nr. UNINA-9910376056403321
New York, : Association for Computing Machinery
Materiale a stampa
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui
ACM communications in computer algebra
ACM communications in computer algebra
Pubbl/distr/stampa New York, : Association for Computing Machinery
Disciplina 005
Soggetto topico Algebra - Data processing
Mathematics
Soggetto genere / forma Periodicals.
Soggetto non controllato Algebra
ISSN 1932-2240
Formato Materiale a stampa
Livello bibliografico Periodico
Lingua di pubblicazione eng
Altri titoli varianti Association for Computing Machinery communications in computer algebra
Communications in computer algebra
SIGSAM communications in computer algebra
Record Nr. UNISA-996218820603316
New York, : Association for Computing Machinery
Materiale a stampa
Lo trovi qui: Univ. di Salerno
Opac: Controlla la disponibilità qui
ACM SIGSAM bulletin
ACM SIGSAM bulletin
Pubbl/distr/stampa [New York?], : ACM SIGSAM
Disciplina 512.02
Soggetto topico Algebra - Data processing
Algèbre
Calcul formel
Informatique
Soggetto genere / forma Ressource Internet (Descripteur de forme)
Périodique électronique (Descripteur de forme)
ISSN 1557-9492
Formato Materiale a stampa
Livello bibliografico Periodico
Lingua di pubblicazione eng
Record Nr. UNINA-9910375865803321
[New York?], : ACM SIGSAM
Materiale a stampa
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui
Advances in combinatorial mathematics [e-book] : Proceedings of the Waterloo Workshop in Computer Algebra 2008 / edited by Ilias S. Kotsireas, Eugene V. Zima
Advances in combinatorial mathematics [e-book] : Proceedings of the Waterloo Workshop in Computer Algebra 2008 / edited by Ilias S. Kotsireas, Eugene V. Zima
Pubbl/distr/stampa Berlin : Springer, 2009
Descrizione fisica v.: digital
Altri autori (Persone) Kotsireas, Ilias S.
Zima, Eugene V.
Soggetto topico Mathematics
Algebra - Data processing
Algebra
Combinatorics
ISBN 9783642035623
Formato Software
Livello bibliografico Monografia
Lingua di pubblicazione eng
Record Nr. UNISALENTO-991001284059707536
Berlin : Springer, 2009
Software
Lo trovi qui: Univ. del Salento
Opac: Controlla la disponibilità qui
Algebraic informatics : 9th International Conference, CAI 2022, virtual event, October 27-29, 2022, proceedings / / edited by Dimitrios Poulakis, George Rahonis
Algebraic informatics : 9th International Conference, CAI 2022, virtual event, October 27-29, 2022, proceedings / / edited by Dimitrios Poulakis, George Rahonis
Pubbl/distr/stampa Cham, Switzerland : , : Springer, , [2022]
Descrizione fisica 1 online resource (233 pages)
Disciplina 069
Collana Lecture Notes in Computer Science
Soggetto topico Algebra - Data processing
ISBN 3-031-19685-6
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Intro -- Preface -- Organization -- Abstracts of Invited Talks -- Weighted Automata Over Monotonic Strong Bimonoids: Decidability and Undecidability of Finite Image -- Constraints, Graphs, Algebra, Logic, and Complexity -- Contents -- Invited Papers -- Chaining Multiplications in Finite Fields with Chudnovsky-Type Algorithms and Tensor Rank of the k-Multiplication -- 1 Introduction -- 1.1 Context, Notation and Basic Results -- 1.2 New Results and Organisation -- 2 Theoretical Construction of a Multiplying Algorithm -- 2.1 Notations -- 2.2 Algorithm -- 3 On the Existence of These Algorithms -- 3.1 Strategy of Construction -- 3.2 Towers of Algebraic Function Fields -- 4 Uniform Upper Bounds -- References -- On Some Algebraic Ways to Calculate Zeros of the Riemann Zeta Function -- 1 The Riemann Hypothesis -- 2 The Riemann Hypothesis in the Arithmetical Hierarchy -- 3 Calculation of the Zeta Zeros by Solving Algebraic Equations -- 4 Calculation of Summands from Dirichlet Series for the Zeta Function at Its Zeros -- References -- Shuffle Product of Regular Languages: Results and Open Problems -- 1 Introduction -- 2 Shuffle and Recognition -- 2.1 Shuffle Product -- 2.2 Monoids and Ordered Monoids -- 2.3 Power Monoids and Lower Set Monoids -- 3 Classes of Languages Closed Under Shuffle -- 3.1 Varieties of Languages Closed Under Shuffle -- 3.2 Positive Varieties of Languages Closed Under Shuffle -- 3.3 Intermixed Languages -- 4 Sequential and Parallel Decompositions -- 4.1 Definitions and Examples -- 4.2 Closure Properties -- 4.3 Schnoebelen's Problem -- 5 Conclusion -- References -- Contributed Papers -- Ordering the Boolean Cube Vectors by Their Weights and with Minimal Change -- 1 Introduction -- 2 Basic Notions and Preliminary Results -- 3 Ordering the Vectors of the Boolean Cube by Their Weights and with Minimal Change.
4 Algorithm for Generating the Vectors of the Boolean Cube Ordered by Weights and with Minimal Change -- 5 Conclusions -- References -- Designated-Verifier Linkable Ring Signatures with Unconditional Anonymity -- 1 Introduction -- 2 Preliminaries -- 2.1 Notation -- 2.2 Security Assumptions -- 3 UDVLRS Definition and Security Model -- 3.1 UDVLRS Definition -- 3.2 Correctness -- 3.3 Adversarial Capabilities -- 3.4 Unforgeability -- 3.5 Anonymity -- 3.6 Non-transferability -- 3.7 Linkability -- 3.8 Non-slanderability -- 4 Our Construction -- 5 Security Analysis -- 6 Conclusion and Future Work -- References -- Finding Points on Elliptic Curves with Coppersmith's Method -- 1 Introduction -- 2 Preliminaries -- 2.1 Some ECC Cryptosystems -- 2.2 Lattice Basis Reduction and Coppersmith's Method -- 3 Small Solutions of the Elliptic Curve Equation -- 4 A Numerical Example -- 5 Conclusion -- References -- Weighted Propositional Configuration Logic over De Morgan Algebras -- 1 Introduction -- 2 Related Work -- 3 Preliminaries -- 4 Unweighted PCL -- 5 Weighted PCL over De Morgan Algebras -- 6 Examples -- 7 Discussion -- 8 Conclusion -- References -- Weighted Two-Way Transducers -- 1 Introduction -- 2 Preliminaries -- 3 Weighted Two-Way Transducers -- 4 Relation to Unweighted Case -- 5 Closure Properties -- References -- A Formal Algebraic Approach for the Quantitative Modeling of Connectors in Architectures -- 1 Introduction -- 2 Related Work -- 3 Preliminaries -- 4 The Weighted Algebra of Interactions -- 5 The Weighted Algebra of Connectors -- 6 On Congruence Relation for Fusion-wAC(P) Connectors -- 7 Discussion -- 8 Conclusion -- References -- Watson-Crick Powers of a Word -- 1 Introduction -- 2 Preliminaries -- 3 A Binary Operation Generating Watson-Crick Powers -- 4 Watson-Crick Conjugate Equations -- 5 Conjugacy and Commutativity with Respect to.
6 -Primitive Words, and a Word's -Primitive Root Pair -- 7 Conclusions -- References -- A Normal Form for Matrix Multiplication Schemes -- 1 Introduction -- 2 Matrix Multiplication Schemes -- 3 The Symmetry Group -- 4 Minimal Orbit Elements -- 5 Minimizing the First Row -- 6 Timings and Analysis -- References -- Bideterministic Weighted Automata -- 1 Introduction -- 2 Preliminaries -- 3 Bideterministic Weighted Automata over a Semiring -- 4 The Minimality Property of Bideterministic Automata -- 4.1 Fields and Integral Domains -- 4.2 Other Commutative Rings -- 4.3 Positive Semirings -- 5 Decidability of Bideterminisability -- 5.1 Fields -- 5.2 Tropical Semirings -- References -- How to Decide Functionality of Compositions of Top-Down Tree Transducers -- 1 Introduction -- 2 Top-Down Tree Transducers -- 3 Functionality of Two-Fold Compositions -- 3.1 Construction of the LA-Transducer M -- 3.2 Correctness of the LA-Transducer M -- 3.3 Functionality of Arbitrary Compositions -- 4 Conclusion -- References -- Computation of Solutions to Certain Nonlinear Systems of Fuzzy Relation Inequations -- 1 Introduction -- 2 Preliminaries -- 3 Certain Types of Fuzzy Relation Inequations and Their Solutions -- References -- When Variable-Length Codes Meet the Field of Error Detection -- 1 Introduction -- 2 Preliminaries -- 3 Error Detection and the Prefix Metric -- 4 Error Detection and the Factor Metric -- 5 Error Detection in the Topologies Associated to (anti-)automorphisms -- 6 Concluding Remark -- References -- Author Index.
Record Nr. UNISA-996495569703316
Cham, Switzerland : , : Springer, , [2022]
Materiale a stampa
Lo trovi qui: Univ. di Salerno
Opac: Controlla la disponibilità qui
Algebraic informatics : 9th International Conference, CAI 2022, virtual event, October 27-29, 2022, proceedings / / edited by Dimitrios Poulakis, George Rahonis
Algebraic informatics : 9th International Conference, CAI 2022, virtual event, October 27-29, 2022, proceedings / / edited by Dimitrios Poulakis, George Rahonis
Pubbl/distr/stampa Cham, Switzerland : , : Springer, , [2022]
Descrizione fisica 1 online resource (233 pages)
Disciplina 069
Collana Lecture Notes in Computer Science
Soggetto topico Algebra - Data processing
ISBN 3-031-19685-6
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Intro -- Preface -- Organization -- Abstracts of Invited Talks -- Weighted Automata Over Monotonic Strong Bimonoids: Decidability and Undecidability of Finite Image -- Constraints, Graphs, Algebra, Logic, and Complexity -- Contents -- Invited Papers -- Chaining Multiplications in Finite Fields with Chudnovsky-Type Algorithms and Tensor Rank of the k-Multiplication -- 1 Introduction -- 1.1 Context, Notation and Basic Results -- 1.2 New Results and Organisation -- 2 Theoretical Construction of a Multiplying Algorithm -- 2.1 Notations -- 2.2 Algorithm -- 3 On the Existence of These Algorithms -- 3.1 Strategy of Construction -- 3.2 Towers of Algebraic Function Fields -- 4 Uniform Upper Bounds -- References -- On Some Algebraic Ways to Calculate Zeros of the Riemann Zeta Function -- 1 The Riemann Hypothesis -- 2 The Riemann Hypothesis in the Arithmetical Hierarchy -- 3 Calculation of the Zeta Zeros by Solving Algebraic Equations -- 4 Calculation of Summands from Dirichlet Series for the Zeta Function at Its Zeros -- References -- Shuffle Product of Regular Languages: Results and Open Problems -- 1 Introduction -- 2 Shuffle and Recognition -- 2.1 Shuffle Product -- 2.2 Monoids and Ordered Monoids -- 2.3 Power Monoids and Lower Set Monoids -- 3 Classes of Languages Closed Under Shuffle -- 3.1 Varieties of Languages Closed Under Shuffle -- 3.2 Positive Varieties of Languages Closed Under Shuffle -- 3.3 Intermixed Languages -- 4 Sequential and Parallel Decompositions -- 4.1 Definitions and Examples -- 4.2 Closure Properties -- 4.3 Schnoebelen's Problem -- 5 Conclusion -- References -- Contributed Papers -- Ordering the Boolean Cube Vectors by Their Weights and with Minimal Change -- 1 Introduction -- 2 Basic Notions and Preliminary Results -- 3 Ordering the Vectors of the Boolean Cube by Their Weights and with Minimal Change.
4 Algorithm for Generating the Vectors of the Boolean Cube Ordered by Weights and with Minimal Change -- 5 Conclusions -- References -- Designated-Verifier Linkable Ring Signatures with Unconditional Anonymity -- 1 Introduction -- 2 Preliminaries -- 2.1 Notation -- 2.2 Security Assumptions -- 3 UDVLRS Definition and Security Model -- 3.1 UDVLRS Definition -- 3.2 Correctness -- 3.3 Adversarial Capabilities -- 3.4 Unforgeability -- 3.5 Anonymity -- 3.6 Non-transferability -- 3.7 Linkability -- 3.8 Non-slanderability -- 4 Our Construction -- 5 Security Analysis -- 6 Conclusion and Future Work -- References -- Finding Points on Elliptic Curves with Coppersmith's Method -- 1 Introduction -- 2 Preliminaries -- 2.1 Some ECC Cryptosystems -- 2.2 Lattice Basis Reduction and Coppersmith's Method -- 3 Small Solutions of the Elliptic Curve Equation -- 4 A Numerical Example -- 5 Conclusion -- References -- Weighted Propositional Configuration Logic over De Morgan Algebras -- 1 Introduction -- 2 Related Work -- 3 Preliminaries -- 4 Unweighted PCL -- 5 Weighted PCL over De Morgan Algebras -- 6 Examples -- 7 Discussion -- 8 Conclusion -- References -- Weighted Two-Way Transducers -- 1 Introduction -- 2 Preliminaries -- 3 Weighted Two-Way Transducers -- 4 Relation to Unweighted Case -- 5 Closure Properties -- References -- A Formal Algebraic Approach for the Quantitative Modeling of Connectors in Architectures -- 1 Introduction -- 2 Related Work -- 3 Preliminaries -- 4 The Weighted Algebra of Interactions -- 5 The Weighted Algebra of Connectors -- 6 On Congruence Relation for Fusion-wAC(P) Connectors -- 7 Discussion -- 8 Conclusion -- References -- Watson-Crick Powers of a Word -- 1 Introduction -- 2 Preliminaries -- 3 A Binary Operation Generating Watson-Crick Powers -- 4 Watson-Crick Conjugate Equations -- 5 Conjugacy and Commutativity with Respect to.
6 -Primitive Words, and a Word's -Primitive Root Pair -- 7 Conclusions -- References -- A Normal Form for Matrix Multiplication Schemes -- 1 Introduction -- 2 Matrix Multiplication Schemes -- 3 The Symmetry Group -- 4 Minimal Orbit Elements -- 5 Minimizing the First Row -- 6 Timings and Analysis -- References -- Bideterministic Weighted Automata -- 1 Introduction -- 2 Preliminaries -- 3 Bideterministic Weighted Automata over a Semiring -- 4 The Minimality Property of Bideterministic Automata -- 4.1 Fields and Integral Domains -- 4.2 Other Commutative Rings -- 4.3 Positive Semirings -- 5 Decidability of Bideterminisability -- 5.1 Fields -- 5.2 Tropical Semirings -- References -- How to Decide Functionality of Compositions of Top-Down Tree Transducers -- 1 Introduction -- 2 Top-Down Tree Transducers -- 3 Functionality of Two-Fold Compositions -- 3.1 Construction of the LA-Transducer M -- 3.2 Correctness of the LA-Transducer M -- 3.3 Functionality of Arbitrary Compositions -- 4 Conclusion -- References -- Computation of Solutions to Certain Nonlinear Systems of Fuzzy Relation Inequations -- 1 Introduction -- 2 Preliminaries -- 3 Certain Types of Fuzzy Relation Inequations and Their Solutions -- References -- When Variable-Length Codes Meet the Field of Error Detection -- 1 Introduction -- 2 Preliminaries -- 3 Error Detection and the Prefix Metric -- 4 Error Detection and the Factor Metric -- 5 Error Detection in the Topologies Associated to (anti-)automorphisms -- 6 Concluding Remark -- References -- Author Index.
Record Nr. UNINA-9910619279803321
Cham, Switzerland : , : Springer, , [2022]
Materiale a stampa
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui
Algorithms in invariant theory / / Bernd Sturmfels
Algorithms in invariant theory / / Bernd Sturmfels
Autore Sturmfels Bernd <1962->
Edizione [2nd ed.]
Pubbl/distr/stampa Wien : , : Springer-Verlag, , [1993]
Descrizione fisica 1 online resource (204 p.)
Disciplina 004
Collana Texts and Monographs in Symbolic Computation
Soggetto topico Computer science
Algebra - Data processing
Artificial intelligence
ISBN 3-211-77417-3
3-211-77416-5
3-7091-4368-3
9786611491277
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Invariant theory of finite groups -- Bracket algebra and projective geometry -- Invariants of the general linear group.
Record Nr. UNINA-9910777462803321
Sturmfels Bernd <1962->  
Wien : , : Springer-Verlag, , [1993]
Materiale a stampa
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui
Algorithms in invariant theory / / Bernd Sturmfels
Algorithms in invariant theory / / Bernd Sturmfels
Autore Sturmfels Bernd <1962->
Edizione [2nd ed.]
Pubbl/distr/stampa Wien : , : Springer-Verlag, , [1993]
Descrizione fisica 1 online resource (204 p.)
Disciplina 004
Collana Texts and Monographs in Symbolic Computation
Soggetto topico Computer science
Algebra - Data processing
Artificial intelligence
ISBN 3-211-77417-3
3-211-77416-5
3-7091-4368-3
9786611491277
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Invariant theory of finite groups -- Bracket algebra and projective geometry -- Invariants of the general linear group.
Record Nr. UNINA-9910824536603321
Sturmfels Bernd <1962->  
Wien : , : Springer-Verlag, , [1993]
Materiale a stampa
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui
Applied algebra, algebraic algorithms, and error-correcting codes : 13th international symposium, AAECC-13, Honolulu, Hawaii, USA, November 15-19, 1999 : proceedings / / Marc Fossorier [and three others], (editors)
Applied algebra, algebraic algorithms, and error-correcting codes : 13th international symposium, AAECC-13, Honolulu, Hawaii, USA, November 15-19, 1999 : proceedings / / Marc Fossorier [and three others], (editors)
Edizione [1st ed. 1999.]
Pubbl/distr/stampa Berlin : , : Springer, , [1999]
Descrizione fisica 1 online resource (XIV, 518 p.)
Disciplina 005.72
Collana Lecture notes in computer science
Soggetto topico Error-correcting codes (Information theory)
Algebra - Data processing
Algorithms
ISBN 3-540-46796-3
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Invited Papers -- Codes on Graphs: A Survey for Algebraists -- RA Codes Achieve AWGN Channel Capacity -- Monomial Ideals and Planar Graphs -- A Fast Program Generator of Fast Fourier Transforms -- On Integer Programming Problems Related to Soft-Decision Iterative Decoding Algorithms -- Curves with Many Points and Their Applications -- Codes and Iterative Decoding -- New Sequences of Linear Time Erasure Codes Approaching the Channel Capacity -- On the Theory of Low-Density Convolutional Codes -- Combinatorics I: Arithmetic -- On the Distribution of Nonlinear Recursive Congruential Pseudorandom Numbers of Higher Orders -- A New Representation of Boolean Functions -- Combinatorics II: Graphs and Matrices -- An Algorithm to Compute a Nearest Point in the Lattice A n * -- Sequences from Cocycles -- Block Codes I -- On the Second Greedy Weight for Binary Linear Codes -- On the Size of Identifying Codes -- Algebra I: Rings and Fields -- Fast Quantum Fourier Transforms for a Class of Non-abelian Groups -- Linear Codes and Rings of Matrices -- On ?4-Simplex Codes and Their Gray Images -- Decoding Methods -- Some Results on Generalized Concatenation of Block Codes -- Near Optimal Decoding for TCM Using the BIVA and Trellis Shaping -- An Optimality Testing Algorithm for a Decoded Codeword of Binary Block Codes and Its Computational Complexity -- Algebra II -- Recursive MDS-Codes and Pseudogeometries -- Strength of ISTY1 without FL Function for Higher Order Differential Attack -- Code Construction -- Quantum Reed—Solomon Codes -- Capacity Bounds for the 3-Dimensional (0, 1) Runlength Limited Channel -- Rectangular Codes and Rectangular Algebra -- Codes and Algebra I: Algebraic Curves -- Decoding Hermitian Codes with Sudan’s Algorithm -- Computing a Basis of on an affine algebraic curve with one rational place at infinit -- Cryptography -- Critical Noise for Convergence of Iterative Probabilistic Decoding with Belief Propagation in Cryptographic Applications -- An Authentication Scheme over Non-authentic Public Channel in Information-Theoretic Secret-Key Agreement -- Codes and Decoding -- A Systolic Array Architecture for Fast Decoding of One-Point AG Codes and Scheduling of Parallel Processing on It -- Convolutional Codes -- Computing Weight Distributions of Convolutional Codes Via Shift Register Synthesis -- Properties of Finite Response Input Sequences of Recursive Convolutional Codes -- Combinatorics III: Designs -- Lower Bounds for Group Covering Designs -- Characteristic Functions of Relative Difference Sets, Correlated Sequences and Hadamard Matrices -- Decoding of Block Codes -- Double Circulant Self-Dual Codes Using Finite-Field Wavelet Transforms -- Algebra III: Rings and Fields -- Linear Codes and Polylinear Recurrences over Finite Rings and Modules (A Survey) -- Calculating Generators for Invariant Fields of Linear Algebraic Groups -- Constructing Elements of Large Order in Finite Fields -- Modulation and Codes -- New Lower Bounds on the Periodic Crosscorrelation of QAM Codes with Arbitrary Energy -- Conjectures on the Size of Constellations Constructed from Direct Sums of PSK Kernels -- Codes and Algebra II: Gröbner Bases and AG Codes -- A New Criterion for Normal Form Algorithms -- Discrete Fourier Transform and Gröbner Bases -- Block Codes II -- On the State Complexities of Ternary Codes -- Binary Optimal Linear Rate 1/2 Codes -- On Binary/Ternary Error-Correcting Codes with Minimum Distance 4 -- Algebra IV: Polynomials -- The Euclidean Algorithm and Primitive Polynomials over Finite Fields -- On the Computational Hardness of Testing Square-Freeness of Sparse Polynomials -- Mastrovito Multiplier for General Irreducible Polynomials.
Record Nr. UNINA-9910143647503321
Berlin : , : Springer, , [1999]
Materiale a stampa
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui
Applied algebra, algebraic algorithms, and error-correcting codes : 13th international symposium, AAECC-13, Honolulu, Hawaii, USA, November 15-19, 1999 : proceedings / / Marc Fossorier [and three others], (editors)
Applied algebra, algebraic algorithms, and error-correcting codes : 13th international symposium, AAECC-13, Honolulu, Hawaii, USA, November 15-19, 1999 : proceedings / / Marc Fossorier [and three others], (editors)
Edizione [1st ed. 1999.]
Pubbl/distr/stampa Berlin : , : Springer, , [1999]
Descrizione fisica 1 online resource (XIV, 518 p.)
Disciplina 005.72
Collana Lecture notes in computer science
Soggetto topico Error-correcting codes (Information theory)
Algebra - Data processing
Algorithms
ISBN 3-540-46796-3
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Invited Papers -- Codes on Graphs: A Survey for Algebraists -- RA Codes Achieve AWGN Channel Capacity -- Monomial Ideals and Planar Graphs -- A Fast Program Generator of Fast Fourier Transforms -- On Integer Programming Problems Related to Soft-Decision Iterative Decoding Algorithms -- Curves with Many Points and Their Applications -- Codes and Iterative Decoding -- New Sequences of Linear Time Erasure Codes Approaching the Channel Capacity -- On the Theory of Low-Density Convolutional Codes -- Combinatorics I: Arithmetic -- On the Distribution of Nonlinear Recursive Congruential Pseudorandom Numbers of Higher Orders -- A New Representation of Boolean Functions -- Combinatorics II: Graphs and Matrices -- An Algorithm to Compute a Nearest Point in the Lattice A n * -- Sequences from Cocycles -- Block Codes I -- On the Second Greedy Weight for Binary Linear Codes -- On the Size of Identifying Codes -- Algebra I: Rings and Fields -- Fast Quantum Fourier Transforms for a Class of Non-abelian Groups -- Linear Codes and Rings of Matrices -- On ?4-Simplex Codes and Their Gray Images -- Decoding Methods -- Some Results on Generalized Concatenation of Block Codes -- Near Optimal Decoding for TCM Using the BIVA and Trellis Shaping -- An Optimality Testing Algorithm for a Decoded Codeword of Binary Block Codes and Its Computational Complexity -- Algebra II -- Recursive MDS-Codes and Pseudogeometries -- Strength of ISTY1 without FL Function for Higher Order Differential Attack -- Code Construction -- Quantum Reed—Solomon Codes -- Capacity Bounds for the 3-Dimensional (0, 1) Runlength Limited Channel -- Rectangular Codes and Rectangular Algebra -- Codes and Algebra I: Algebraic Curves -- Decoding Hermitian Codes with Sudan’s Algorithm -- Computing a Basis of on an affine algebraic curve with one rational place at infinit -- Cryptography -- Critical Noise for Convergence of Iterative Probabilistic Decoding with Belief Propagation in Cryptographic Applications -- An Authentication Scheme over Non-authentic Public Channel in Information-Theoretic Secret-Key Agreement -- Codes and Decoding -- A Systolic Array Architecture for Fast Decoding of One-Point AG Codes and Scheduling of Parallel Processing on It -- Convolutional Codes -- Computing Weight Distributions of Convolutional Codes Via Shift Register Synthesis -- Properties of Finite Response Input Sequences of Recursive Convolutional Codes -- Combinatorics III: Designs -- Lower Bounds for Group Covering Designs -- Characteristic Functions of Relative Difference Sets, Correlated Sequences and Hadamard Matrices -- Decoding of Block Codes -- Double Circulant Self-Dual Codes Using Finite-Field Wavelet Transforms -- Algebra III: Rings and Fields -- Linear Codes and Polylinear Recurrences over Finite Rings and Modules (A Survey) -- Calculating Generators for Invariant Fields of Linear Algebraic Groups -- Constructing Elements of Large Order in Finite Fields -- Modulation and Codes -- New Lower Bounds on the Periodic Crosscorrelation of QAM Codes with Arbitrary Energy -- Conjectures on the Size of Constellations Constructed from Direct Sums of PSK Kernels -- Codes and Algebra II: Gröbner Bases and AG Codes -- A New Criterion for Normal Form Algorithms -- Discrete Fourier Transform and Gröbner Bases -- Block Codes II -- On the State Complexities of Ternary Codes -- Binary Optimal Linear Rate 1/2 Codes -- On Binary/Ternary Error-Correcting Codes with Minimum Distance 4 -- Algebra IV: Polynomials -- The Euclidean Algorithm and Primitive Polynomials over Finite Fields -- On the Computational Hardness of Testing Square-Freeness of Sparse Polynomials -- Mastrovito Multiplier for General Irreducible Polynomials.
Record Nr. UNISA-996465671803316
Berlin : , : Springer, , [1999]
Materiale a stampa
Lo trovi qui: Univ. di Salerno
Opac: Controlla la disponibilità qui