File:Linear Binary Block Codes and their needed Check Symbols.png
Summary
| Description |
English: Linear Binary Block Codes.
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:
|
| Date | |
| Source | Own work |
| Author | Frank Klemm |
Licensing
I, the copyright holder of this work, hereby publish it under the following license:
This file is licensed under the Creative Commons Attribution-Share Alike 4.0 International license.
- You are free:
- to share – to copy, distribute and transmit the work
- to remix – to adapt the work
- Under the following conditions:
- attribution – You must give appropriate credit, provide a link to the license, and indicate if changes were made. You may do so in any reasonable manner, but not in any way that suggests the licensor endorses you or your use.
- share alike – If you remix, transform, or build upon the material, you must distribute your contributions under the same or compatible license as the original.
| Annotations | This image is annotated: View the annotations at Commons |
