Abstract
We analyse the known decoding algorithms for algebraic geometry codes in the case where the number of errors is greater than or equal to [(dFR-1)/2]+1, where dFR is the Feng-Rao distance
Original language | English |
---|---|
Title of host publication | Information Theory, 1998. Proceedings. 1998 IEEE International Symposium on |
Number of pages | 378 |
Place of Publication | New York |
Publisher | IEEE |
Publication date | 1998 |
ISBN (Print) | 0-7803-5000-6 |
DOIs | |
Publication status | Published - 1998 |
Event | 1998 IEEE International Symposium on Information Theory - Cambridge, United States Duration: 16 Aug 1998 → 21 Aug 1998 https://ieeexplore.ieee.org/document/708983 |
Conference
Conference | 1998 IEEE International Symposium on Information Theory |
---|---|
Country/Territory | United States |
City | Cambridge |
Period | 16/08/1998 → 21/08/1998 |
Internet address |