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 Cyber Security Intelligence and Analytics by Giovanni Cancellieri
Cover of the book Bone Metastases from Prostate Cancer by Giovanni Cancellieri
Cover of the book A Pluralist Theory of the Mind by Giovanni Cancellieri
Cover of the book CMOS Indoor Light Energy Harvesting System for Wireless Sensing Applications by Giovanni Cancellieri
Cover of the book Swarm Robotics: A Formal Approach by Giovanni Cancellieri
Cover of the book Glaciokarsts by Giovanni Cancellieri
Cover of the book Software Technologies: Applications and Foundations by Giovanni Cancellieri
Cover of the book Manipulation of Allelopathic Crops for Weed Control by Giovanni Cancellieri
Cover of the book Research in History and Philosophy of Mathematics by Giovanni Cancellieri
Cover of the book Governance Beyond the Law by Giovanni Cancellieri
Cover of the book Energy Law and Economics by Giovanni Cancellieri
Cover of the book Precarious Imaginaries of Beirut by Giovanni Cancellieri
Cover of the book Five Legal Revolutions Since the 17th Century by Giovanni Cancellieri
Cover of the book Codes, Ciphers and Spies by Giovanni Cancellieri
Cover of the book Raising of Microvascular Flaps 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