Title :
The generalized Gilbert-Varshamov bound is implied by Turan´s theorem [code construction]
Author :
Tolhuizen, Ludo M G M
Author_Institution :
Philips Res. Lab., Eindhoven, Netherlands
fDate :
9/1/1997 12:00:00 AM
Abstract :
The generalization of the Gilbert-Varshamov bound due to Gu and Fuja (1993) is a direct consequence of Turan´s theorem on the existence of a clique in a graph with many edges. Turan´s theorem allows a slight improvement of Gu and Fuja´s result. This improved generalized Gilbert-Varshamov bound is in fact equivalent to Turan´s theorem
Keywords :
codes; graph theory; Turan´s theorem; code construction; edges; generalized Gilbert-Varshamov bound; graph theory; Algorithm design and analysis; Constraint theory; Error correction codes; Graph theory; Hamming distance;
Journal_Title :
Information Theory, IEEE Transactions on
