Covering codes
Covering codes [electronic resource] /
G�erard Cohen [and others].
- Amsterdam ; New York : Elsevier, 1997.
- 1 online resource (xxi, 542 pages) : illustrations.
- North-Holland mathematical library ; v. 54 .
- North-Holland mathematical library ; v. 54. .
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.
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.
9780444825117 0444825118 9780080530079 (electronic bk.) 0080530079 (electronic bk.)
126291:126953 Elsevier Science & Technology http://www.sciencedirect.com
Combinatorial packing and covering.
COMPUTERS--Information Theory.
Combinatorial packing and covering.
Electronic books.
QA166.7 / .C68 1997eb
003/.54
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.
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.
9780444825117 0444825118 9780080530079 (electronic bk.) 0080530079 (electronic bk.)
126291:126953 Elsevier Science & Technology http://www.sciencedirect.com
Combinatorial packing and covering.
COMPUTERS--Information Theory.
Combinatorial packing and covering.
Electronic books.
QA166.7 / .C68 1997eb
003/.54
