• DocumentCode
    969387
  • Title

    A relation between Levenshtein-type distances and insertion-and-deletion correcting capabilities of codes

  • Author

    Hollmann, Henk D L

  • Author_Institution
    Philips Res. Lab., Eindhoven, Netherlands
  • Volume
    39
  • Issue
    4
  • fYear
    1993
  • fDate
    7/1/1993 12:00:00 AM
  • Firstpage
    1424
  • Lastpage
    1427
  • Abstract
    A code is a collection of words or strings, not necessarily all of the same length, over come fixed alphabet. A relation is established between the insertion-and-deletion correcting capability of a code and its minimum distance for suitable Levenshtein-type distance measures
  • Keywords
    error correction codes; Levenshtein-type distances; codes; insertion-and-deletion correcting capability; minimum distance; Error correction codes; Notice of Violation; Upper bound;
  • fLanguage
    English
  • Journal_Title
    Information Theory, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0018-9448
  • Type

    jour

  • DOI
    10.1109/18.243463
  • Filename
    243463
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=969387