Are fountain code and online code the same? It seems to me they have the same property, which is used in lossy channel and generate unlimited encoded block.
If they are the same, then what encoding technique are they using? I ask this because I don't see how a matrix with only entries $0$ and $1$ can generate unlimited encoded blocks. If possible, can someone give me an example of such a matrix?
Remark: In the online code's paper, it stated that the degree of a check block (encoded block). Can anyone explain to me how to choose such degree? I don't understand what is stated in the paper.