Search Results
| Search type | Search syntax |
|---|---|
| Tags | [tag] |
| Exact | "words here" |
| Author |
user:1234 user:me (yours) |
| Score |
score:3 (3+) score:0 (none) |
| Answers |
answers:3 (3+) answers:0 (none) isaccepted:yes hasaccepted:no inquestion:1234 |
| Views | views:250 |
| Code | code:"if (foo != bar)" |
| Sections |
title:apples body:"apples oranges" |
| URL | url:"*.example.com" |
| Saves | in:saves |
| Status |
closed:yes duplicate:no migrated:no wiki:no |
| Types |
is:question is:answer |
| Exclude |
-[tag] -apples |
| For more details on advanced search visit our help page | |
Results tagged with probabilistic-method
Search options answers only
not deleted
user 14830
Probabilistic methods prove existence results in a nonconstructive fashion, by showing the chance of randomly selecting a solution is greater than zero.
4
votes
Accepted
Existence of (near) equidistant codewords
$\beta$ cannot be too much larger than $1/2$;
namely we must have $\beta \leq k/(2k-2)$.
To prove this, identify the $x_i$ with vectors $v_i \in {\bf R}^n$
each of whose coordinates is $1$ or $-1$,
an …
- 79.9k