A fast parallel decoding algorithm for general one-point AG codes with a systolic array architecture
We propose a fast parallel decoding algorithm for general one-point algebraic geometric (1-pt AG) codes with a systolic array architecture (SAA). This algorithm is able to correct up to half the Feng-Rao (see IEEE Trans. IT, vo1.39, no.1, p.37-45, 1993) bound and the time complexity is O(n) by using...
Saved in:
| Published in: | Proceedings 1995 IEEE International Symposium on Information Theory p. 99 |
|---|---|
| Main Authors: | , |
| Format: | Conference Proceeding |
| Language: | English |
| Published: |
IEEE
1995
|
| Subjects: | |
| ISBN: | 0780324536, 9780780324534 |
| Online Access: | Get full text |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Be the first to leave a comment!

