00875nam0-22003251i-450 99000172046040332120191112115919.0000172046FED01000172046(Aleph)000172046FED0100017204620030910d1980----km-y0itay50------baitaITy-------001yyTest di teratogenesiErminio Giavini, Vincenzo G. LeonePadovaPiccin198029 p.24 cmQuaderni di biologiaMetodi4Teratologia574.2Giavini,Erminio74296Leone,Vincenzo G.74297ITUNINARICAUNIMARCLG99000172046040332160 OP. 170/4575FAGBCFAGBCTest di teratogenesi360336UNINA01070nam 2200325Ka 450 991069589180332120070504152658.0(CKB)5470000002372869(OCoLC)123991843(EXLCZ)99547000000237286920070504d2004 ua 0engtxtrdacontentcrdamediacrrdacarrierGeneral management[electronic resource] summary report on weaknesses in Treasury bureau purchase card programs[Washington, D.C.] :Office of Inspector General, Dept. of the Treasury,[2004]17 pages digital, PDF fileAudit report ;OIG-04-034Title from title screen (viewed on May 4, 2007)."June 18, 2004."General management Government purchase cardsUnited StatesGovernment purchase cardsGPOGPOBOOK9910695891803321General management3448317UNINA05433nam 2200697Ia 450 991102023250332120200520144314.09786610519163978128051916112805191699780470035702047003570697804700356960470035692(CKB)1000000000357367(EBL)267166(OCoLC)77720979(SSID)ssj0000289172(PQKBManifestationID)11220292(PQKBTitleCode)TC0000289172(PQKBWorkID)10384005(PQKB)10664272(MiAaPQ)EBC267166(Perlego)2777100(EXLCZ)99100000000035736720030226d2002 uy 0engur|n|---|||||txtccrThe art of error correcting coding /Robert H. Morelos-Zaragoza2nd ed.Chichester John Wiley & Sonsc20021 online resource (279 p.)Description based upon print version of record.9780470015582 0470015586 Includes bibliographical references (p. [195]-204) and index.The Art of Error Correcting Coding; Contents; Preface; Foreword; The ECC web site; 1 Introduction; 1.1 Error correcting coding: Basic concepts; 1.1.1 Block codes and convolutional codes; 1.1.2 Hamming distance, Hamming spheres and error correcting capability; 1.2 Linear block codes; 1.2.1 Generator and parity-check matrices; 1.2.2 The weight is the distance; 1.3 Encoding and decoding of linear block codes; 1.3.1 Encoding with G and H; 1.3.2 Standard array decoding; 1.3.3 Hamming spheres, decoding regions and the standard array; 1.4 Weight distribution and error performance1.4.1 Weight distribution and undetected error probability over a BSC1.4.2 Performance bounds over BSC, AWGN and fading channels; 1.5 General structure of a hard-decision decoder of linear codes; Problems; 2 Hamming, Golay and Reed-Muller codes; 2.1 Hamming codes; 2.1.1 Encoding and decoding procedures; 2.2 The binary Golay code; 2.2.1 Encoding; 2.2.2 Decoding; 2.2.3 Arithmetic decoding of the extended (24, 12, 8) Golay code; 2.3 Binary Reed-Muller codes; 2.3.1 Boolean polynomials and RM codes; 2.3.2 Finite geometries and majority-logic decoding; Problems; 3 Binary cyclic codes and BCH codes3.1 Binary cyclic codes3.1.1 Generator and parity-check polynomials; 3.1.2 The generator polynomial; 3.1.3 Encoding and decoding of binary cyclic codes; 3.1.4 The parity-check polynomial; 3.1.5 Shortened cyclic codes and CRC codes; 3.1.6 Fire codes; 3.2 General decoding of cyclic codes; 3.2.1 GF(2m) arithmetic; 3.3 Binary BCH codes; 3.3.1 BCH bound; 3.4 Polynomial codes; 3.5 Decoding of binary BCH codes; 3.5.1 General decoding algorithm for BCH codes; 3.5.2 The Berlekamp-Massey algorithm (BMA); 3.5.3 PGZ decoder; 3.5.4 Euclidean algorithm; 3.5.5 Chien search and error correction3.5.6 Errors-and-erasures decoding3.6 Weight distribution and performance bounds; 3.6.1 Error performance evaluation; Problems; 4 Nonbinary BCH codes: Reed-Solomon codes; 4.1 RS codes as polynomial codes; 4.2 From binary BCH to RS codes; 4.3 Decoding RS codes; 4.3.1 Remarks on decoding algorithms; 4.3.2 Errors-and-erasures decoding; 4.4 Weight distribution; Problems; 5 Binary convolutional codes; 5.1 Basic structure; 5.1.1 Recursive systematic convolutional codes; 5.1.2 Free distance; 5.2 Connections with block codes; 5.2.1 Zero-tail construction; 5.2.2 Direct-truncation construction5.2.3 Tail-biting construction5.2.4 Weight distributions; 5.3 Weight enumeration; 5.4 Performance bounds; 5.5 Decoding: Viterbi algorithm with Hamming metrics; 5.5.1 Maximum-likelihood decoding and metrics; 5.5.2 The Viterbi algorithm; 5.5.3 Implementation issues; 5.6 Punctured convolutional codes; 5.6.1 Implementation issues related to punctured convolutional codes; 5.6.2 RCPC codes; Problems; 6 Modifying and combining codes; 6.1 Modifying codes; 6.1.1 Shortening; 6.1.2 Extending; 6.1.3 Puncturing; 6.1.4 Augmenting, expurgating and lengthening; 6.2 Combining codes6.2.1 Time sharing of codesBuilding on the success of the first edition, which offered a practical introductory approach to the techniques of error concealment, this book, now fully revised and updated, provides a comprehensive treatment of the subject and includes a wealth of additional features. The Art of Error Correcting Coding, Second Edition explores intermediate and advanced level concepts as well as those which will appeal to the novice. All key topics are discussed, including Reed-Solomon codes, Viterbi decoding, soft-output decoding algorithms, MAP, log-MAP and MAX-log-MAP. Reliability-based algorithError-correcting codes (Information theory)Information theoryError-correcting codes (Information theory)Information theory.621.3822621.3822015154.10bclMorelos-Zaragoza Robert H906022MiAaPQMiAaPQMiAaPQBOOK9911020232503321The art of error correcting coding2026511UNINA