000 03747cam a2200637Ia 4500
001 ocn162131111
003 OCoLC
005 20141103172224.0
006 m o d
007 cr cn|||||||||
008 070802s1997 ne a ob 001 0 eng d
040 _aOPELS
_beng
_epn
_cOPELS
_dOCLCG
_dOPELS
_dOCLCQ
_dN$T
_dYDXCP
_dBTCTA
_dMERUC
_dE7B
_dIDEBK
_dTULIB
_dOCLCO
_dOCLCQ
_dOPELS
_dOCLCF
_dDEBBG
_dOCLCQ
019 _a173240208
_a174133899
_a179791178
_a441798368
_a648325515
_a779919629
020 _a9780444825117
020 _a0444825118
020 _a9780080530079 (electronic bk.)
020 _a0080530079 (electronic bk.)
029 1 _aAU@
_b000048129571
029 1 _aDEBBG
_bBV036962272
029 1 _aDEBBG
_bBV039830140
029 1 _aNZ1
_b12433076
029 1 _aNZ1
_b15192847
035 _a(OCoLC)162131111
_z(OCoLC)173240208
_z(OCoLC)174133899
_z(OCoLC)179791178
_z(OCoLC)441798368
_z(OCoLC)648325515
_z(OCoLC)779919629
037 _a126291:126953
_bElsevier Science & Technology
_nhttp://www.sciencedirect.com
050 4 _aQA166.7
_b.C68 1997eb
072 7 _aCOM
_x031000
_2bisacsh
082 0 4 _a003/.54
_222
049 _aTEFA
245 0 0 _aCovering codes
_h[electronic resource] /
_cG�erard Cohen [and others].
260 _aAmsterdam ;
_aNew York :
_bElsevier,
_c1997.
300 _a1 online resource (xxi, 542 pages) :
_billustrations.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
490 1 _aNorth-Holland mathematical library ;
_vv. 54
520 _aThe 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.
504 _aIncludes bibliographical references (pages 495-536) and index.
505 0 _aIntroduction -- 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.
588 _aDescription based on print version record.
650 0 _aCombinatorial packing and covering.
650 7 _aCOMPUTERS
_xInformation Theory.
_2bisacsh
650 7 _aCombinatorial packing and covering.
_2fast
_0(OCoLC)fst00868982
655 4 _aElectronic books.
700 1 _aCohen, G.
_q(G�erard),
_d1951-
776 0 8 _iPrint version:
_tCovering codes.
_dAmsterdam ; New York : Elsevier, 1997
_z0444825118
_z9780444825117
_w(DLC) 97002461
_w(OCoLC)36327381
830 0 _aNorth-Holland mathematical library ;
_vv. 54.
856 4 0 _3ScienceDirect
_uhttp://www.sciencedirect.com/science/book/9780444825117
856 4 0 _3ScienceDirect
_uhttp://www.sciencedirect.com/science/publication?issn=09246509&volume=54
938 _aBaker and Taylor
_bBTCP
_nBK0007491350
938 _aebrary
_bEBRY
_nebr10190389
938 _aEBSCOhost
_bEBSC
_n205706
938 _aIngram Digital eBook Collection
_bIDEB
_n103907
938 _aYBP Library Services
_bYANK
_n2636750
942 _cEB
994 _aC0
_bTEF
999 _c21739
_d21739