Samenvatting
An explicit construction of a sequence of binary codes that asymptotically meet the Zyablov bound for rates lower than 0.30 is given by using Justesen's construction of concatenation. The outer codes are constructed from generalized Hermitian curves. These outer codes can be described without any algebraic geometry terminology, while the proofs of some properties deeply rely on algebraic geometry.
Originele taal-2 | Engels |
---|---|
Pagina's (van-tot) | 239-241 |
Tijdschrift | IEEE Transactions on Information Theory |
Volume | 39 |
Nummer van het tijdschrift | 1 |
DOI's | |
Status | Gepubliceerd - 1993 |