Covering Codes

Covering Codes

4.11 - 1251 ratings - Source

The problems of constructing covering codes and of estimating their parameters are the main concern of this book. It provides a unified account of the most recent theory of covering codes and shows how a number of mathematical and engineering issues are related to covering problems. Scientists involved in discrete mathematics, combinatorics, computer science, information theory, geometry, algebra or number theory will find the book of particular significance. It is designed both as an introductory textbook for the beginner and as a reference book for the expert mathematician and engineer. A number of unsolved problems suitable for research projects are also discussed.Applying Theorem 4.3.8 to long punctured Preparata codes of length 2a€ a€“ 1 yields abnormal codes with minimum distance at ... d(bi, bi) agt; 3 for all i + j, and bi, = b, ; and bij = b, ; whenever d(bi, bi) alt; 4. ... UT, ) has covering radius greater than one.

Title:Covering Codes
Author:G. Cohen, I. Honkala, S. Litsyn, A. Lobstein
Publisher:Elsevier - 1997-04-14


You Must CONTINUE and create a free account to access unlimited downloads & streaming