Abstract
Reed-Solomon (RS) codes are constructed over a finite field that have been widely employed in storage and communication systems. Many fast encoding/decoding algorithms such as fast Fourier transform (FFT) and modular approach are designed for RS codes to reduce the encoding/decoding complexity defined as the number of XORs involved in the encoding/decoding procedure. In this paper, we present the construction of RS codes over the cyclic polynomial ring F2[x] / (1 + x + ...+ x p-1) and show that our codes are maximum distance separable (MDS) codes. Moreover, we propose the FFT and modular approach over the ring that can be employed in our codes for encoding/decoding complexity reduction. We show that our codes have 17.9% encoding complexity reduction and 7.5% decoding complexity reduction compared with RS codes over finite field, for (n,k) = (2048, 1984). © 2024 IEEE.
| Original language | English |
|---|---|
| Title of host publication | 2024 IEEE International Symposium on Information Theory - Proceedings |
| Publisher | IEEE |
| Pages | 482-487 |
| ISBN (Electronic) | 979-8-3503-8284-6 |
| DOIs | |
| Publication status | Published - 2024 |
| Event | 2024 IEEE International Symposium on Information Theory (ISIT 2024) - Athenaeum Intercontinental Athens, Athens, Greece Duration: 7 Jul 2024 → 12 Jul 2024 https://2024.ieee-isit.org/home |
Publication series
| Name | IEEE International Symposium on Information Theory - Proceedings |
|---|---|
| ISSN (Print) | 2157-8095 |
Conference
| Conference | 2024 IEEE International Symposium on Information Theory (ISIT 2024) |
|---|---|
| Abbreviated title | IEEE ISIT 2024 |
| Place | Greece |
| City | Athens |
| Period | 7/07/24 → 12/07/24 |
| Internet address |