IEEE Transactions on Information Theory 43 (1997), 991-992.
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 |