Polynomial Theory of Error Correcting Codes

  • Giovanni┬áCancellieri

Part of the Signals and Communication Technology book series (SCT)

Table of contents

  1. Front Matter
    Pages i-xviii
  2. Generator Matrix

  3. Parity Check Matrix

  4. Modern Coding

    1. Front Matter
      Pages 471-471
    2. Giovanni Cancellieri
      Pages 473-502
    3. Giovanni Cancellieri
      Pages 503-543
    4. Giovanni Cancellieri
      Pages 545-580
    5. Giovanni Cancellieri
      Pages 581-622
  5. Back Matter
    Pages 623-732

About this book


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.


Digital Communications Digital Error Control Error Correcting Codes Generator Matrix Parity Check Matrix Reliable Data Transmission

Authors and affiliations

  • Giovanni┬áCancellieri
    • 1
  1. 1.Information EngineeringPolytechnic University of MarcheAnconaItaly

Bibliographic information

  • DOI
  • Copyright Information Springer International Publishing Switzerland 2015
  • Publisher Name Springer, Cham
  • eBook Packages Engineering Engineering (R0)
  • Print ISBN 978-3-319-01726-6
  • Online ISBN 978-3-319-01727-3
  • Series Print ISSN 1860-4862
  • Series Online ISSN 1860-4870
  • Buy this book on publisher's site