000 03745nam a22005415i 4500
001 978-3-319-01727-3
003 DE-He213
005 20200421112545.0
007 cr nn 008mamaa
008 141108s2015 gw | s |||| 0|eng d
020 _a9783319017273
_9978-3-319-01727-3
024 7 _a10.1007/978-3-319-01727-3
_2doi
050 4 _aTK5102.9
050 4 _aTA1637-1638
050 4 _aTK7882.S65
072 7 _aTTBM
_2bicssc
072 7 _aUYS
_2bicssc
072 7 _aTEC008000
_2bisacsh
072 7 _aCOM073000
_2bisacsh
082 0 4 _a621.382
_223
100 1 _aCancellieri, Giovanni.
_eauthor.
245 1 0 _aPolynomial Theory of Error Correcting Codes
_h[electronic resource] /
_cby Giovanni Cancellieri.
264 1 _aCham :
_bSpringer International Publishing :
_bImprint: Springer,
_c2015.
300 _aXVIII, 732 p. 320 illus.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aSignals and Communication Technology,
_x1860-4862
505 0 _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.
520 _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.
650 0 _aEngineering.
650 0 _aArithmetic and logic units, Computer.
650 0 _aAlgebra.
650 0 _aField theory (Physics).
650 1 4 _aEngineering.
650 2 4 _aSignal, Image and Speech Processing.
650 2 4 _aField Theory and Polynomials.
650 2 4 _aArithmetic and Logic Structures.
710 2 _aSpringerLink (Online service)
773 0 _tSpringer eBooks
776 0 8 _iPrinted edition:
_z9783319017266
830 0 _aSignals and Communication Technology,
_x1860-4862
856 4 0 _uhttp://dx.doi.org/10.1007/978-3-319-01727-3
912 _aZDB-2-ENG
942 _cEBK
999 _c58536
_d58536