On the many faces of block codes
DSpace at IIT Bombay
View Archive InfoField | Value | |
Title |
On the many faces of block codes
|
|
Creator |
DESHMUKH, K
SHANKAR, P DASGUPTA, A RAJAN, BS |
|
Subject |
trellis structure
|
|
Description |
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.
|
|
Publisher |
SPRINGER-VERLAG BERLIN
|
|
Date |
2011-10-23T13:06:28Z
2011-12-15T09:11:10Z 2011-10-23T13:06:28Z 2011-12-15T09:11:10Z 2000 |
|
Type |
Article; Proceedings Paper
|
|
Identifier |
STACS 2000: 17TH ANNUAL SYMPOSIUM ON THEORETICAL ASPECT OF COMPUTER SCIENCE,1770,53-64
3-540-67141-2 0302-9743 http://dspace.library.iitb.ac.in/xmlui/handle/10054/15137 http://hdl.handle.net/100/1892 |
|
Source |
17th Annual Symposium on Theoretical Aspects of Computer Science,LILLE, FRANCE,FEB 17-19, 2000
|
|
Language |
English
|
|