IDEAS home Printed from https://ideas.repec.org/a/gam/jmathe/v13y2025i7p1070-d1620288.html
   My bibliography  Save this article

Compression Sensitivity of the Burrows–Wheeler Transform and Its Bijective Variant

Author

Listed:
  • Hyodam Jeon

    (Department of Computer Science and Engineering, University of Yamanashi, Kōfu 400-8511, Japan)

  • Dominik Köppl

    (Department of Computer Science and Engineering, University of Yamanashi, Kōfu 400-8511, Japan)

Abstract

The Burrows–Wheeler Transform (BWT) is a widely used reversible data compression method, forming the foundation of various compression algorithms and indexing structures. Prior research has analyzed the sensitivity of compression methods and repetitiveness measures to single-character edits, particularly in binary alphabets. However, the impact of such modifications on the compression efficiency of the bijective variant of BWT (BBWT) remains largely unexplored. This study extends previous work by examining the compression sensitivity of both BWT and BBWT when applied to larger alphabets, including alphabet reordering. We establish theoretical bounds on the increase in compression size due to character modifications in structured sequences such as Fibonacci words. Our devised lower bounds put the sensitivity of BBWT on the same scale as of BWT, with compression size changes exhibiting logarithmic multiplicative growth and square-root additive growth patterns depending on the edit type and the input data. These findings contribute to a deeper understanding of repetitiveness measures.

Suggested Citation

  • Hyodam Jeon & Dominik Köppl, 2025. "Compression Sensitivity of the Burrows–Wheeler Transform and Its Bijective Variant," Mathematics, MDPI, vol. 13(7), pages 1-47, March.
    • Handle: RePEc:gam:jmathe:v:13:y:2025:i:7:p:1070-:d:1620288
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/13/7/1070/pdf
    Download Restriction: no
    File URL: https://www.mdpi.com/2227-7390/13/7/1070/
    Download Restriction: no
    ---><---

    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:gam:jmathe:v:13:y:2025:i:7:p:1070-:d:1620288. 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: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.com .

    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.