Covering codes [electronic resource] / G�erard Cohen [and others].

Contributor(s): Cohen, G. (G�erard), 1951-Material type: Text

TextSeries: North-Holland mathematical library ; v. 54.Publication details: Amsterdam ; New York : Elsevier, 1997. Description: 1 online resource (xxi, 542 pages) : illustrationsContent type: text Media type: computer Carrier type: online resourceISBN: 9780444825117; 0444825118; 9780080530079 (electronic bk.); 0080530079 (electronic bk.)Subject(s): Combinatorial packing and covering | COMPUTERS -- Information Theory | Combinatorial packing and coveringGenre/Form: Electronic books.Additional physical formats: Print version:: Covering codes.DDC classification: 003/.54 LOC classification: QA166.7 | .C68 1997ebOnline resources: ScienceDirect | ScienceDirect

Contents:

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.

Summary: 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.

Tags from this library: No tags from this library for this title. Log in to add tags.

Average rating: 0.0 (0 votes)

Holdings ( 0 )
Title notes ( 4 )
Comments ( 0 )

No physical items for this record

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.

Includes bibliographical references (pages 495-536) and index.

Description based on print version record.

There are no comments on this title.

to post a comment.