Estimating the size of correcting codes using extremal graph problems
Chapter
Overview
Research
Identity
Additional Document Info
Other
View All
Overview
abstract
Springer Science+Business Media, LLC 2009. Some of the fundamental problems in coding theory can be formulated as extremal graph problems. Finding estimates of the size of correcting codes is important from both theoretical and practical perspectives. We solve the problem of finding the largest correcting codes using previously developed algorithms for optimization problems in graphs. We report new exact solutions and estimates.