Page not found
This question was voluntarily removed by its author.
Here are some similar questions that might be relevant:
- Probability of false decoding with LDPC codes
- covering disks with smaller disks
- LDPC codes construction
- Binary linear codes, juxtaposition and similarity
- Upper bounds for high-dimensional spherical codes given the covering radius
- Elementary precise estimate of the covering number of euclidean balls by hypercubes
- Covering unit-radius balls with unit-diameter objects
- Perfect 1 error correcting codes non-isomorphic to Hamming codes?
Try a Google Search
Try searching for similar questions
Browse our recent questions
Browse our popular tags
If you feel something is missing that should be here, contact us.