Polynomial Theory of Error Correcting Codes - Giovanni Cancellieri

Polynomial Theory of Error Correcting Codes

Buch | Hardcover
XVIII, 732 Seiten
2014 | 2015
Springer International Publishing (Verlag)
978-3-319-01726-6 (ISBN)
160,49 inkl. MwSt
Numerous examples and indexed definitions make this detailed guide to polynomial theory in error-correcting codes a highly accessible resource. New codes and a unitary approach to block and convolutional codes will enhance readers' understanding of the topic.

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.

Giovanni Cancellieri is full professor of Telecommunications at Polytechnic University of Marche, Italy. His main research activities relate to optical communications, multimedia services, networks, mobile communications, and channel coding. He is a member of various worldwide and European technical associations and standardization bodies.

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

"This well-written book offers a structural and comprehensive view of the polynomial theory of many classes of error correcting codes to a general reader. In particular, nearly 500 examples and many nice figures are very helpful." (Qiang and Wang, zbMATH 1401.94004, 2019)


"The unified approach of polynomials makes this book quite interesting. It will be quite useful for researchers and engineers working in the field. It can also be used as supplementary material for an advanced undergraduate course or a graduate-level course in coding theory. ... the book is good reading. I enjoyed it and I strongly recommend it to any coding theorists." (Manish Gupta, Computing Reviews, August, 2015)

Erscheint lt. Verlag 20.11.2014
Reihe/Serie Signals and Communication Technology
Zusatzinfo XVIII, 732 p. 320 illus.
Verlagsort Cham
Sprache englisch
Maße 155 x 235 mm
Gewicht 1286 g
Themenwelt Informatik Theorie / Studium Algorithmen
Mathematik / Informatik Mathematik Algebra
Technik Elektrotechnik / Energietechnik
Schlagworte Digital Communications • Digital Error Control • Error Correcting Codes • Generator Matrix • Parity Check Matrix • Reliable Data Transmission
ISBN-10 3-319-01726-8 / 3319017268
ISBN-13 978-3-319-01726-6 / 9783319017266
Zustand Neuware
Haben Sie eine Frage zum Produkt?
Mehr entdecken
aus dem Bereich