Login / Signup
On the dual minimum distance and minimum weight of codes from a quotient of the Hermitian curve.
Edoardo Ballico
Alberto Ravagnani
Published in:
Appl. Algebra Eng. Commun. Comput. (2013)
Keyphrases
</>
minimum distance
minimum weight
error correcting codes
bipartite graph
spanning tree
upper bound
greedy heuristic
weighted graph
euclidean distance
nearest neighbor
convex hull
minimum spanning tree
error correction
tree patterns
endpoints
gray level images
lower bound
error correcting
knn