Hamming Codes https://en.wikipedia.org/wiki/Hamming_code https://www.youtube.com/watch?v=X8jsijhllIA The project first generates 11 random bits and stores them using hamming codes. One random bit in stored data is flipped. Then the error is corrected and the data is read. I removed the first bit, so the list is actually 0 indexed ;) packet size - how many bits can be stored (including the first bit). Can be set to any power of 2 check size - how many bits are needed to correct one error data size - the remaining bits that can store the actual data Sprite1: error - index of the error I use this here: https://scratch.mit.edu/projects/1035673355/
