Cryptography and Coding '09 Proceedings of the 12th IMA International Conference on Cryptography and Coding
Algebraic codes for network coding
Problems of Information Transmission
Error correcting coding for a nonsymmetric ternary channel
IEEE Transactions on Information Theory
Hi-index | 754.90 |
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