TY  - BOOK
AU  - Cohen,G.
TI  - Covering codes
T2  - North-Holland mathematical library
SN  - 9780444825117
AV  - QA166.7 .C68 1997eb
U1  - 003/.54 22
PY  - 1997///
CY  - Amsterdam, New York
PB  - Elsevier
KW  - Combinatorial packing and covering
KW  - COMPUTERS
KW  - Information Theory
KW  - bisacsh
KW  - fast
KW  - Electronic books
N1  - Includes bibliographical references (pages 495-536) and index; Introduction -- Basic facts -- Constructions -- Normality -- Linear constructions -- Lower bounds -- Lower bounds for linear codes -- Upper bounds -- Reed-Muller codes --Algebraic codes -- Perfect codes -- Asymptotic bounds -- Weighted coverings -- Multiple coverings -- Football pools -- Tilings -- Writing on constrained memories -- Subset sums and constrained memories -- Heterodox coverings -- Complexity
N2  - 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
UR  - http://www.sciencedirect.com/science/book/9780444825117
UR  - http://www.sciencedirect.com/science/publication?issn=09246509&volume=54
ER  -