Get all the updates for this publication
Conferences
Open Access
On the treewidth of MDS and Reed-Muller codesOpen AccessPublished in
2011
Pages: 1925 - 1929
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. © 2011 IEEE.
Topics: Linear code (65)%65% related to the paper, Reed–Muller code (64)%64% related to the paper, Block code (63)%63% related to the paper, Expander code (61)%61% related to the paper and Concatenated error correction code (59)%59% related to the paper
View more info for "On the treewidth of MDS and Reed-Muller codes"
Preprint Version
Content may be subject to copyright.This is a green open access articleThis is a green open access article
Related Papers (3)
ConferencesQuantum codes and symplectic matroids2014 | Institute of Electrical and Electronics Engineers Inc.Open Access
About the journal
| Journal | IEEE International Symposium on Information Theory - Proceedings |
|---|---|
| ISSN | 21578104 |
| Open Access | Yes |
Authors (1)
Concepts (13)
ALGEBRAIC CODES- Explicit expressions
- LEAST CONSTRAINT
- Linear codes
- MAXIMUM DISTANCE SEPARABLE CODE
- MAXIMUM-LIKELIHOOD DECODING
- Parametrizations
- Reed-muller codes
- Second orders
- Tree-width
- Information theory
- Maximum likelihood
- Constraint theory
