Timeline for Best upper bound on rate for q-ary codes
Current License: CC BY-SA 3.0
6 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| May 12, 2013 at 0:19 | answer | added | Yuichiro Fujiwara | timeline score: 9 | |
| Oct 30, 2012 at 11:33 | comment | added | Brazen | It is true that even in the binary case, the above bound is weaker than the Hamming bound for small $\delta$, but that can be rectified through the second MRRW bound whose existence I hinted at without going into details. You may be right that my question is less specific and more exploratory. I was initially surprised that the MRRW bound deteriorates so much for large q that it gets worse than the Singleton bound, and mainly wanted some affirmation of this. I'd be grateful if someone could direct me to useful references on comparisons of different bounds for large $q$. | |
| Oct 30, 2012 at 11:31 | comment | added | Brazen | @quid: Sorry, I asked the same questions there too. For a while, Overflow was disabled for maintenance and wasn't accepting new questions, hence I tried other available forums too. If thats wrong on my part, I apologize for it. | |
| Oct 30, 2012 at 10:28 | comment | added | user9072 | A superficial remark: "best bound" is a bit of an oversimplifiying notion, e.g., also for q=2 the bound you give is not "good" for very small delta; for example, the relatively simple to prove Hamming bound is better there. But then it seems suffieciently clear what you are looking for. | |
| Oct 30, 2012 at 10:21 | comment | added | user9072 | Also asked at math.stackexchange.com/questions/224933/… and at cstheory.stackexchange.com/questions/14121/… Personally I quite like the question, so I will not vote to close it here just over this, but still wanted to give the links for everybodies benefit. | |
| Oct 30, 2012 at 2:15 | history | asked | Brazen | CC BY-SA 3.0 |