Fun fact, Golay codes are the only perfect code outside of Hamming codes. Perfect codes are interesting in that the Hamming bound becomes an equality, effectively saying that the distance between all valid codewords is exactly the minimum distance "d".

Indeed, Hamming and Golay codes are an absolute thing of beauty. For folks that wanna read more about Hamming Bound, Kevin Boone does a good job in starting from the basics and explaining the intuition behind the proof:

https://kevinboone.me/hamming_bound.html?i=1

Another fun fact, you could use one of the Roman dodecahedrons mentioned in another of today's articles to encode or decode Golay codes by hand...