<?xml version="1.0" encoding="utf-8"?><rss version="2.0"
	xmlns:content="http://purl.org/rss/1.0/modules/content/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:atom="http://www.w3.org/2005/Atom"
	>
<channel>
	<title>Comments on: Hamming distance conjecture</title>
	<atom:link href="http://whats.all.this.brouhaha.com/2006/01/23/hamming-distance-conjecture/feed/" rel="self" type="application/rss+xml" />
	<link>http://whats.all.this.brouhaha.com/2006/01/23/hamming-distance-conjecture/</link>
	<description>random rantings</description>
	<pubDate>Mon, 01 Dec 2008 21:44:14 +0000</pubDate>
	<generator>http://wordpress.org/?v=2.6</generator>
		<item>
		<title>By: eric</title>
		<link>http://whats.all.this.brouhaha.com/2006/01/23/hamming-distance-conjecture/#comment-214</link>
		<dc:creator>eric</dc:creator>
		<pubDate>Fri, 27 Jan 2006 08:38:45 +0000</pubDate>
		<guid isPermaLink="false">http://whats.all.this.brouhaha.com/?p=204#comment-214</guid>
		<description>Kaie Wasserman found counterexamples with n=15 or 16 and d=7.

I think there may be some nontrivial bound below which the relations hold, but it must be less than d &lt; n/2.</description>
		<content:encoded><![CDATA[<p>Kaie Wasserman found counterexamples with n=15 or 16 and d=7.</p>
<p>I think there may be some nontrivial bound below which the relations hold, but it must be less than d < n/2.</p>
]]></content:encoded>
	</item>
</channel>
</rss>
