Login / Signup
A New Algorithm for Finding Minimum-Weight Words in a Linear Code: Application to McEliece's Cryptosystem and to Narrow-Sense BCH Codes of Length 511.
Anne Canteaut
Florent Chabaud
Published in:
IEEE Trans. Inf. Theory (1998)
Keyphrases
</>
minimum weight
learning algorithm
optimal solution
minimum spanning tree
dynamic programming
worst case
multiscale
average case
cost function
objective function
particle swarm optimization
segmentation algorithm
knapsack problem
bipartite graph
spanning tree
simulated annealing
greedy heuristic