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.G. L. KATSMAN: Bounds on covering radius of dual product codes, Lecture Notes in Computer Science, No. 573, pp. ... K. E. KILBY and N. J. A. SLOANE: On the covering radius problem for codes: I Bounds on normalized covering radius, II Codes of low ... I. KRASIKOV and S. LITSYN: On spectra of BCH codes, IEEE Trans.
|Author||:||G. Cohen, I. Honkala, S. Litsyn, A. Lobstein|
|Publisher||:||Elsevier - 1997-04-14|