On the Many Faces of Block Codes

Authors:
Kaustubh Deshmukh;Priti Shankar;Amitava Dasgupta;B. Sundar Rajan
Affiliations:
-;-;-;-
Venue:
STACS '00 Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science
Year:
2000

Citing 4
Cited 1

An introduction to symbolic dynamics and coding

An introduction to symbolic dynamics and coding
On the BCJR trellis for linear block codes

IEEE Transactions on Information Theory
The trellis structure of maximal fixed-cost codes

IEEE Transactions on Information Theory - Part 1
Minimal tail-biting trellises: the Golay code and more

IEEE Transactions on Information Theory

A Package for the Implementation of Block Codes as Finite Automata

CIAA '00 Revised Papers from the 5th International Conference on Implementation and Application of Automata

Quantified Score

Hi-index	0.00

Visualization

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.