<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Constructive Spherical Codes by Hopf Foliations · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/2008.10728/</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/2008.10728/feed.xml" rel="self" type="application/rss+xml" /><item><title>Constructive Spherical Codes by Hopf Foliations — mentioned by rfgplk</title><link>https://news.ycombinator.com/item?id=49373289</link><guid isPermaLink="false">urn:hackerpapers:mention:2008.10728:49373289</guid><pubDate>Thu, 20 Aug 2026 11:44:09 GMT</pubDate><description>&lt;p&gt;Little something I&amp;#x27;ve been working on. To my knowledge this is the only(?) compression codec using Hopf-fibration quotient coding in any way. It&amp;#x27;s lossy, guarantees fixed rate compression on any input, zero codebook (same as other vector quantizers), provable exact O(1) random access, and ships a fully deterministic compile-time provable format. Beats int-N quantization cleanly in all metrics, haven&amp;#x27;t directly compared it to data-adaptive methods yet, but since they lie on a completely different functionality axis felt like there was no need. Had this idea for quite a while now, but never had…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2008.10728/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.IT</category></item></channel></rss>
