000			03318nam a22003375i 4500
001			104052
003			DE-He213
005			20230102113157.0
007			cr nn 008mamaa
008			141108s2015 gw | s |||| 0|eng d
020			_a9783319017273
024	7		_a10.1007/978-3-319-01727-3 _2doi
040			_aES-MaUEC _bspa _cES-MaUEC
050		4	_aTK5102.96 2015 EB
100	1		_aCancellieri, Giovanni _eautor _9669755
245	1	0	_aPolynomial Theory of Error Correcting Codes _cby Giovanni Cancellieri.
264		1	_aCham _bSpringer International Publishing _c2015
300			_a1 recurso en línea (XVIII, 732 páginas 320 ilustraciones)
490	0		_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	3		_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		7	_aCódigos correctores de errores (Teoría de la información) _2embne _9147136
650		7	_aPolinomios _2embne _9669509
776	0	8	_iEdición impresa: _z9783319017266
776	0	8	_iEdición impresa: _z9783319017280
776	0	8	_iEdición impresa: _z9783319378701
856	4	0	_uhttps://go.openathens.net/redirector/universidadeuropea.es?url=https://doi.org/10.1007/978-3-319-01727-3 _zAcceso a este recurso digital (usuarios Universidad Europea de Madrid)
490	0		_aEngineering (Springer-11647)
988			_aEBSPRINGER_2018
998			_b06/2019 _dz _ek _feng _ggw _h0
999			_c104052 _d104052 _x1