<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Reed-Muller Codes Achieve Capacity on Erasure Channels · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/1601.04689/</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/1601.04689/feed.xml" rel="self" type="application/rss+xml" /><item><title>Reed-Muller Codes Achieve Capacity on Erasure Channels — HN submission</title><link>https://news.ycombinator.com/item?id=11982417</link><guid isPermaLink="false">urn:hackerpapers:submission:1601.04689:11982417</guid><pubDate>Sun, 26 Jun 2016 20:01:11 GMT</pubDate><description>&lt;p&gt;Reed-Muller Codes Achieve Capacity on Erasure Channels&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;4 points; 0 discussion replies on HN. &lt;a href="https://hackerpaper.kaipfister.de/p/1601.04689/"&gt;Paper and source history&lt;/a&gt;. A submission is not an endorsement.&lt;/p&gt;</description><category>cs.IT</category></item></channel></rss>
