This is the first monograph on codebooks and linear codes from difference sets and almost difference sets. It aims at providing a survey of constructions of difference sets and almost difference sets as well as an in-depth treatment of codebooks and linear codes from difference sets and almost difference sets. To be self-contained, this monograph covers necessary mathematical foundations and the basics of coding theory. It also contains tables of best BCH codes and best cyclic codes over GF(2) and GF(3) up to length 125 and 79, respectively. This repository of tables can be used to benchmark newly constructed cyclic codes. This monograph is intended to be a reference for postgraduates and researchers who work on combinatorics, or coding theory, or digital communications.

The explanation of the formal duality of Kerdock and Preparata codes is one of the outstanding results in the field of applied algebra in the last few years. This result is related to the discovery of large sets of quad riphase sequences over Z4 whose correlation properties are better than those of the best binary sequences. Moreover, the correlation properties of sequences are closely related to difference properties of certain sets in (cyclic) groups. It is the purpose of this book to illustrate the connection between these three topics. Most articles grew out of lectures given at the NATO Ad vanced Study Institute on "Difference sets, sequences and their correlation properties". This workshop took place in Bad Windsheim (Germany) in August 1998. The editors thank the NATO Scientific Affairs Division for the generous support of this workshop. Without this support, the present collection of articles would not have been realized.

"Published in cooperation with NATO Emerging Security Challenges Division"--T.p.

Following an initiative of the late Hans Zassenhaus in 1965, the Departments of Mathematics at The Ohio State University and Denison University organize conferences in combinatorics, group theory, and ring theory. Between May 18-21, 2000, the 25th conference of this series was held. Usually, there are twenty to thirty invited 20-minute talks in each of the three main areas. However, at the 2000 meeting, the combinatorics part of the conference was extended, to honor the 65th birthday of Professor Dijen Ray-Chaudhuri. This volulme is the proceedings of this extension. Most of the papers are in coding theory and design theory, reflecting the major interest of Professor Ray-Chaudhuri, but there are articles on association schemes, algebraic graph theory, combinatorial geometry, and network flows as well. There are four surveys and seventeen research articles, and all of these went through a thorough refereeing process. The volume is primarily recommended for researchers and graduate students interested in new developments in coding theory and design theory.

This is the revised edition of Berlekamp's famous book, 'Algebraic Coding Theory', originally published in 1968, wherein he introduced several algorithms which have subsequently dominated engineering practice in this field. One of these is an algorithm for decoding Reed-Solomon and Bose-Chaudhuri-Hocquenghem codes that subsequently became known as the Berlekamp-Massey Algorithm. Another is the Berlekamp algorithm for factoring polynomials over finite fields, whose later extensions and embellishments became widely used in symbolic manipulation systems. Other novel algorithms improved the basic methods for doing various arithmetic operations in finite fields of characteristic two. Other major research contributions in this book included a new class of Lee metric codes, and precise asymptotic results on the number of information symbols in long binary BCH codes.Selected chapters of the book became a standard graduate textbook.Both practicing engineers and scholars will find this book to be of great value.

No detailed description available for "Groups, Difference Sets, and the Monster".

This volume examines state of the art research in finite geometries and designs.

A self-contained account suited for a wide audience describing coding theory, combinatorial designs and their relations.

The Indian National. Science Academy has planned to bring out monographs on special topics with the aim of providing acce~sible surveys/reviews of topics of current research in various fields. Prof. S.K. Malik, FNA, Editor of Publications INSA asked me in October 1997 to edit a volume on algebra in this series. I invited a number of algebraists, several of them working in group rings, and it is with great satisfaction and sincere thanks to the authors that I present here in Algebra: Some Recent Advances the sixteen contributions received in response to my invitations. I.B.S. Passi On Abelian Difference Sets K. r Arasu* and Surinder K. Sehgal 1. Introduction We review some existence and nonexistence results - new and old - on abelian difference sets. Recent surveys on difference sets can be found in Arasu (1990), Jungnickel (1992a, b), Pott (1995), Jungnickel and Schmidt (1997), and Davis and Jedwab (1996). Standard references for difference sets are Baumert (1971), Beth et al. (1998), and Lander (1983). This article presents a flavour of the subject, by discussing some selected topics. Difference sets are very important in combinatorial design theory and in commu nication engineering while designing sequences with good correlation properties. Our extended bibliography covers a wide variety of papers written in the area of difference sets and related topics.