Combinatorial Representations of Block Codes

Shankar, Priti (2007) Combinatorial Representations of Block Codes. In: International Conference on Advances in Interdisciplinary Statistics and Combinatorics, October 12{14, 2007, University of North Carolina at Greensboro, Greensboro, North Carolina, USA, October 12-14, 2007, Greensboro, North Carolina.

PDF COMBINA.pdf - Published Version Restricted to Registered users only Download (55kB) | Request a copy

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. Trellis sizes for linear block codes are known to grow exponentially with the code parameters. 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 conventional trellis for the same code . We derive some interesting properties of tail-biting trellises and present a new decoding algorithm.

Item Type:	Conference Paper
Publisher:	Atlas Conferences Inc.
Additional Information:	Copyright of this article belongs to Atlas Conferences Inc.
Department/Centre:	Division of Electrical Sciences > Computer Science & Automation
Date Deposited:	17 Oct 2011 10:21
Last Modified:	17 Oct 2011 10:21
URI:	http://eprints.iisc.ac.in/id/eprint/41492

Actions (login required)

View Item