3 ms·
hmm not seeing it yet - this is very low bandwidth but fixed rate stuff, where the messages being broadcast also change from time to time. But I may not be unde
by ahubert 4y ago
hmm not seeing it yet - this is very low bandwidth but fixed rate stuff, where the messages being broadcast also change from time to time. But I may not be understanding fountain codes well enough - they sure seem interesting!
- addaon 4y agoSuppose you want to receive 100 bits, and you have have a 98% chance of receiving each bit. If the message is broadcast in a loop (and you know which bit you're listening to), chances are after one listen you'll be missing a couple of bits, but on a second listen you'll probably get those; so you'll usually take 200 bit-times to receive the message, with a likely range of 100 - 300, with higher values unlikely. (You can do better by not listening to the full message with the last missing bit; this saves you expected ~33 bit times.) With a fountain code, for some small N you have to receive (and identify) any 100+N bits... so for N = 10, say, you expect to take 112 bit times to receive the full message (100+N+misses), with an expected range of 110 - 115 bit times or so. So both the expected value and the deviation go down.