Timeline for Concatenated Deletion & Sticky Channel Capacity
Current License: CC BY-SA 4.0
21 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Dec 31, 2018 at 12:12 | history | edited | Olli Niemitalo |
+tags
|
|
| S Dec 31, 2018 at 11:56 | history | bounty ended | William Hird | ||
| S Dec 31, 2018 at 11:56 | history | notice removed | William Hird | ||
| Dec 31, 2018 at 11:56 | vote | accept | William Hird | ||
| Dec 30, 2018 at 23:37 | answer | added | Olli Niemitalo | timeline score: 2 | |
| Dec 27, 2018 at 18:22 | comment | added | William Hird | @PeterK.; Acknowledged. | |
| Dec 27, 2018 at 18:18 | comment | added | Peter K.♦ | @WilliamHird Let me know if you want it migrated. | |
| S Dec 27, 2018 at 14:51 | history | bounty started | William Hird | ||
| S Dec 27, 2018 at 14:51 | history | notice added | William Hird | Authoritative reference needed | |
| Dec 27, 2018 at 0:50 | comment | added | William Hird | Maybe I should migrate the question to the Theoretical Computer Science site seeing how the question leans more towards theoretical aspects of communication theory than the engineering side . Any suggestions will be helpful . | |
| Dec 26, 2018 at 18:46 | comment | added | William Hird | " Channeling" Dilip Sarwate, Dilip, we need your help with this one, LOL ! | |
| Dec 26, 2018 at 18:46 | comment | added | Marcus Müller | bad news: somebody knows, and whoever that is did the math :) you probably have to do that, too :) But, having slept over that: After every "stick", you get an error rate of 0.5; until a deletion happens. Same happens for deletions if there's no prior stick. Your problem probably reduces to the question of "how long is the average distance between deletion and sticking"; 0.5 for both probabilities suggests you either get 0 capacity, or ¼, or 1/2 or something easy, but I'd really guess you just need space and a piece of paper, a pencil and a decision tree sketch to find a solution. | |
| Dec 26, 2018 at 18:22 | comment | added | William Hird | OK, I like the new title ! But what is the answer to my original question, what is the capacity. If this is an open problem in information theory just say "nobody knows", and I can go back to sleep :-) | |
| Dec 26, 2018 at 17:03 | history | edited | William Hird | CC BY-SA 4.0 |
added 390 characters in body
|
| Dec 26, 2018 at 10:43 | comment | added | Marcus Müller | by the way, I changed your title: The channel you're describing isn't noisy. | |
| Dec 26, 2018 at 10:42 | history | edited | Marcus Müller | CC BY-SA 4.0 |
edited title
|
| Dec 26, 2018 at 10:35 | comment | added | Marcus Müller | no, it doesn't mean that. | |
| Dec 26, 2018 at 0:40 | comment | added | William Hird | @MarcusMüller; So if it yields an infinite tree does that mean that the channel capacity is zero ? Thanks for replying and Merry Christmas too ! | |
| Dec 25, 2018 at 21:04 | comment | added | Marcus Müller | puuuuuh. I'd start with actually drawing kind of a decision tree that starts with "bit 0 is sent", "deleted || not deleted", "sticks || doesn't stick", and then simply sums up all the probabilities of branches that lead to correct transmissions (e.g. if a bit is deleted, but it's the same bit as the bit sent before, and that bit sticks, then you've got no error at all...). This will yield an infinite tree, but you might be able to see a way to note down that sum. | |
| Dec 25, 2018 at 12:09 | history | edited | William Hird | CC BY-SA 4.0 |
added 4 characters in body
|
| Dec 25, 2018 at 12:00 | history | asked | William Hird | CC BY-SA 4.0 |