The following pages link to (Q4063326):
Displaying 18 items.
- Improved linear programming bound on sizes of doubly constant-weight codes (Q1800703) (← links)
- On the number of edges of a uniform hypergraph with a range of allowed intersections (Q2190888) (← links)
- Traceability codes and their generalizations (Q2190905) (← links)
- On the number of edges in a uniform hypergraph with a range of permitted intersections (Q2411798) (← links)
- Eigenvalue bounds on the pseudocodeword weight of expander codes (Q2470810) (← links)
- Upper bounds for constant weight error correcting codes (Q2556310) (← links)
- Upper bounds for constant-weight codes (Q2705972) (← links)
- (Q3115648) (← links)
- (Q4369854) (← links)
- Simple, Robust and Optimal Ranking from Pairwise Comparisons (Q4558526) (← links)
- Improved upper bounds on sizes of codes (Q4674469) (← links)
- (Q5159440) (← links)
- (Q5193015) (← links)
- A Bound for the Maximum Weight of a Linear Code (Q5300513) (← links)
- An upper bound for binary constant weight codes (Q5934172) (← links)
- Upper bounds on weight hierarchies of extremal non-chain codes (Q5951954) (← links)
- On the optimum of Delsarte's linear program (Q5953375) (← links)
- On the Construction of Multiply Constant-Weight Codes (Q6169905) (← links)