Download or read book Applications of Finite Geometries to Designs and Codes written by David C. Clark and published by . This book was released on 2011 with total page 127 pages. Available in PDF, EPUB and Kindle. Book excerpt:
Download or read book Combinatorics and Finite Geometry written by Steven T. Dougherty and published by Springer Nature. This book was released on 2020-10-30 with total page 374 pages. Available in PDF, EPUB and Kindle. Book excerpt: This undergraduate textbook is suitable for introductory classes in combinatorics and related topics. The book covers a wide range of both pure and applied combinatorics, beginning with the very basics of enumeration and then going on to Latin squares, graphs and designs. The latter topic is closely related to finite geometry, which is developed in parallel. Applications to probability theory, algebra, coding theory, cryptology and combinatorial game theory comprise the later chapters. Throughout the book, examples and exercises illustrate the material, and the interrelations between the various topics is emphasized. Readers looking to take first steps toward the study of combinatorics, finite geometry, design theory, coding theory, or cryptology will find this book valuable. Essentially self-contained, there are very few prerequisites aside from some mathematical maturity, and the little algebra required is covered in the text. The book is also a valuable resource for anyone interested in discrete mathematics as it ties together a wide variety of topics.
Download or read book Geometries Codes and Cryptography written by G. Longo and published by Springer. This book was released on 2014-05-04 with total page 230 pages. Available in PDF, EPUB and Kindle. Book excerpt: The general problem studied by information theory is the reliable transmission of information through unreliable channels. Channels can be unreliable either because they are disturbed by noise or because unauthorized receivers intercept the information transmitted. In the first case, the theory of error-control codes provides techniques for correcting at least part of the errors caused by noise. In the second case cryptography offers the most suitable methods for coping with the many problems linked with secrecy and authentication. Now, both error-control and cryptography schemes can be studied, to a large extent, by suitable geometric models, belonging to the important field of finite geometries. This book provides an update survey of the state of the art of finite geometries and their applications to channel coding against noise and deliberate tampering. The book is divided into two sections, "Geometries and Codes" and "Geometries and Cryptography". The first part covers such topics as Galois geometries, Steiner systems, Circle geometry and applications to algebraic coding theory. The second part deals with unconditional secrecy and authentication, geometric threshold schemes and applications of finite geometry to cryptography. This volume recommends itself to engineers dealing with communication problems, to mathematicians and to research workers in the fields of algebraic coding theory, cryptography and information theory.
Download or read book Finite Geometry and Combinatorial Applications written by Simeon Ball and published by Cambridge University Press. This book was released on 2015-07-02 with total page 299 pages. Available in PDF, EPUB and Kindle. Book excerpt: A graduate-level introduction to finite geometry and its applications to other areas of combinatorics.
Download or read book Finite Geometry and Combinatorial Applications written by Simeon Ball and published by Cambridge University Press. This book was released on 2015-06-26 with total page 299 pages. Available in PDF, EPUB and Kindle. Book excerpt: The projective and polar geometries that arise from a vector space over a finite field are particularly useful in the construction of combinatorial objects, such as latin squares, designs, codes and graphs. This book provides an introduction to these geometries and their many applications to other areas of combinatorics. Coverage includes a detailed treatment of the forbidden subgraph problem from a geometrical point of view, and a chapter on maximum distance separable codes, which includes a proof that such codes over prime fields are short. The author also provides more than 100 exercises (complete with detailed solutions), which show the diversity of applications of finite fields and their geometries. Finite Geometry and Combinatorial Applications is ideal for anyone, from a third-year undergraduate to a researcher, who wishes to familiarise themselves with and gain an appreciation of finite geometry.
Download or read book Finite Fields with Applications to Coding Theory Cryptography and Related Areas written by Gary L. Mullen and published by Springer Science & Business Media. This book was released on 2012-12-06 with total page 345 pages. Available in PDF, EPUB and Kindle. Book excerpt: The Sixth International Conference on Finite Fields and Applications, Fq6, held in the city of Oaxaca, Mexico, from May 21-25, 2001, continued a series of biennial international conferences on finite fields. This volume documents the steadily increasing interest in this topic. Finite fields are an important tool in discrete mathematics and its applications cover algebraic geometry, coding theory, cryptology, design theory, finite geometries, and scientific computation, among others. An important feature is the interplay between theory and applications which has led to many new perspectives in research on finite fields and other areas. This interplay has been emphasized in this series of conferences and certainly was reflected in Fq6. This volume offers up-to-date original research papers by leading experts in the area.
Download or read book Finite Geometries and Combinatorial Designs written by Earl Sidney Kramer and published by American Mathematical Soc.. This book was released on 1990 with total page 332 pages. Available in PDF, EPUB and Kindle. Book excerpt: The proceedings of an AMS special session on finite geometries and combinatorial designs. Topics range over finite geometry, combinatorial designs, their automorphism groups and related structures.
Download or read book Combinatorial Designs and their Applications written by Kathleen Quinn and published by Taylor & Francis. This book was released on 2023-02-06 with total page 160 pages. Available in PDF, EPUB and Kindle. Book excerpt: The fruit of a conference that gathered seven very active researchers in the field, Combinatorial Design and their Applications presents a wide but representative range of topics on the non-geometrical aspects of design theory. By concentrating on a few important areas, the authors succeed in providing greater detail in these areas in a more complete and accessible form. Through their contributions to this collection, they help fill a gap in the available combinatorics literature.The papers included in this volume cover recent developments in areas of current interest, such as difference sets, cryptography, and optimal linear codes. Researchers in combinatorics and other areas of pure mathematics, along with researchers in statistics and computer design will find in-depth, up-to-date discussions of design theory and the application of the theory to statistical design, codes, and cryptography.
Download or read book Designs From Linear Codes Second Edition written by Cunsheng Ding and published by World Scientific. This book was released on 2021-12-20 with total page 540 pages. Available in PDF, EPUB and Kindle. Book excerpt: Since the publication of the first edition of this monograph, a generalisation of the Assmus-Mattson theorem for linear codes over finite fields has been developed, two 70-year breakthroughs and a considerable amount of other progress on t-designs from linear codes have been made. This second edition is a substantial revision and expansion of the first edition. Two new chapters and two new appendices have been added, and most chapters of the first edition have been revised.It provides a well-rounded and detailed account of t-designs from linear codes. Most chapters of this book cover the support designs of linear codes. A few chapters deal with designs obtained from linear codes in other ways. Connections among ovals, hyperovals, maximal arcs, ovoids, special functions, linear codes and designs are also investigated. This book consists of both classical and recent results on designs from linear codes.It is intended to be a reference for postgraduates and researchers who work on combinatorics, or coding theory, or digital communications, or finite geometry. It can also be used as a textbook for postgraduates in these subject areas.Related Link(s)
Download or read book Finite Fields and their Applications written by James A. Davis and published by Walter de Gruyter GmbH & Co KG. This book was released on 2020-10-26 with total page 214 pages. Available in PDF, EPUB and Kindle. Book excerpt: 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.
Download or read book Finite Geometries and Designs written by P. J. Cameron and published by Cambridge University Press. This book was released on 1981-04-16 with total page 381 pages. Available in PDF, EPUB and Kindle. Book excerpt: This 1981 collection of 33 research papers follows from a conference on the interwoven themes of finite Desarguesian spaces and Steiner systems, amongst other topics.
Download or read book Finite Geometries and Designs written by P. J. Cameron and published by Cambridge University Press. This book was released on 1981-04-16 with total page 0 pages. Available in PDF, EPUB and Kindle. Book excerpt: Originally published in 1981, this collection of 33 research papers follows from a conference on the interwoven themes of finite Desarguesian spaces, Steiner systems, coding theory, group theory, block designs, generalized quadrangles, and projective planes. There is a comprehensive introduction, which aims to interest the non-specialist in the subject and which indicates how the contributions fit together. This is a field of research pursued both for its intrinsic interest and its applications. These papers include a number of open problems whose statement requires very little mathematical sophistication.
Download or read book Finite Geometries written by Gyorgy Kiss and published by CRC Press. This book was released on 2019-07-26 with total page 338 pages. Available in PDF, EPUB and Kindle. Book excerpt: Finite Geometries stands out from recent textbooks about the subject of finite geometries by having a broader scope. The authors thoroughly explain how the subject of finite geometries is a central part of discrete mathematics. The text is suitable for undergraduate and graduate courses. Additionally, it can be used as reference material on recent works. The authors examine how finite geometries’ applicable nature led to solutions of open problems in different fields, such as design theory, cryptography and extremal combinatorics. Other areas covered include proof techniques using polynomials in case of Desarguesian planes, and applications in extremal combinatorics, plus, recent material and developments. Features: Includes exercise sets for possible use in a graduate course Discusses applications to graph theory and extremal combinatorics Covers coding theory and cryptography Translated and revised text from the Hungarian published version
Download or read book Designs and Finite Geometries written by Dieter Jungnickel and published by Springer Science & Business Media. This book was released on 2012-12-06 with total page 242 pages. Available in PDF, EPUB and Kindle. Book excerpt: Designs and Finite Geometries brings together in one place important contributions and up-to-date research results in this important area of mathematics. Designs and Finite Geometries serves as an excellent reference, providing insight into some of the most important research issues in the field.
Download or read book Ordering Block Designs written by Megan Dewar and published by Springer Science & Business Media. This book was released on 2012-08-30 with total page 219 pages. Available in PDF, EPUB and Kindle. Book excerpt: The study of combinatorial block designs is a vibrant area of combinatorial mathematics with connections to finite geometries, graph theory, coding theory and statistics. The practice of ordering combinatorial objects can trace its roots to bell ringing which originated in 17th century England, but only emerged as a significant modern research area with the work of F. Gray and N. de Bruijn. These two fascinating areas of mathematics are brought together for the first time in this book. It presents new terminology and concepts which unify existing and recent results from a wide variety of sources. In order to provide a complete introduction and survey, the book begins with background material on combinatorial block designs and combinatorial orderings, including Gray codes -- the most common and well-studied combinatorial ordering concept -- and universal cycles. The central chapter discusses how ordering concepts can be applied to block designs, with definitions from existing (configuration orderings) and new (Gray codes and universal cycles for designs) research. Two chapters are devoted to a survey of results in the field, including illustrative proofs and examples. The book concludes with a discussion of connections to a broad range of applications in computer science, engineering and statistics. This book will appeal to both graduate students and researchers. Each chapter contains worked examples and proofs, complete reference lists, exercises and a list of conjectures and open problems. Practitioners will also find the book appealing for its accessible, self-contained introduction to the mathematics behind the applications.
Download or read book COMBINATORIAL PROBLEMS RELATED TO CODES DESIGNS AND FINITE GEOMETRIES written by and published by . This book was released on 2017 with total page pages. Available in PDF, EPUB and Kindle. Book excerpt: Abstract : An investigation of an open case of the famous conjecture made by Hamada \cite{Hamada1} is carried out in the first part of this dissertation. In 1973, Hamada made the following conjecture: Let $D$ be a geometric design having as blocks the \textit{d}-subspaces of $pG(n,q)$ or $aG(n,q)$ and let $m$ be the $p$-rank of $D$. If $D'$ is a design with the same parameters as $D$ then the $p$-rank of $D'$ is greater or equal to $m$ and equality holds if and only if $D'$ is isomorphic to $D$. We discuss some properties of the three known nonisomorphic 2-(64,16,5) designs of 2-rank 16, one being the design of the planes in the 3-dimensional affine geometry over the field of order 4. We also try to find an algebraic way to use the similarities between these designs in a search for counter-examples to Hamada's conjecture in affine spaces of higher dimension. Currently we know the existence of 22 projective planes of order 16 up to isomorphism, of which 4 are self dual. In the second part of the thesis, details of 2-(52,4,1) designs associated with known maximal 52-arcs are provided. A number of new maximal (52,4)-arcs in two of the known projective planes of order 16 are established. Newly discovered maximal (52,4)-arcs give new connections between the projective planes of order 16. Previously the number of pairwise non-isomorphic resolutions of 2-(52,4,1) designs was > 30. With the results in Tables 4.2-4.3, this bound is improved. Details of partial geometries coming from known maximal 52-arcs (including ours) are summarized in Table 4.4. We detail the discovery of 37 new 104-sets of type (4,8), 18 of which come from unions of non-isomorphic maximal 52-arcs. Previous to our work, no such examples were known to exist. We discovered that the Johnson plane also contains disjoint maximal 52-arcs. Previously no such sets in the Johnson plane were known. 30. With the results in Tables 4.2-4.3, this bound is improved. Details of partial geometries coming from known maximal 52-arcs (including ours) are summarized in Table 4.4. We detail the discovery of 37 new 104-sets of type (4,8), 18 of which come from unions of non-isomorphic maximal 52-arcs. Previous to our work, no such examples were known to exist. We discovered that the Johnson plane also contains disjoint maximal 52-arcs. Previously no such sets in the Johnson plane were known.
Download or read book Introduction to Finite Geometries written by F. Kárteszi and published by Elsevier. This book was released on 2014-05-12 with total page 281 pages. Available in PDF, EPUB and Kindle. Book excerpt: North-Holland Texts in Advanced Mathematics: Introduction to Finite Geometries focuses on the advancements in finite geometries, including mapping and combinatorics. The manuscript first offers information on the basic concepts on finite geometries and Galois geometries. Discussions focus on linear mapping of a given quadrangle onto another given quadrangle; point configurations of order 2 on a Galois plane of even order; canonical equation of curves of the second order on the Galois planes of even order; and set of collineations mapping a Galois plane onto itself. The text then ponders on geometrical configurations and nets, as well as pentagon theorem and the Desarguesian configuration, two pentagons inscribed into each other, and the concept of geometrical nets. The publication takes a look at combinatorial applications of finite geometries and combinatorics and finite geometries. Topics include generalizations of the Petersen graph, combinatorial extremal problem, and theorem of closure of the hyperbolic space. The book is a valuable source of data for readers interested in finite geometries.
