The generalized Gilbert-Varshamov bound is implied by Turan's theorem [code construction]

DOI10.1109/18.623158zbMath0888.94026OpenAlexW2098922615MaRDI QIDQ4371903

L. M. G. M. Tolhuizen

Publication date: 2 April 1998

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/18.623158

zbMATH Keywords

graphcliqueGilbert-Varshamov boundTurán's theoremrunlength constraints

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Bounds on codes (94B65)

Related Items (4)

Fixed Points of Boolean Networks, Guessing Graphs, and Coding Theory ⋮ The clique distribution in powers of hypercubes ⋮ Algebraic codes for network coding ⋮ Bounds on Subspace Codes Based on Orthogonal Space Over Finite Fields of Characteristic 2

This page was built for publication: The generalized Gilbert-Varshamov bound is implied by Turan's theorem [code construction]