Asymptotically good families of geometric Goppa codes and the Gilbert-Varshamov bound.
Conny VossPublished in: EUROCODE (1990)
Keyphrases
- worst case
- asymptotically optimal
- error correction
- geometric structure
- lower bound
- upper bound
- real time
- geometric reasoning
- geometric constraints
- databases
- channel coding
- computer vision
- data mining
- motion estimation
- computer simulation
- sample size
- np hard
- objective function
- learning algorithm
- information retrieval
- error correcting