<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0"
	xmlns:content="http://purl.org/rss/1.0/modules/content/"
	xmlns:wfw="http://wellformedweb.org/CommentAPI/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:atom="http://www.w3.org/2005/Atom"
	xmlns:sy="http://purl.org/rss/1.0/modules/syndication/"
	xmlns:slash="http://purl.org/rss/1.0/modules/slash/"
	>

<channel>
	<title>International Journal</title>
	<atom:link href="http://tomtom-network.com/feed" rel="self" type="application/rss+xml" />
	<link>http://tomtom-network.com</link>
	<description>International Journal in Network and Navigation System</description>
	<lastBuildDate>Tue, 29 Sep 2009 08:27:09 +0000</lastBuildDate>
	<generator>http://wordpress.org/?v=2.8.4</generator>
	<language>en</language>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
	<xhtml:meta xmlns:xhtml="http://www.w3.org/1999/xhtml" name="robots" content="noindex" />
		<item>
		<title>Convolutional Codes Under a Minimal Trellis Complexity Measure</title>
		<link>http://tomtom-network.com/Journals/convolutional-codes-under-a-minimal-trellis-complexity-measure.html</link>
		<comments>http://tomtom-network.com/Journals/convolutional-codes-under-a-minimal-trellis-complexity-measure.html#comments</comments>
		<pubDate>Tue, 29 Sep 2009 08:27:09 +0000</pubDate>
		<dc:creator>tomtom</dc:creator>
				<category><![CDATA[Uncategorized]]></category>

		<guid isPermaLink="false">http://tomtom-network.com/?p=3</guid>
		<description><![CDATA[We conduct a code search, restricted to the recently introduced class of generalized punctured convolutional codes, under the minimal trellis complexity measure defined by McEliece and Lin. For the same decoding complexity and the same code rate, new codes are compared to well-known existing classes of convolutional codes. Some of the best convolutional codes (in [...]]]></description>
			<content:encoded><![CDATA[<p>We conduct a code search, restricted to the recently introduced class of generalized punctured convolutional codes, under the minimal trellis complexity measure defined by McEliece and Lin. For the same decoding complexity and the same code rate, new codes are compared to well-known existing classes of convolutional codes. Some of the best convolutional codes (in a distance spectrum sense) of existing and new trellis complexities are tabulated.</p>
]]></content:encoded>
			<wfw:commentRss>http://tomtom-network.com/Journals/convolutional-codes-under-a-minimal-trellis-complexity-measure.html/feed</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Hello world!</title>
		<link>http://tomtom-network.com/Journals/hello-world.html</link>
		<comments>http://tomtom-network.com/Journals/hello-world.html#comments</comments>
		<pubDate>Sun, 27 Sep 2009 21:49:15 +0000</pubDate>
		<dc:creator>tomtom</dc:creator>
				<category><![CDATA[Uncategorized]]></category>

		<guid isPermaLink="false">http://tomtom-network.com/?p=1</guid>
		<description><![CDATA[Welcome to WordPress. This is your first post. Edit or delete it, then start blogging!
]]></description>
			<content:encoded><![CDATA[<p>Welcome to WordPress. This is your first post. Edit or delete it, then start blogging!</p>
]]></content:encoded>
			<wfw:commentRss>http://tomtom-network.com/Journals/hello-world.html/feed</wfw:commentRss>
		<slash:comments>1</slash:comments>
		</item>
	</channel>
</rss>
