Linear Binary Block Codes and their needed Check Symbols
There theoretical limits (such as the hamming limit), but another question is which codes can actually be constructed. It is like putting spheres in a box ... This diagram shows the constructable codes, which are linear and binary. The x-axis shows the number of protected symbols k, the y-axis the number of needed check symbols n-k. Plotted are the limits for different Hamming distances from 1 (unprotected) to 34. Marked with dots are perfect codes:
- light orange: trivial unprotected codes
- orange: trivial repeat codes
- dark orange: classic perfect hamming codes
- red: the only perfect binary Golay code
Relevante Bilder
Relevante Artikel
BlockcodeBlockcodes sind eine Art der Kanalkodierung der Familie der fehlerkorrigierenden Codes. Sie zeichnen sich durch eine feste Blockgröße aus Symbolen eines festen Alphabets aus. Einzelne Blocks werden im Gegensatz zu Faltungscodes unabhängig voneinander kodiert und dekodiert. .. weiterlesen