Abstract
This paper discusses the construction of binary linear Golay [160, 80] (mn,mk) codes from an extended Reed Solomon [32, 16] (n, k) code over F/sub 32/ (F/sub 2//sup m/) by concatenating the given code with a suitable basis symmetric representation of Frobenius automorphism F/sub 32/ over F/sub 2/ with a minimum distance 24.
| Original language | English |
|---|---|
| Title of host publication | 2003 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY - PROCEEDINGS |
| Publisher | IEEE |
| Pages | 162-162 |
| Number of pages | 1 |
| ISBN (Print) | 0-7803-7728-1 |
| DOIs | |
| Publication status | Published - 2003 |
| MoE publication type | A4 Conference publication |
| Event | IEEE International Symposium on Information Theory - Yokohama, Japan Duration: 29 Jun 2003 → 4 Jul 2003 |
Conference
| Conference | IEEE International Symposium on Information Theory |
|---|---|
| Country/Territory | Japan |
| City | Yokohama |
| Period | 29/06/2003 → 04/07/2003 |
Fingerprint
Dive into the research topics of 'On binary linear [160,80,24] codes'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver