Back to Search
Start Over
On the List Decodability of Burst Errors.
- Source :
-
IEEE Transactions on Information Theory . Feb2016, Vol. 62 Issue 2, p695-702. 8p. - Publication Year :
- 2016
-
Abstract
- Burst errors are a type of distortion in many data communications and data storage channels. In this paper, we consider the list decodability of codes for single burst error case and phased-burst error case independently. Firstly, we analyze the list decodability of random codes, and we show that the burst list decoding radius and the rate of random codes achieve the Singleton bound and the Gilbert-Varshamov bound for single case and phased case, respectively. Second, we illustrate that cyclic codes and algebraic geometry codes are good burst list-decodable codes for single case and phased case, respectively. [ABSTRACT FROM AUTHOR]
Details
- Language :
- English
- ISSN :
- 00189448
- Volume :
- 62
- Issue :
- 2
- Database :
- Academic Search Index
- Journal :
- IEEE Transactions on Information Theory
- Publication Type :
- Academic Journal
- Accession number :
- 112441486
- Full Text :
- https://doi.org/10.1109/TIT.2015.2513046