You may have to Search all our reviewed books and magazines, click the sign up button below to create a free account.
This volume contains the proceedings of the AMS Special Session on Discrete Geometry and Algebraic Combinatorics held on January 11, 2013, in San Diego, California. The collection of articles in this volume is devoted to packings of metric spaces and related questions, and contains new results as well as surveys of some areas of discrete geometry. This volume consists of papers on combinatorics of transportation polytopes, including results on the diameter of graphs of such polytopes; the generalized Steiner problem and related topics of the minimal fillings theory; a survey of distance graphs and graphs of diameters, and a group of papers on applications of algebraic combinatorics to packings of metric spaces including sphere packings and topics in coding theory. In particular, this volume presents a new approach to duality in sphere packing based on the Poisson summation formula, applications of semidefinite programming to spherical codes and equiangular lines, new results in list decoding of a family of algebraic codes, and constructions of bent and semi-bent functions.
In these papers associated with the workshop of December 2003, contributors describe their work in fountain codes for lossless data compression, an application of coding theory to universal lossless source coding performance bounds, expander graphs and codes, multilevel expander codes, low parity check lattices, sparse factor graph representations of Reed-Solomon and related codes. Interpolation multiplicity assignment algorithms for algebraic soft- decision decoding of Reed-Solomon codes, the capacity of two- dimensional weight-constrained memories, networks of two-way channels, and a new approach to the design of digital communication systems. Annotation :2005 Book News, Inc., Portland, OR (booknews.com).
CRYPTOGRAPHY, INFORMATION THEORY, AND ERROR-CORRECTION A rich examination of the technologies supporting secure digital information transfers from respected leaders in the field As technology continues to evolve Cryptography, Information Theory, and Error-Correction: A Handbook for the 21ST Century is an indispensable resource for anyone interested in the secure exchange of financial information. Identity theft, cybercrime, and other security issues have taken center stage as information becomes easier to access. Three disciplines offer solutions to these digital challenges: cryptography, information theory, and error-correction, all of which are addressed in this book. This book is geared t...
This volume stems from two DIMACS activities, the U.S.-Africa Advanced Study Institute and the DIMACS Workshop, both on Mathematical Modeling of Infectious Diseases in Africa, held in South Africa in the summer of 2007. It contains both tutorial papers and research papers. Students and researchers should find the papers on modeling and analyzing certain diseases currently affecting Africa very informative. In particular, they can learn basic principles of disease modeling and stability from the tutorial papers where continuous and discrete time models, optimal control, and stochastic features are introduced.
Computer-Aided Design and Manufacturing (CAD/CAM) is concerned with all aspects of the process of designing, prototyping, manufacturing, inspecting, and maintaining complex geometric objects under computer control. As such, there is a natural synergy between this field and Computational Geometry (CG), which involves the design, analysis, implementation, and testing of efficient algorithms and data representation techniques for geometric entities such as points, polygons, polyhedra, curves, and surfaces. The DIMACS Center (Piscataway, NJ) sponsored a workshop to further promote the interaction between these two fields. Attendees from academia, research laboratories, and industry took part in the invited talks, contributed presentations, and informal discussions. This volume is an outgrowth of that meeting.
The topics covered in this book, written by researchers at the forefront of their field, represent some of the most relevant research areas in modern coding theory: codes and combinatorial structures, algebraic geometric codes, group codes, quantum codes, convolutional codes, network coding and cryptography. The book includes a survey paper on the interconnections of coding theory with constrained systems, written by an invited speaker, as well as 37 cutting-edge research communications presented at the 4th International Castle Meeting on Coding Theory and Applications (4ICMCTA), held at the Castle of Palmela in September 2014. The event’s scientific program consisted of four invited talks and 39 regular talks by authors from 24 different countries. This conference provided an ideal opportunity for communicating new results, exchanging ideas, strengthening international cooperation, and introducing young researchers into the coding theory community.
The book is a collection of some of the research presented at the workshop of the same name held in May 2003 at Rutgers University. The workshop brought together researchers from two different communities: statisticians and specialists in computational geometry. The main idea unifying these two research areas turned out to be the notion of data depth, which is an important notion both in statistics and in the study of efficiency of algorithms used in computational geometry. Many of the articles in the book lay down the foundations for further collaboration and interdisciplinary research. Information for our distributors: Co-published with the Center for Discrete Mathematics and Theoretical Computer Science beginning with Volume 8. Volumes 1-7 were co-published with the Association for Computer Machinery (ACM).
This volume contains the proceedings of the 11th International Conference on Finite Fields and their Applications (Fq11), held July 22-26, 2013, in Magdeburg, Germany. Finite Fields are fundamental structures in mathematics. They lead to interesting deep problems in number theory, play a major role in combinatorics and finite geometry, and have a vast amount of applications in computer science. Papers in this volume cover these aspects of finite fields as well as applications in coding theory and cryptography.
This volume contains the proceedings of the 17th International Conference on Arithmetic, Geometry, Cryptography and Coding Theory (AGC2T-17), held from June 10–14, 2019, at the Centre International de Rencontres Mathématiques in Marseille, France. The conference was dedicated to the memory of Gilles Lachaud, one of the founding fathers of the AGC2T series. Since the first meeting in 1987 the biennial AGC2T meetings have brought together the leading experts on arithmetic and algebraic geometry, and the connections to coding theory, cryptography, and algorithmic complexity. This volume highlights important new developments in the field.