Although this site was up over 25 years it now soon will be shut down due to administrative reasons.
It will be further available on my new home page www.yvesedel.de

Lengthening and the Gilbert-Varshamov bound

coauthor Jürgen Bierbrauer

IEEE Transactions on Information Theory 43 (1997), 991-992.

doi:10.1109/18.568708

Abstract:

We use lengthening and an enhanced version of the Gilbert-Varshamov lower bound for linear codes to construct a large number of record-breaking codes. Our main theorem may be seen as a closure operation on data bases.

Download the preprint as pdf.

| home | List of publications |