Pages that link to "Item:Q3547075"
From MaRDI portal
The following pages link to Asymptotic Improvement of the Gilbert–Varshamov Bound on the Size of Binary Codes (Q3547075):
Displaying 15 items.
- Proof of a conjecture of Kløve on permutation codes under the Chebychev distance (Q521871) (← links)
- Ramsey numbers of some bipartite graphs versus complete graphs (Q659665) (← links)
- On kissing numbers and spherical codes in high dimensions (Q1669035) (← links)
- The clique distribution in powers of hypercubes (Q2235258) (← links)
- New theoretical bounds and constructions of permutation codes under block permutation metric (Q2329402) (← links)
- Long Nonbinary Codes Exceeding the Gilbert–Varshamov Bound for any FixedDistance (Q3547854) (← links)
- An improvement of the Gilbert bound for constant weight codes (Corresp.) (Q3775475) (← links)
- Simple, Robust and Optimal Ranking from Pairwise Comparisons (Q4558526) (← links)
- ON THE HARD SPHERE MODEL AND SPHERE PACKINGS IN HIGH DIMENSIONS (Q4610443) (← links)
- Improved upper bounds on sizes of codes (Q4674469) (← links)
- (Q5054582) (← links)
- Construction of several classes of maximum codes (Q5063292) (← links)
- Singleton-type bounds for list-decoding and list-recovery, and related results (Q6187335) (← links)
- Balanced reconstruction codes for single edits (Q6564093) (← links)
- Subspace coverings with multiplicities (Q6632776) (← links)