Sign Up to our social questions and Answers Engine to ask questions, answer people’s questions, and connect with other people.
Login to our social questions & Answers Engine to ask questions answer people’s questions & connect with other people.
Lost your password? Please enter your email address. You will receive a link and will create a new password via email.
Please briefly explain why you feel this question should be reported.
Please briefly explain why you feel this answer should be reported.
Please briefly explain why you feel this user should be reported.
I’d be very much interested hearing any tips on how
a simple algorithm can be implemented to overcome
lost packets of a binary stream.
I was considering doing something like
ABCDE,BCDEF,CDEFG,DEFGH,…..
or may be with 3 bytes instead of 5, i.e.
ABC,BCE,CDE,DEF,…
Though I’m not too sure of this.
I understand the basic principles behind
error correcting theory, but it doesn’t
help a lot .. any suggestions ?
I think I have found what I was looking for – it’s the Convolutional
Coding that need to use in this sort of application. It looks like
the most suitable coding technique for a low-power application.
For those who interested in updates on this, I’ll write more on my
project’s wiki
There is an article on Wikipedia whcih has a nice diagram.