Login / Signup
Studying the locator polynomials of minimum weight codewords of BCH codes.
Daniel Augot
Pascale Charpin
Nicolas Sendrier
Published in:
IEEE Trans. Inf. Theory (1992)
Keyphrases
</>
minimum weight
error correcting codes
reed solomon
bipartite graph
error correction
greedy heuristic
spanning tree
weighted graph
minimum spanning tree
error correcting
maximum cardinality
randomized algorithm
tree patterns
hamming distance
np hard
shortest path
error control
simulated annealing