Coding theory: Difference between revisions

Content deleted Content added
Tags: Mobile edit Mobile web edit
No edit summary
Line 130:
# [[Reed–Muller code]]s
# [[Hamming bound|Perfect codes]]
# [[Locally Recoverablerecoverable Codescode]]
 
Block codes are tied to the [[sphere packing]] problem, which has received some attention over the years. In two dimensions, it is easy to visualize. Take a bunch of pennies flat on the table and push them together. The result is a hexagon pattern like a bee's nest. But block codes rely on more dimensions which cannot easily be visualized. The powerful (24,12) [[Binary Golay code|Golay code]] used in deep space communications uses 24 dimensions. If used as a binary code (which it usually is) the dimensions refer to the length of the codeword as defined above.