ePrints@IIScePrints@IISc Home | About | Browse | Latest Additions | Advanced Search | Contact | Help

Codes and decoding on graphs

Priti, Shankar (2003) Codes and decoding on graphs. In: Current Science, 85 (7). pp. 980-988.

[img]
Preview
PDF
Codes.pdf

Download (123Kb)

Abstract

We look at graphical descriptions of block codes known as trellises, which illustrate connections between algebra and graph theory, and can be used to develop powerful decoding algorithms. Trellises for linear block codes are known to grow exponentially with the code parameters and hence decoding on such objects is often infeasible. Of considerable interest to coding theorists therefore, are more compact descriptions called tail-biting trellises which in some cases can be much smaller than any ordinary trellis for the same code. We derive some interesting properties of tail-biting trellises and present an optimal maximum-likelihood decoding algorithm that performs rather well in terms of decoding complexity even at low signal-to-noise ratios.

Item Type: Journal Article
Additional Information: Copyright of this article belongs to Indian Academy of Sciences.
Department/Centre: Division of Electrical Sciences > Computer Science & Automation (Formerly, School of Automation)
Date Deposited: 20 Apr 2007
Last Modified: 19 Sep 2010 04:37
URI: http://eprints.iisc.ernet.in/id/eprint/10681

Actions (login required)

View Item View Item