IDEAS home Printed from https://ideas.repec.org/h/spr/spochp/978-0-387-98096-6_12.html
   My bibliography  Save this book chapter

Estimating the size of correcting codes using extremal graph problems

In: Optimization

Author

Listed:
  • 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)

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.

Suggested Citation

  • Sergiy Butenko & Panos Pardalos & Ivan Sergienko & Vladimir Shylo & Petro Stetsyuk, 2009. "Estimating the size of correcting codes using extremal graph problems," Springer Optimization and Its Applications, in: Charles Pearce & Emma Hunt (ed.), Optimization, edition 1, chapter 0, pages 227-243, Springer.
    • Handle: RePEc:spr:spochp:978-0-387-98096-6_12
    DOI: 10.1007/978-0-387-98096-6_12
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a search for a similarly titled item that would be available.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:spochp:978-0-387-98096-6_12. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.