<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Optimal encoding on discrete lattice with translational invariant constrains using statistical algorithms · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/0710.3861/</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/0710.3861/feed.xml" rel="self" type="application/rss+xml" /><item><title>Optimal encoding on discrete lattice with translational invariant constrains using statistical algorithms — mentioned by eln1</title><link>https://news.ycombinator.com/item?id=12058894</link><guid isPermaLink="false">urn:hackerpapers:mention:0710.3861:12058894</guid><pubDate>Fri, 08 Jul 2016 21:53:27 GMT</pubDate><description>&lt;p&gt;It points to even older paper for ANS: http://arxiv.org/abs/0710.3861 The more recent one is: http://arxiv.org/abs/1311.2540 The first one is about kind of multidimensional analogue of Fibonacci coding ( https://en.wikipedia.org/wiki/Fibonacci_coding )- on a lattice, such that there cannot be two neighboring &amp;#x27;1&amp;#x27;s. It also uses an interesting concept of Maximal Entropy Random Walk.&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/0710.3861/"&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>
