Estimating the size of correcting codes using extremal graph problems

Sergiy Butenko (), Panos Pardalos (), Ivan Sergienko, Vladimir Shylo () and Petro Stetsyuk
Additional contact information
Sergiy Butenko: University of Florida
Panos Pardalos: University of Florida
Ivan Sergienko: NAS of Ukraine
Vladimir Shylo: NAS of Ukraine
Petro Stetsyuk: NAS of Ukraine

Chapter Chapter 12 in Optimization, 2009, pp 227-243 from Springer

Abstract: Abstract 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.

Keywords: Maximum independent set; graph coloring; error-correcting codes; coding theory; combinatorial optimization (search for similar items in EconPapers)
Date: 2009
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:spochp:978-0-387-98096-6_12

Ordering information: This item can be ordered from
http://www.springer.com/9780387980966

DOI: 10.1007/978-0-387-98096-6_12

Access Statistics for this chapter

More chapters in Springer Optimization and Its Applications from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().