Lengthening and the Gilbert-Varshamov bound
Document Type
Article
Publication Date
12-1-1997
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 databases. © 1997 IEEE.
Publication Title
IEEE Transactions on Information Theory
Recommended Citation
Edel, Y.,
&
Bierbrauer, J.
(1997).
Lengthening and the Gilbert-Varshamov bound.
IEEE Transactions on Information Theory,
43(3), 991-992.
http://doi.org/10.1109/18.568708
Retrieved from: https://digitalcommons.mtu.edu/michigantech-p/10206
COinS