Computing extensions of linear codes using a greedy algorithm.

Markus Grassl Sunghyu Han

Published in: ISIT (2012)

Keyphrases

greedy algorithm
greedy algorithms
worst case
objective function
dynamic programming
set cover
greedy strategy
learning algorithm
greedy heuristic
randomized algorithm
influence maximization
lower bound
approximation ratio
approximation guarantees
greedy approximation algorithm