LEADER 04612nam 22007455 450 001 9910299851103321 005 20200706042841.0 010 $a3-319-01727-6 024 7 $a10.1007/978-3-319-01727-3 035 $a(CKB)3710000000277636 035 $a(EBL)1967855 035 $a(OCoLC)894893527 035 $a(SSID)ssj0001386265 035 $a(PQKBManifestationID)11809730 035 $a(PQKBTitleCode)TC0001386265 035 $a(PQKBWorkID)11373889 035 $a(PQKB)10450224 035 $a(DE-He213)978-3-319-01727-3 035 $a(MiAaPQ)EBC1967855 035 $a(PPN)183096517 035 $a(EXLCZ)993710000000277636 100 $a20141108d2015 u| 0 101 0 $aeng 135 $aur|n|---||||| 181 $ctxt 182 $cc 183 $acr 200 10$aPolynomial Theory of Error Correcting Codes /$fby Giovanni Cancellieri 205 $a1st ed. 2015. 210 1$aCham :$cSpringer International Publishing :$cImprint: Springer,$d2015. 215 $a1 online resource (736 p.) 225 1 $aSignals and Communication Technology,$x1860-4862 300 $aDescription based upon print version of record. 311 $a3-319-01726-8 320 $aIncludes bibliographical references and index. 327 $aGenerator matrix approach to linear block codes -- Wide-sense time-invariant block codes in their generator matrix -- Generator matrix approach to s.s. time-invariant convolutional codes -- Wide-sense time-invariant convolutional codes in their generator matrix -- Parity check matrix approach to linear block codes -- Wide-sense time-invariant block codes in their parity check matrix -- Strict-sense time-invariant convolutional codes in their parity check matrix -- Wide-sense time-invariant convolutional codes in their parity check matrix -- Turbo codes -- Low density parity check codes -- Binomial product generator LDPC block codes -- LDPC convolutional codes -- Appendix A. Matrix algebra in a binary finite field -- Appendix B. Polynomial representation of binary sequences -- Appendix C. Electronic circuits for multiplication or division in polynomial representation of binary sequences -- Appendix D. Survey on the main performance of error correcting codes. 330 $aThe book offers an original view on channel coding, based on a unitary approach to block and convolutional codes for error correction. It presents both new concepts and new families of codes. For example, lengthened and modified lengthened cyclic codes are introduced as a bridge towards time-invariant convolutional codes and their extension to time-varying versions. The novel families of codes include turbo codes and low-density parity check (LDPC) codes, the features of which are justified from the structural properties of the component codes. Design procedures for regular LDPC codes are proposed, supported by the presented theory. Quasi-cyclic LDPC codes, in block or convolutional form, represent one of the most original contributions of the book. The use of more than 100 examples allows the reader gradually to gain an understanding of the theory, and the provision of a list of more than 150 definitions, indexed at the end of the book, permits rapid location of sought information. 410 0$aSignals and Communication Technology,$x1860-4862 606 $aSignal processing 606 $aImage processing 606 $aSpeech processing systems 606 $aAlgebra 606 $aField theory (Physics) 606 $aArithmetic and logic units, Computer 606 $aSignal, Image and Speech Processing$3https://scigraph.springernature.com/ontologies/product-market-codes/T24051 606 $aField Theory and Polynomials$3https://scigraph.springernature.com/ontologies/product-market-codes/M11051 606 $aArithmetic and Logic Structures$3https://scigraph.springernature.com/ontologies/product-market-codes/I12026 615 0$aSignal processing. 615 0$aImage processing. 615 0$aSpeech processing systems. 615 0$aAlgebra. 615 0$aField theory (Physics). 615 0$aArithmetic and logic units, Computer. 615 14$aSignal, Image and Speech Processing. 615 24$aField Theory and Polynomials. 615 24$aArithmetic and Logic Structures. 676 $a621.38210285572 700 $aCancellieri$b Giovanni$4aut$4http://id.loc.gov/vocabulary/relators/aut$0150590 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910299851103321 996 $aPolynomial Theory of Error Correcting Codes$91412157 997 $aUNINA