• DocumentCode
    1048152
  • Title

    Using Graphs for the Analysis and Construction of Permutation Distance-Preserving Mappings

  • Author

    Swart, Theo G. ; Ferreira, Hendrik C. ; Ouahada, Khmaies

  • Author_Institution
    Johannesburg Univ., Auckland Park
  • Volume
    54
  • Issue
    2
  • fYear
    2008
  • Firstpage
    910
  • Lastpage
    916
  • Abstract
    A new way of looking at permutation distance-preserving mappings (DPMs) is presented by making use of a graph representation. The properties necessary to make such a graph distance-preserving, are also investigated. Further, this new knowledge is used to analyze previous constructions, as well as to construct a new general mapping algorithm for a previous multilevel construction.
  • Keywords
    encoding; graph theory; graph analysis; permutation coding; permutation distance-preserving mapping; Africa; Algorithm design and analysis; Binary codes; Binary sequences; Convolutional codes; Error correction; Error correction codes; Hamming distance; Performance evaluation; Upper bound; Code constructions; distance-preserving mappings (DPMs); graphs; permutation coding;
  • fLanguage
    English
  • Journal_Title
    Information Theory, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0018-9448
  • Type

    jour

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