IDEAS home Printed from https://ideas.repec.org/a/eee/apmaco/v365y2020ics0096300319306885.html
   My bibliography  Save this article

The r-Hamming gap and distance-gap-preserving mappings from binary vectors to permutations

Author

Listed:
  • Wang, Chao
  • Wang, Hua
  • Zhang, Yuzhi

Abstract

The well known Hamming distance between a pair of permutations (or strings) of the same length is simply the number of pairs of different digits in these permutations. It has been an interesting topic of research to find mappings from the binary vectors to permutations of the same length such that the Hamming distance is preserved or increased. As a natural variation we introduce the Hamming gap of radius r between two permutations, which is, in a way, equivalent to the number of digits where the corresponding pair of entries differ by at least r. This is called the r-Hamming gap. We first discuss the properties of this new concept. We then show mappings from binary vectors to permutations such that the images of a pair of binary vectors (at Hamming distance d) have r-Hamming gap at least d. We also show the generalization of our findings to permutations on Zn (where n ≡ 0) instead of [n].

Suggested Citation

  • Wang, Chao & Wang, Hua & Zhang, Yuzhi, 2020. "The r-Hamming gap and distance-gap-preserving mappings from binary vectors to permutations," Applied Mathematics and Computation, Elsevier, vol. 365(C).
    • Handle: RePEc:eee:apmaco:v:365:y:2020:i:c:s0096300319306885
    DOI: 10.1016/j.amc.2019.124696
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0096300319306885
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.amc.2019.124696?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:apmaco:v:365:y:2020:i:c:s0096300319306885. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: https://www.journals.elsevier.com/applied-mathematics-and-computation .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.