Can Burrows-Wheeler transform be replaced in chain code compression? (Q2663576): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Lossless compression of map contours by context tree modeling of chain codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online algorithms. The state of the art / rank
 
Normal rank
Property / cites work
 
Property / cites work: A locally adaptive data compression scheme / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational Models of Rhythm and Meter / rank
 
Normal rank
Property / cites work
 
Property / cites work: Elements of Information Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing the Burrows-Wheeler transform in place and in small space / rank
 
Normal rank
Property / cites work
 
Property / cites work: Arbitrarily Shaped Motion Prediction for Depth Video Compression Using Arithmetic Edge Coding / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient pattern matching in degenerate strings with the Burrows-Wheeler transform / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient raster font compression for embedded systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two results on the list update problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear work suffix array construction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient randomized pattern-matching algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scalable Parallel Suffix Array Construction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Compressed vertex chain codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: An analysis of the Burrows—Wheeler transform / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two Efficient Algorithms for Linear Time Suffix Array Construction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Data compression by means of a ``book stack'' / rank
 
Normal rank
Property / cites work
 
Property / cites work: Handbook of Data Compression / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficiency of chain codes to represent binary objects / rank
 
Normal rank
Property / cites work
 
Property / cites work: Amortized Computational Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient chain code compression with interpolative coding / rank
 
Normal rank

Latest revision as of 00:04, 25 July 2024

scientific article
Language Label Description Also known as
English
Can Burrows-Wheeler transform be replaced in chain code compression?
scientific article

    Statements

    Can Burrows-Wheeler transform be replaced in chain code compression? (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    19 April 2021
    0 references
    Burrows-Wheeler transform
    0 references
    move-to-front transform
    0 references
    prediction
    0 references
    chain codes
    0 references
    lossless compression
    0 references

    Identifiers