Asymptotic Improvement of the Gilbert–Varshamov Bound on the Size of Binary Codes
From MaRDI portal
Publication:3547075
DOI10.1109/TIT.2004.831751zbMath1298.94151arXivmath/0404325MaRDI QIDQ3547075
Publication date: 21 December 2008
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/math/0404325
Related Items (10)
Construction of several classes of maximum codes ⋮ On kissing numbers and spherical codes in high dimensions ⋮ Singleton-type bounds for list-decoding and list-recovery, and related results ⋮ ON THE HARD SPHERE MODEL AND SPHERE PACKINGS IN HIGH DIMENSIONS ⋮ Ramsey numbers of some bipartite graphs versus complete graphs ⋮ The clique distribution in powers of hypercubes ⋮ Unnamed Item ⋮ Proof of a conjecture of Kløve on permutation codes under the Chebychev distance ⋮ Simple, Robust and Optimal Ranking from Pairwise Comparisons ⋮ New theoretical bounds and constructions of permutation codes under block permutation metric
This page was built for publication: Asymptotic Improvement of the Gilbert–Varshamov Bound on the Size of Binary Codes
