Polynomial Theory of Error Correcting Codes

Nonfiction, Science & Nature, Mathematics, Algebra, Technology, Electronics
Cover of the book Polynomial Theory of Error Correcting Codes by Giovanni Cancellieri, Springer International Publishing
View on Amazon View on AbeBooks View on Kobo View on B.Depository View on eBay View on Walmart
Author: Giovanni Cancellieri ISBN: 9783319017273
Publisher: Springer International Publishing Publication: November 8, 2014
Imprint: Springer Language: English
Author: Giovanni Cancellieri
ISBN: 9783319017273
Publisher: Springer International Publishing
Publication: November 8, 2014
Imprint: Springer
Language: English

The 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.

View on Amazon View on AbeBooks View on Kobo View on B.Depository View on eBay View on Walmart

The 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.

More books from Springer International Publishing

Cover of the book Granular Computing Based Machine Learning by Giovanni Cancellieri
Cover of the book Machine Tool Metrology by Giovanni Cancellieri
Cover of the book Amyloid and Related Disorders by Giovanni Cancellieri
Cover of the book The Handbook of EEA Law by Giovanni Cancellieri
Cover of the book The Road to Universal Logic by Giovanni Cancellieri
Cover of the book The Italian General Election of 2018 by Giovanni Cancellieri
Cover of the book Technology Enhanced Assessment by Giovanni Cancellieri
Cover of the book Inflammatory Pathways in Diabetes by Giovanni Cancellieri
Cover of the book Modelling of Magmatic and Allied Processes by Giovanni Cancellieri
Cover of the book Connectomics in NeuroImaging by Giovanni Cancellieri
Cover of the book Lived Citizenship on the Edge of Society by Giovanni Cancellieri
Cover of the book Conceiving Nature after Aristotle, Kant, and Hegel by Giovanni Cancellieri
Cover of the book Exciton Transport Phenomena in GaAs Coupled Quantum Wells by Giovanni Cancellieri
Cover of the book Contemporary Masculinities by Giovanni Cancellieri
Cover of the book Big Data Analytics and Knowledge Discovery by Giovanni Cancellieri
We use our own "cookies" and third party cookies to improve services and to see statistical information. By using this website, you agree to our Privacy Policy