On the Many Faces of Block Codes

  • Kaustubh Deshmukh
  • Priti Shankar
  • Amitava Dasgupta
  • B. Sundar Rajan
Conference paper

DOI: 10.1007/3-540-46541-3_4

Part of the Lecture Notes in Computer Science book series (LNCS, volume 1770)
Cite this paper as:
Deshmukh K., Shankar P., Dasgupta A., Rajan B.S. (2000) On the Many Faces of Block Codes. In: Reichel H., Tison S. (eds) STACS 2000. STACS 2000. Lecture Notes in Computer Science, vol 1770. Springer, Berlin, Heidelberg

Abstract

Block codes are first viewed as finite state automata represented as trellises. A technique termed subtrellis overlaying is introduced with the object of reducing decoder complexity. Necessary and sufficient conditions for subtrellis overlaying are next derived from the representation of the block code as a group, partitioned into a subgroup and its cosets. Finally a view of the code as a graph permits a combination of two shortest path algorithms to facilitate efficient decoding on an overlayed trellis.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2000

Authors and Affiliations

  • Kaustubh Deshmukh
    • 1
  • Priti Shankar
    • 2
  • Amitava Dasgupta
    • 2
  • B. Sundar Rajan
    • 3
  1. 1.Department of Computer Science and EngineeringIndian Institute of Technology BombayMumbaiIndia
  2. 2.Department of Computer Science and AutomationIndian Institute of ScienceBangaloreIndia
  3. 3.Department of Electrical Communication EngineeringIndian Institute of ScienceBangaloreIndia

Personalised recommendations