<?xml version="1.0" encoding="UTF-8" ?>
<rss version="2.0" xmlns:s="http://www.techrepublic.com/search" xmlns:dc="http://purl.org/dc/elements/1.1/"  xmlns:atom="http://www.w3.org/2005/Atom">
<channel>
    <title><![CDATA[Research Library - White Papers, Webcasts and Case Studies - TechRepublic ]]></title>
    <link><![CDATA[http://www.techrepublic.com/research-library]]></link>
    <atom:link rel="hub" type="application/rss+xml" href="http://pubsubhubbub.appspot.com/" />
    <atom:link rel="self" type="application/rss+xml" href="http://www.techrepublic.com/research-library/tokyo+gas?mode=rss" />

    <description><![CDATA[]]></description>
    <s:counts start="" returned="" found="" />
    <language>en-us</language>
    <lastBuildDate>2013-06-18T00:26:48-07:00</lastBuildDate>
            <item>
        <title><![CDATA[Low-Complexity Algorithm for Log Likelihood Ratios in Coded MIMO-OFDM Communications]]></title>
        <link><![CDATA[http://www.techrepublic.com/whitepapers/low-complexity-algorithm-for-log-likelihood-ratios-in-coded-mimo-ofdm-communications/32887743]]></link>
        <s:doctype><![CDATA[Whitepapers]]></s:doctype>
        <description><![CDATA[In this paper, the authors propose a low-complexity algorithm to calculate Log Likelihood Ratios (LLRs) of coded bits, which is necessary for channel decoding in coded MIMO-OFDM mobile...]]></description>
        <guid><![CDATA[http://www.techrepublic.com/whitepapers/low-complexity-algorithm-for-log-likelihood-ratios-in-coded-mimo-ofdm-communications/32887743]]></guid>
        <pubDate>Wed, 24 Apr 2013 23:33:23 -0700</pubDate>
        <enclosure url="" type="image/jpeg" />
        
    </item>
            <item>
        <title><![CDATA[Strong Security and Separated Code Constructions for the Broadcast Channels With Confidential Messages]]></title>
        <link><![CDATA[http://www.techrepublic.com/whitepapers/strong-security-and-separated-code-constructions-for-the-broadcast-channels-with-confidential-messages/32595699]]></link>
        <s:doctype><![CDATA[Whitepapers]]></s:doctype>
        <description><![CDATA[The authors show that the capacity region of the broadcast channel with confidential messages does not change when the strong security criterion is adopted instead of the weak security criterion...]]></description>
        <guid><![CDATA[http://www.techrepublic.com/whitepapers/strong-security-and-separated-code-constructions-for-the-broadcast-channels-with-confidential-messages/32595699]]></guid>
        <pubDate>Fri, 07 Dec 2012 01:47:31 -0800</pubDate>
        <enclosure url="" type="image/jpeg" />
        
    </item>
            <item>
        <title><![CDATA[New Parameters of Linear Codes Expressing Security Performance of Universal Secure Network Coding]]></title>
        <link><![CDATA[http://www.techrepublic.com/whitepapers/new-parameters-of-linear-codes-expressing-security-performance-of-universal-secure-network-coding/32555871]]></link>
        <s:doctype><![CDATA[Whitepapers]]></s:doctype>
        <description><![CDATA[The universal secure network coding presented by Silva et al. realizes secure and reliable transmission of a secret message over any underlying network code, by using maximum rank distance codes....]]></description>
        <guid><![CDATA[http://www.techrepublic.com/whitepapers/new-parameters-of-linear-codes-expressing-security-performance-of-universal-secure-network-coding/32555871]]></guid>
        <pubDate>Fri, 26 Oct 2012 03:04:26 -0700</pubDate>
        <enclosure url="" type="image/jpeg" />
        
    </item>
    </channel>
</rss>

