Abstract
Improved geometric Goppa codes have a smaller redundancy and the same bound on the minimum distance as ordinary algebraic-geometry codes. For an asymptotically good sequence of function fields we give a formula for the redundancy.
Original language | English |
---|---|
Pages (from-to) | 2512-2519 |
Journal | IEEE Transactions on Information Theory |
Volume | 45 |
Issue number | 7 |
DOIs | |
Publication status | Published - 1999 |