Timeline for Best upper bound on rate for q-ary codes
Current License: CC BY-SA 3.0
4 events
when toggle format | what | by | license | comment | |
---|---|---|---|---|---|
Jun 9, 2019 at 4:53 | comment | added | Yuichiro Fujiwara | @Brout Most likely he meant the second MRRW bound, which works only for $q = 2$ but is slightly better when $\delta$ is small; roughly speaking, it beats the first MRRW bound for $\delta < 0.272$ and the two bounds agree for $0.273 \leq \delta \leq 0.5$. I think popular textbooks that mention the first MRRW bound would at least talk about the second MRRW bound. See, for example, the following open access textbook: doi.org/10.1007/978-3-319-51103-0 | |
Jun 7, 2019 at 12:53 | comment | added | Turbo | @YuichiroFujiware Do you know what he means by 'A slight improvement of the above exists in the binary case, but within the same framework'? | |
May 12, 2013 at 0:31 | comment | added | user9072 | That's nice; I was always looking forward to an answer to this question. | |
May 12, 2013 at 0:19 | history | answered | Yuichiro Fujiwara | CC BY-SA 3.0 |