Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Bonus: Illustrate least number of corrections #49

Open
dandls opened this issue Mar 19, 2020 · 0 comments
Open

Bonus: Illustrate least number of corrections #49

dandls opened this issue Mar 19, 2020 · 0 comments

Comments

@dandls
Copy link

dandls commented Mar 19, 2020

Chapter 4: Designing codebooks
"If the minimum distance between any pair of codewords is d, the
code can correct at least tail(d-1/2) single bit errors."
This should be illustrated with a codebook.

@mb706 mb706 transferred this issue from another repository Nov 30, 2022
@mb706 mb706 transferred this issue from slds-lmu/dummyrepo Dec 1, 2022
@mb706 mb706 transferred this issue from slds-lmu/i2ml Dec 1, 2022
@mb706 mb706 transferred this issue from slds-lmu/lecture_i2ml Jan 28, 2023
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Projects
None yet
Development

No branches or pull requests

1 participant