Timeline for Binary codes with large distance
Current License: CC BY-SA 2.5
3 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| May 20, 2015 at 7:17 | comment | added | kodlu | Moreover, if $\delta<1/2$ then the OP's stated requirement is not satisfied. As for Hadamard codes, their size is $M=\log_2(n)$ which is not large at all, but logarithmic in the length. | |
| May 20, 2015 at 7:03 | comment | added | kodlu | When $\delta=1/2,$ the $\gamma$ in the answer is zero. | |
| Jan 31, 2010 at 14:49 | history | answered | David Benson-Putnins | CC BY-SA 2.5 |