Improved List Size for Folded Reed-Solomon Codes
Fuente:
arXiv
Saved in:
| Main Author: | |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866917800890597376 |
|---|---|
| author | Srivastava, Shashank |
| author_facet | Srivastava, Shashank |
| contents | Folded Reed-Solomon (FRS) codes are variants of Reed-Solomon codes, known for their optimal list decoding radius. We show explicit FRS codes with rate $R$ that can be list decoded up to radius $1-R-ε$ with lists of size $\mathcal{O}(1/ ε^2)$. This improves the best known list size among explicit list decoding capacity achieving codes.
We also show a more general result that for any $k\geq 1$, there are explicit FRS codes with rate $R$ and distance $1-R$ that can be list decoded arbitrarily close to radius $\frac{k}{k+1}(1-R)$ with lists of size $(k-1)^2+1$.
Our results are based on a new and simple combinatorial viewpoint of the intersections between Hamming balls and affine subspaces that recovers previously known parameters. We then use folded Wronskian determinants to carry out an inductive proof that yields sharper bounds. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2410_09031 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Improved List Size for Folded Reed-Solomon Codes Srivastava, Shashank Information Theory Computational Complexity Folded Reed-Solomon (FRS) codes are variants of Reed-Solomon codes, known for their optimal list decoding radius. We show explicit FRS codes with rate $R$ that can be list decoded up to radius $1-R-ε$ with lists of size $\mathcal{O}(1/ ε^2)$. This improves the best known list size among explicit list decoding capacity achieving codes. We also show a more general result that for any $k\geq 1$, there are explicit FRS codes with rate $R$ and distance $1-R$ that can be list decoded arbitrarily close to radius $\frac{k}{k+1}(1-R)$ with lists of size $(k-1)^2+1$. Our results are based on a new and simple combinatorial viewpoint of the intersections between Hamming balls and affine subspaces that recovers previously known parameters. We then use folded Wronskian determinants to carry out an inductive proof that yields sharper bounds. |
| title | Improved List Size for Folded Reed-Solomon Codes |
| topic | Information Theory Computational Complexity |
| url | https://arxiv.org/abs/2410.09031 |