Deshmukh, Kaustubh and Shankar, Priti and Dasgupta, Amitava and Rajan, Sundar B (2000) On the Many Faces of Block Codes. In: STACS 2000: 17th Annual Symposium on Theoretical Aspects of Computer Science, February 2000, France, pp. 53-64.
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.
|Item Type:||Conference Paper|
|Additional Information:||Copyright of this article belongs to Springer Verlag.|
|Department/Centre:||Division of Electrical Sciences > Electrical Communication Engineering
Division of Electrical Sciences > Computer Science & Automation (Formerly, School of Automation)
|Date Deposited:||01 Oct 2004|
|Last Modified:||19 Sep 2010 04:16|
Actions (login required)