Timeline for Average minimum number of random k-sparse vectors in $\mathbb{F}_2^n$ to span a specific base vector?
Current License: CC BY-SA 3.0
10 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Apr 13, 2017 at 12:58 | history | edited | CommunityBot |
replaced http://mathoverflow.net/ with https://mathoverflow.net/
|
|
| Jul 20, 2016 at 0:09 | history | edited | mhsnk | CC BY-SA 3.0 |
edited title
|
| S Jul 18, 2016 at 23:08 | history | bounty ended | CommunityBot | ||
| S Jul 18, 2016 at 23:08 | history | notice removed | CommunityBot | ||
| Jul 11, 2016 at 1:55 | history | edited | mhsnk | CC BY-SA 3.0 |
changed $m$ to $\mathbb{E}[m]$
|
| Jul 10, 2016 at 22:19 | comment | added | mhsnk | There is a typo above. I am hoping to find the minimizing choice of $k$ as a function of $n$ and not $m$. | |
| S Jul 10, 2016 at 21:43 | history | bounty started | mhsnk | ||
| S Jul 10, 2016 at 21:43 | history | notice added | mhsnk | Draw attention | |
| Jul 5, 2016 at 21:36 | history | edited | mhsnk | CC BY-SA 3.0 |
changed the wording a bit
|
| Jul 5, 2016 at 21:31 | history | asked | mhsnk | CC BY-SA 3.0 |