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

On the treewidth of MDS and Reed-Muller codes

Kashyap, Navin and Thangaraj, Andrew E (2011) On the treewidth of MDS and Reed-Muller codes. In: 2011 IEEE International Symposium on Information Theory Proceedings (ISIT), July 31 2011-Aug. 5 2011, St. Petersburg, Russia.

[img] PDF
Inf_The_Proc_1925_2011.pdf - Published Version
Restricted to Registered users only

Download (318kB) | Request a copy
Official URL: http://dx.doi.org/0.1109/ISIT.2011.6033887


The treewidth of a linear code is the least constraint complexity of any of its cycle-free graphical realizations. This notion provides a useful parametrization of the maximum-likelihood decoding complexity for linear codes. In this paper, we compute exact expressions for the treewidth of maximum distance separable codes, and first- and second-order Reed-Muller codes. These results constitute the only known explicit expressions for the treewidth of algebraic codes.

Item Type: Conference Paper
Publisher: IEEE
Additional Information: Copyright of this article belongs to IEEE.
Department/Centre: Division of Electrical Sciences > Electrical Communication Engineering
Date Deposited: 01 Apr 2013 07:32
Last Modified: 01 Apr 2013 07:32
URI: http://eprints.iisc.ac.in/id/eprint/46138

Actions (login required)

View Item View Item