> If peeling fails, R10 falls back to solving the system of equations using Gaussian elimination. I've built a decoder for online codes (very similar) in the p

> If peeling fails, R10 falls back to solving the system of equations using Gaussian elimination. I've built a decoder for online codes (very similar) in the past and learned that it's best to just to a Gauss elimination step regardless of the degree of equation/packet/message you get. Also, since the system is very sparse it's best to not have a matrix representation, even if you're using bitvectors, as you'll be scanning rows which have mostly zeros. Just use a representation for sparse sets. Anyway, just my 2cts