Login / Signup
A low-complexity algorithm for the construction of algebraic-geometric codes better than the Gilbert-Varshamov bound.
Kenneth W. Shum
Ilia Aleshnikov
P. Vijay Kumar
Henning Stichtenoth
Vinay Deolalikar
Published in:
IEEE Trans. Inf. Theory (2001)
Keyphrases
</>
low complexity
lower bound
worst case
higher order
geometric structure
upper bound
construction process
np hard
geometric constraints
algebraic expressions
data sets
databases
computer vision
computer simulation
error correction
algebraic curves