Wow, my first version of the puzzle shipped the bits in pairs but I couldn't come up with a solution for that (I'm not very good at this game), so it had to be individual bits. I guess with the efficiency of your solution it would be relatively easy to split each packet of data to handle parity checks (that was the major problem with paired bits).

Thanks for playing my puzzle :)

After a little more optimization I was able to get it down to 18/1798/42 . I think that's the lowest reachable cost, at least in my limited imagination.

Nice puzzle. I was able to do 22/1997/37 or 21/2146/42 .