Coding Theory and Design Theory: Part I Coding Theory
Springer New York, Apr 2, 1990 - Mathematics - 239 pages
This IMA Volume in Mathematics and its Applications Coding Theory and Design Theory Part I: Coding Theory is based on the proceedings of a workshop which was an integral part of the 1987-88 IMA program on APPLIED COMBINATORICS. We are grateful to the Scientific Committee: Victor Klee (Chairman), Daniel Kleitman, Dijen Ray-Chaudhuri and Dennis Stanton for planning and implementing an exciting and stimulating year long program. We especially thank the Workshop Organizer, Dijen Ray-Chaudhuri, for organizing a workshop which brought together many of the major figures in a variety of research fields in which coding theory and design theory are used. A vner Friedman Willard Miller, Jr. PREFACE Coding Theory and Design Theory are areas of Combinatorics which found rich applications of algebraic structures. Combinatorial designs are generalizations of finite geometries. Probably, the history of Design Theory begins with the 1847 pa per of Reverand T. P. Kirkman "On a problem of Combinatorics", Cambridge and Dublin Math. Journal. The great Statistician R. A. Fisher reinvented the concept of combinatorial 2-design in the twentieth century. Extensive application of alge braic structures for construction of 2-designs (balanced incomplete block designs) can be found in R. C. Bose's 1939 Annals of Eugenics paper, "On the construction of balanced incomplete block designs". Coding Theory and Design Theory are closely interconnected. Hamming codes can be found (in disguise) in R. C. Bose's 1947 Sankhya paper "Mathematical theory of the symmetrical factorial designs".
What people are saying - Write a review
We haven't found any reviews in the usual places.
Baer subplanes ovals and unitals
Automorphism groups of block structures with
The differential encoding of coset codes by algebraic methods
15 other sections not shown
Other editions - View all
algebra array association scheme binary Calderbank called cell character table character theory codewords coding theory coefficients columns computation conjugacy classes contained coordinates Corollary corresponding coset covering radius curve defined Definition denote distance divisor eigenvalues elements equation equivalent Euclid's algorithm example exists finite function GF(s given Goppa codes graded poset group G Hadamard Hamming schemes Hermitian variety hyperplane idempotent incidence algebra input integer intersects isomorphic k-lines Lemma length linear loop Math Mathematics maximal metric scheme minimum nontrivial number of points obtained pairs parameters perfect codes perfect multiple coverings permutation PG(N plane PMC with radius polar polynomial division projective Proof Proposition quadric quasigroup rank rational points scalar Section self-dual sequence Spin(n strongly regular graph subgroups subsets subspace Suppose symmetric tangent Theorem trellis code uniform clutter uniform poset vector space weight zero