Listing 1 - 10 of 11 | << page >> |
Sort by
|
Choose an application
This volume develops the depth and breadth of the mathematics underlying the construction and analysis of Hadamard matrices and their use in the construction of combinatorial designs. At the same time, it pursues current research in their numerous applications in security and cryptography, quantum information, and communications. Bridges among diverse mathematical threads and extensive applications make this an invaluable source for understanding both the current state of the art and future directions. The existence of Hadamard matrices remains one of the most challenging open questions in combinatorics. Substantial progress on their existence has resulted from advances in algebraic design theory using deep connections with linear algebra, abstract algebra, finite geometry, number theory, and combinatorics. Hadamard matrices arise in a very diverse set of applications. Starting with applications in experimental design theory and the theory of error-correcting codes, they have found unexpected and important applications in cryptography, quantum information theory, communications, and networking.
Algebra --- Mathematics --- Physical Sciences & Mathematics --- Combinatorial designs and configurations --- Hadamard matrices --- Configurations and designs, Combinatorial --- Designs and configurations, Combinatorial --- Mathematics. --- Matrix theory. --- Algebra. --- Information theory. --- Number theory. --- Combinatorics. --- Linear and Multilinear Algebras, Matrix Theory. --- Number Theory. --- Information and Communication, Circuits. --- Combinatorial analysis --- Matrices --- Math --- Science --- Number study --- Numbers, Theory of --- Combinatorics --- Mathematical analysis --- Communication theory --- Communication --- Cybernetics
Choose an application
This volume develops the depth and breadth of the mathematics underlying the construction and analysis of Hadamard matrices and their use in the construction of combinatorial designs. At the same time, it pursues current research in their numerous applications in security and cryptography, quantum information, and communications. Bridges among diverse mathematical threads and extensive applications make this an invaluable source for understanding both the current state of the art and future directions. The existence of Hadamard matrices remains one of the most challenging open questions in combinatorics. Substantial progress on their existence has resulted from advances in algebraic design theory using deep connections with linear algebra, abstract algebra, finite geometry, number theory, and combinatorics. Hadamard matrices arise in a very diverse set of applications. Starting with applications in experimental design theory and the theory of error-correcting codes, they have found unexpected and important applications in cryptography, quantum information theory, communications, and networking.
Number theory --- Algebra --- Mathematical control systems --- Discrete mathematics --- Information systems --- algebra --- ICT (informatie- en communicatietechnieken) --- matrices --- discrete wiskunde --- informatiesystemen --- getallenleer --- informatietheorie
Choose an application
This book constitutes the refereed post-conference proceedings of the 30th International Workshop on Combinatorial Algorithms, IWOCA 2019, held in Pisa, Italy, in July 2019. The 36 regular papers presented in this volume were carefully reviewed and selected from 73 submissions. They cover diverse areas of combinatorical algorithms, complexity theory, graph theory and combinatorics, combinatorial optimization, cryptography and information security, algorithms on strings and graphs, graph drawing and labelling, computational algebra and geometry, computational biology, probabilistic and randomized algorithms, algorithms for big data analytics, and new paradigms of computation.
Computational complexity. --- Computer software. --- Data structures (Computer scienc. --- Computer science. --- Computer graphics. --- Discrete Mathematics in Computer Science. --- Algorithm Analysis and Problem Complexity. --- Data Structures. --- Arithmetic and Logic Structures. --- Computer Graphics. --- Automatic drafting --- Graphic data processing --- Graphics, Computer --- Computer art --- Graphic arts --- Electronic data processing --- Engineering graphics --- Image processing --- Informatics --- Science --- Software, Computer --- Computer systems --- Complexity, Computational --- Machine theory --- Digital techniques --- Data structures (Computer science) --- Information structures (Computer science) --- Structures, Data (Computer science) --- Structures, Information (Computer science) --- File organization (Computer science) --- Abstract data types (Computer science) --- Combinatorial analysis --- Computer science—Mathematics. --- Algorithms. --- Data structures (Computer science). --- Arithmetic and logic units, Computer. --- Arithmetic and logic units, Computer --- Computer arithmetic --- Electronic digital computers --- Algorism --- Algebra --- Arithmetic --- Circuits --- Foundations --- Discrete mathematics. --- Artificial intelligence—Data processing. --- Computer arithmetic and logic units. --- Data Science. --- Discrete mathematical structures --- Mathematical structures, Discrete --- Structures, Discrete mathematical --- Numerical analysis
Choose an application
Continuing in the bestselling, informative tradition of the first edition, this second edition remains the only resource to contain all of the most important results and tables in the area of combinatorial design. The handbook covers the constructions of designs, existence results, properties of designs, and applications of designs. Over 30% longer than the first edition, it contains new chapters on the history of design theory, various codes, bent functions, and numerous designs as well as updated tables, including BIBDs, PBDs, MOLS, and Hadamard matrices. With expanded and updated coverage,
Choose an application
Combinatorial design theory is a vibrant area of combinatorics, connecting graph theory, number theory, geometry, and algebra with applications in experimental design, coding theory, and numerous applications in computer science. This volume is a collection of forty-one state-of-the-art research articles spanning all of combinatorial design theory. The articles develop new methods for the construction and analysis of designs and related combinatorial configurations; both new theoretical methods, and new computational tools and results, are presented. In particular, they extend the current state of knowledge on Steiner systems, Latin squares, one-factorizations, block designs, graph designs, packings and coverings, and develop recursive and direct constructions. The contributions form an overview of the current diversity of themes in design theory for those peripherally interested, while researchers in the field will find it to be a major collection of research advances. The volume is dedicated to Alex Rosa, who has played a major role in fostering and developing combinatorial design theory.
Choose an application
The scope of the volume includes all algorithmic and computational aspects of research on combinatorial designs. Algorithmic aspects include generation, isomorphism and analysis techniques - both heuristic methods used in practice, and the computational complexity of these operations. The scope within design theory includes all aspects of block designs, Latin squares and their variants, pairwise balanced designs and projective planes and related geometries.
Choose an application
This volume records and disseminates selected papers from the Stinson66 conference, including surveys, prospectives, and papers presenting original and current research. It contains four accessible surveys of topics in combinatorial designs and related topics, ranging from a tutorial survey of connections to classical group theory, to surveys of "hot topics" in current research. It also contains a prospective paper identifying topics for future research efforts, co-authored by one of the elder statesmen of the field, Alex Rosa. Finally, the research papers examine topics ranging from pure mathematics to applied work in computing, networking, communications, and cryptography. For students and newcomers to these topics, the volume provides accessible survey material that does not have onerous prerequisites. The breadth of topics reflects the vibrancy of the field in a way that can be appreciated by all researchers. The papers present important advances on theory and applications, which also benefit advanced researchers.
Number theory. --- Quantum communication. --- Statistics. --- Computer science. --- Approximation theory. --- Number Theory. --- Quantum Communications and Cryptography. --- Computer Science. --- Approximations and Expansions. --- Cryptography
Choose an application
Statistical science --- Number theory --- Functional analysis --- Numerical approximation theory --- Computer science --- computers --- informatica --- statistiek --- wiskunde --- getallenleer --- computerkunde
Choose an application
Choose an application
The volume covers wide-ranging topics from Theory: structure of finite fields, normal bases, polynomials, function fields, APN functions. Computation: algorithms and complexity, polynomial factorization, decomposition and irreducibility testing, sequences and functions. Applications: algebraic coding theory, cryptography, algebraic geometry over finite fields, finite incidence geometry, designs, combinatorics, quantum information science.
Finite fields (Algebra) --- Modular fields (Algebra) --- Algebra, Abstract --- Algebraic fields --- Galois theory --- Modules (Algebra)
Listing 1 - 10 of 11 | << page >> |
Sort by
|