• DocumentCode
    893416
  • Title

    Explicit codes with low covering radius

  • Author

    Pach, Janos ; Spencer, Joel

  • Author_Institution
    Math. Inst. of the Hungarian Acad. of Sci., Budapest, Hungary
  • Volume
    34
  • Issue
    5
  • fYear
    1988
  • fDate
    9/1/1988 12:00:00 AM
  • Firstpage
    1281
  • Lastpage
    1285
  • Abstract
    A series of explicit low-rate binary linear codes that have relatively low covering radius and can be rapidly decoded is exhibited. These codes can be derived from higher-dimensional analogs of the Gale-Berlekamp switching game. Conjectures of independent interest involving Hadamard matrices are given that could yield semiexplicit covering codes of very low density
  • Keywords
    codes; decoding; encoding; Gale-Berlekamp switching game; Hadamard matrices; binary linear codes; covering codes; covering radius; decoding; explicit codes; Data compression; Decoding; Error correction; Error correction codes; Hamming distance; Helium; Linear code; Mathematics; Switches; Vectors;
  • fLanguage
    English
  • Journal_Title
    Information Theory, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0018-9448
  • Type

    jour

  • DOI
    10.1109/18.21258
  • Filename
    21258
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=893416