Abstract
We study a class of graph based codes with Reed-Solomon component codes as affine variety codes. We give a formulation of the exact dimension of graph codes in general. We give an algebraic description of these codes which makes the exact computation of the dimension of the graph codes easier.
| Original language | English |
|---|---|
| Title of host publication | 2013 IEEE International Symposium on Information Theory Proceedings (ISIT) |
| Publisher | IEEE |
| Publication date | 2013 |
| Pages | 1227-1231 |
| ISBN (Print) | 978-1-4799-0446-4 |
| DOIs | |
| Publication status | Published - 2013 |
| Event | 2013 IEEE International Symposium on Information Theory - Istanbul, Turkey Duration: 7 Jul 2013 → 12 Jul 2013 http://www.isit2013.org/ |
Conference
| Conference | 2013 IEEE International Symposium on Information Theory |
|---|---|
| Country/Territory | Turkey |
| City | Istanbul |
| Period | 07/07/2013 → 12/07/2013 |
| Internet address |
Fingerprint
Dive into the research topics of 'On the Dimension of Graph Codes with Reed–Solomon Component Codes'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver