• DocumentCode
    893678
  • Title

    Bounds and constructions for binary codes of length less than 24 and asymmetric distance less than 6

  • Author

    Weber, Jacobus H. ; De Vroedt, Cornelis ; Boekee, Dick E.

  • Author_Institution
    Dept. of Electr. Eng., Delft Univ. of Technol., Netherlands
  • Volume
    34
  • Issue
    5
  • fYear
    1988
  • fDate
    9/1/1988 12:00:00 AM
  • Firstpage
    1321
  • Lastpage
    1331
  • Abstract
    Upper bounds to the maximum number of codewords in a binary code of length n and asymmetric distance Δ are derived for some values of n and Δ. A method is given in which a code of length n-m and asymmetric distance at least t +1 is constructed by expurgating and puncturing a code of length n and Hamming distance at least 2t+1. Novel asymmetric error-correcting codes are constructed by applying this method to some celebrated symmetric error-correcting codes. a table is presented on the size of optimal asymmetric error-correcting codes of length less than 24 and asymmetric distance less than 6
  • Keywords
    boundary-value problems; encoding; error correction codes; Hamming distance; asymmetric distance; asymmetric error-correcting codes; binary codes; bounds; codewords; Binary codes; Block codes; Error correction codes; Hamming distance; Informatics; Information theory; Jacobian matrices; Linear programming; Mathematics; Upper bound;
  • fLanguage
    English
  • Journal_Title
    Information Theory, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0018-9448
  • Type

    jour

  • DOI
    10.1109/18.21262
  • Filename
    21262
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=893678