<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>A Bijective String Sorting Transform · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/1201.3077/</link><description>Collected HN comments and submissions linking this paper.</description><language>en</language><lastBuildDate>Mon, 02 Nov 2026 11:16:22 GMT</lastBuildDate><atom:link href="https://hackerpaper.kaipfister.de/p/1201.3077/feed.xml" rel="self" type="application/rss+xml" /><item><title>A Bijective String Sorting Transform — mentioned by gkbdibfj</title><link>https://news.ycombinator.com/item?id=24657910</link><guid isPermaLink="false">urn:hackerpapers:mention:1201.3077:24657910</guid><pubDate>Fri, 02 Oct 2020 01:35:07 GMT</pubDate><description>&lt;p&gt;Googling the term will confirm that I didn&amp;#x27;t just invent the notion of bijective compression. That &amp;quot;the domain and range are the same set&amp;quot; is a given for compression programs which operate on strings or files. It&amp;#x27;s the bijective property which is added to that here. So it&amp;#x27;s not that we&amp;#x27;re dealing with alternative meanings of &amp;quot;bijective&amp;quot;, rather that it&amp;#x27;s understood in the work on bijective compression that compression/decompression are fundamentally functions from strings to strings. (So compression is not conceptualized as a function from arbitrary strings to some more restricted set of…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1201.3077/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.DS</category></item></channel></rss>
