yes and no. So typically low density parity codes (aka fountain codes) break up a 'chunk' into some number of data blocks and some number of code blocks. Depending on the number of code blocks (its a tradeoff between time and number of blocks) you get 'most' of the blocks back and you can reconstruct the data blocks.

Now you could code up a packet, break it up and then add code blocks, that works great for the packet, but if you don't get enough blocks from that set of blocks you have to resend the packet which is something you don't want to do.

So if instead you send say 3 data blocks and 2 code blocks and then start sending two data blocks and 1 code block and set it up (this is the part that would be impressive) so that the previous two code blocks and the current one could reconstruct the two datablocks you just sent. (re-using previously sent code blocks) My brain is wincing trying to imagine the kind of ECC code that would be, sort of like solving the ECC polynomials in two dimensions or something.

Any way, if you could do that, the outcome would be that you could continually send data and dropped packets would always be correctable by later packets received. I drew out a picture of what relationship the code blocks would need and its complicated. Say you did an 8x3 (8 data segments, 3 code segments, you send

    D01 D02 C01 D03 D04 C02 D05 D06 C03 D07 D08 
    C04 D09 D10 C05 D11 D12 C06 D13 D14 C07 D15

And you do the math such that over any 11 pieces of that you can recover the 8 data pieces. Including:

    D05 D06 C03 D07 D08 C04 D09 D10 C05 D11 D12

(see what I did there? Data segments from both parts and code blocks from both parts).

Anyway, that would be some nice math if its doable. And really game changing, it would mean you would get less bandwidth in a situation where there was no packet loss (you're injecting ECC data). But it also makes me wonder if you don't just fix the underlying wireless protocol to do this with the frames sent, why does it have to be at the TCP level?