On the treewidth of MDS and Reed-Muller codes
| Data(s) |
2011
|
|---|---|
| Resumo |
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. |
| Formato |
application/pdf |
| Identificador |
http://eprints.iisc.ernet.in/46138/1/Inf_The_Proc_1925_2011.pdf 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. |
| Publicador |
IEEE |
| Relação |
http://dx.doi.org/0.1109/ISIT.2011.6033887 http://eprints.iisc.ernet.in/46138/ |
| Palavras-Chave | #Electrical Communication Engineering |
| Tipo |
Conference Paper PeerReviewed |
