• DocumentCode
    778593
  • Title

    Unidirectional covering codes

  • Author

    Ostergård, Patric R J ; Seuranen, Esa A.

  • Author_Institution
    Dept. of Electr. & Commun. Eng., Helsinki Univ. of Technol., Finland
  • Volume
    52
  • Issue
    1
  • fYear
    2006
  • Firstpage
    336
  • Lastpage
    340
  • Abstract
    A code C⊆Zn2, where Z2={0,1}, has unidirectional covering radius R if R is the smallest integer so that any word in Zn2 can be obtained from at least one codeword c∈C by replacing either 1s by 0s in at most R coordinates or 0s by 1s in at most R coordinates. The minimum cardinality of such a code is denoted by E(n,R). Upper bounds on this function are here obtained by constructing codes using tabu search; lower bounds, on the other hand, are mainly obtained by integer programming and exhaustive search. Best known bounds on E(n,R) for n≤13 and R≤6 are tabulated.
  • Keywords
    binary codes; error correction codes; integer programming; search problems; integer programming; tabu search; unidirectional covering code; Data compression; Error correction codes; Linear programming; Upper bound; Covering codes; integer programming; tabu search; unidirectional codes;
  • fLanguage
    English
  • Journal_Title
    Information Theory, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0018-9448
  • Type

    jour

  • DOI
    10.1109/TIT.2005.860449
  • Filename
    1564451
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=778593