A new starting-point and a new method are requisite, to insure a complete [classi?cation of the Steiner triple systems of order 15]. This method was furnished, and its tedious and di?cult execution und- taken, by Mr. Cole. F. N. Cole, L. D. Cummings, and H. S. White (1917) [129] The history of classifying combinatorial objects is as old as the history of the objects themselves. In the mid-19th century, Kirkman, Steiner, and others became the fathers of modern combinatorics, and their work – on various objects, including (what became later known as) Steiner triple systems – led to several classi?cation results. Almost a century earlier, in 1782, Euler [180] published some results on classifying small Latin squares, but for the ?rst few steps in this direction one should actually go at least as far back as ancient Greece and the proof that there are exactly ?ve Platonic solids. One of the most remarkable achievements in the early, pre-computer era is the classi?cation of the Steiner triple systems of order 15, quoted above. An onerous task that, today, no sensible person would attempt by hand calcu- tion. Because, with the exception of occasional parameters for which com- natorial arguments are e?ective (often to prove nonexistence or uniqueness), classi?cation in general is about algorithms and computation.

Continuing in the bestselling, informative tradition of the first edition, the Handbook of Combinatorial Designs, Second Edition remains the only resource to contain all of the most important results and tables in the field of combinatorial design. This handbook covers the constructions, properties, and applications of designs as well as existence

Pt. 1. Applications of coding theory to computational complexity. ch. 1. Linear complexity and related complexity measures / Arne Winterhof. ch. 2. Lattice and construction of high coding gain lattices from codes / Mohammd-Reza Sadeghi. ch. 3. Distributed space-time codes with low ML decoding complexity / G. Susinder Rajan and B. Sundar Rajan -- pt. 2. Methods of algebraic combinatorics in coding theory/codes construction and existence. ch. 4. Coding theory and algebraic combinatorics / Michael Huber. ch. 5. Block codes from matrix and group rings / Paul Hurley and Ted Hurley. ch. 6. LDPC and convolutional codes from matrix and group rings / Paul Hurley and Ted Hurley. ch. 7. Search for good linear codes in the class of quasi-cyclic and related codes / Nuh Aydin and Tsvetan Asamov -- pt. 3. Source coding/channel capacity/network coding. ch. 8. Applications of universal source coding to statistical analysis of time series / Boris Ryabko. ch. 9. Introduction to network coding for acyclic and cyclic networks / Ángela I. Barbero and Øyvind Ytrehus. ch. 10. Distributed joint source-channel coding on a multiple access channel / Vinod Sharma and R. Rajesh -- pt. 4. Other selected topics in information and coding theory. ch. 11. Low-density parity-check codes and the related performance analysis methods / Xudong Ma. ch. 12. Variable length codes and finite automata / Marie-Pierre Béal [und weitere]. ch. 13. Decoding and finding the minimum distance with Gröbner Bases : history and new insights / Stanislav Bulygin and Ruud Pellikaan. ch. 14. Cooperative diversity systems for wireless communication / Murat Uysal and Muhammad Mehboob Fareed. ch. 15. Public key cryptography and coding theory / Pascal Véron

This book constitutes the proceedings of the 32nd International Workshop on Combinatorial Algorithms which was planned to take place in Ottawa, ON, Canada, in July 2021. Due to the COVID-19 pandemic the conference changed to a virtual format. The 38 full papers included in this book together with 2 invited talks were carefully reviewed and selected from 107 submissions. They focus on algorithms design for the myriad of combinatorial problems that underlie computer applications in science, engineering and business. Chapter “Minimum Eccentricity Shortest Path Problem with Respect to Structural Parameters” is available open access under a Creative Commons Attribution 4.0 International License via link.springer.com.

This book constitutes the proceedings of the 6th International Conference on Mathematical Software, ICMS 2018, held in South Bend, IN, USA, in July 2018.The 59 papers included in this volume were carefully reviewed and selected from numerous submissions. The program of the 2018 meeting consisted of 20 topical sessions, each of which providing an overview of the challenges, achievements and progress in a subeld of mathematical software research, development and use.

Combinatorial Designs for Authentication and Secrecy Codes is a succinct in-depth review and tutorial of a subject that promises to lead to major advances in computer and communication security. This monograph provides a tutorial on combinatorial designs, which gives an overview of the theory. Furthermore, the application of combinatorial designs to authentication and secrecy codes is described in depth. This close relationship of designs with cryptography and information security was first revealed in Shannon's seminal paper on secrecy systems. We bring together in one source foundational and current contributions concerning design-theoretic constructions and characterizations of authentication and secrecy codes.

Most coding theory experts date the origin of the subject with the 1948 publication of A Mathematical Theory of Communication by Claude Shannon. Since then, coding theory has grown into a discipline with many practical applications (antennas, networks, memories), requiring various mathematical techniques, from commutative algebra, to semi-definite programming, to algebraic geometry. Most topics covered in the Concise Encyclopedia of Coding Theory are presented in short sections at an introductory level and progress from basic to advanced level, with definitions, examples, and many references. The book is divided into three parts: Part I fundamentals: cyclic codes, skew cyclic codes, quasi-cyclic codes, self-dual codes, codes and designs, codes over rings, convolutional codes, performance bounds Part II families: AG codes, group algebra codes, few-weight codes, Boolean function codes, codes over graphs Part III applications: alternative metrics, algorithmic techniques, interpolation decoding, pseudo-random sequences, lattices, quantum coding, space-time codes, network coding, distributed storage, secret-sharing, and code-based-cryptography. Features Suitable for students and researchers in a wide range of mathematical disciplines Contains many examples and references Most topics take the reader to the frontiers of research

The characterization of combinatorial or geometric structures in terms of their groups of automorphisms has attracted considerable interest in the last decades and is now commonly viewed as a natural generalization of Felix Klein’s Erlangen program(1872).Inaddition,especiallyfor?nitestructures,importantapplications to practical topics such as design theory, coding theory and cryptography have made the ?eld even more attractive. The subject matter of this research monograph is the study and class- cation of ?ag-transitive Steiner designs, that is, combinatorial t-(v,k,1) designs which admit a group of automorphisms acting transitively on incident point-block pairs. As a consequence of the classi?cation of the ?nite simple groups, it has been possible in recent years to characterize Steiner t-designs, mainly for t=2,adm- ting groups of automorphisms with su?ciently strong symmetry properties. For Steiner 2-designs, arguably the most general results have been the classi?cation of all point 2-transitive Steiner 2-designs in 1985 by W. M. Kantor, and the almost complete determination of all ?ag-transitive Steiner 2-designs announced in 1990 byF.Buekenhout,A.Delandtsheer,J.Doyen,P.B.Kleidman,M.W.Liebeck, and J. Saxl. However, despite the classi?cation of the ?nite simple groups, for Steiner t-designs witht> 2 most of the characterizations of these types have remained long-standing challenging problems. Speci?cally, the determination of all ?- transitive Steiner t-designs with 3? t? 6 has been of particular interest and object of research for more than 40 years.

The past few years have seen significant change in the landscape of high-end network processing. In response to the formidable challenges facing this emerging field, the editors of this series set out to survey the latest research and practices in the design, programming, and use of network processors. Through chapters on hardware, software, performance and modeling, Volume 3 illustrates the potential for new NP applications, helping to lay a theoretical foundation for the architecture, evaluation, and programming of networking processors. Like Volume 2 of the series, Volume 3 further shifts the focus from achieving higher levels of packet processing performance to addressing other critical factors such as ease of programming, application developments, power, and performance prediction. In addition, Volume 3 emphasizes forward-looking, leading-edge research in the areas of architecture, tools and techniques, and applications such as high-speed intrusion detection and prevention system design, and the implementation of new interconnect standards. *Investigates current applications of network processor technology at Intel; Infineon Technologies; and NetModule. Presents current research in network processor design in three distinct areas: *Architecture at Washington University, St. Louis; Oregon Health and Science University; University of Georgia; and North Carolina State University. *Tools and Techniques at University of Texas, Austin; Academy of Sciences, China; University of Paderborn, Germany; and University of Massachusetts, Amherst. *Applications at University of California, Berkeley; Universidad Complutense de Madrid, Spain; ETH Zurich, Switzerland; Georgia Institute of Technology; Vrije Universiteit, the Netherlands; and Universiteit Leiden, the Netherlands.