CINXE.COM

<!DOCTYPE html> <html lang="en" dir="ltr"> <head>  <script async src="https://www.googletagmanager.com/gtag/js?id=G-P63WKM1TM1"></script> <script> window.dataLayer = window.dataLayer || []; function gtag(){dataLayer.push(arguments);} gtag('js', new Date()); gtag('config', 'G-P63WKM1TM1'); </script>  <script type="text/javascript" > (function(m,e,t,r,i,k,a){m[i]=m[i]||function(){(m[i].a=m[i].a||[]).push(arguments)}; m[i].l=1*new Date(); for (var j = 0; j < document.scripts.length; j++) {if (document.scripts[j].src === r) { return; }} k=e.createElement(t),a=e.getElementsByTagName(t)[0],k.async=1,k.src=r,a.parentNode.insertBefore(k,a)}) (window, document, "script", "https://mc.yandex.ru/metrika/tag.js", "ym"); ym(55165297, "init", { clickmap:false, trackLinks:true, accurateTrackBounce:true, webvisor:false }); </script> <noscript><div><img src="https://mc.yandex.ru/watch/55165297" style="position:absolute; left:-9999px;" alt="" /></div></noscript>    <title>Search results for: Raptor codes</title> <meta name="description" content="Search results for: Raptor codes"> <meta name="keywords" content="Raptor codes"> <meta name="viewport" content="width=device-width, initial-scale=1, minimum-scale=1, maximum-scale=1, user-scalable=no"> <meta charset="utf-8"> <link href="https://cdn.waset.org/favicon.ico" type="image/x-icon" rel="shortcut icon"> <link href="https://cdn.waset.org/static/plugins/bootstrap-4.2.1/css/bootstrap.min.css" rel="stylesheet"> <link href="https://cdn.waset.org/static/plugins/fontawesome/css/all.min.css" rel="stylesheet"> <link href="https://cdn.waset.org/static/css/site.css?v=150220211555" rel="stylesheet"> </head> <body> <header> <div class="container"> <nav class="navbar navbar-expand-lg navbar-light"> <a class="navbar-brand" href="https://waset.org"> <img src="https://cdn.waset.org/static/images/wasetc.png" alt="Open Science Research Excellence" title="Open Science Research Excellence" /> </a> <button class="d-block d-lg-none navbar-toggler ml-auto" type="button" data-toggle="collapse" data-target="#navbarMenu" aria-controls="navbarMenu" aria-expanded="false" aria-label="Toggle navigation"> <span class="navbar-toggler-icon"></span> </button> <div class="w-100"> <div class="d-none d-lg-flex flex-row-reverse"> <form method="get" action="https://waset.org/search" class="form-inline my-2 my-lg-0"> <input class="form-control mr-sm-2" type="search" placeholder="Search Conferences" value="Raptor codes" name="q" aria-label="Search"> <button class="btn btn-light my-2 my-sm-0" type="submit"><i class="fas fa-search"></i></button> </form> </div> <div class="collapse navbar-collapse mt-1" id="navbarMenu"> <ul class="navbar-nav ml-auto align-items-center" id="mainNavMenu"> <li class="nav-item"> <a class="nav-link" href="https://waset.org/conferences" title="Conferences in 2024/2025/2026">Conferences</a> </li> <li class="nav-item"> <a class="nav-link" href="https://waset.org/disciplines" title="Disciplines">Disciplines</a> </li> <li class="nav-item"> <a class="nav-link" href="https://waset.org/committees" rel="nofollow">Committees</a> </li> <li class="nav-item dropdown"> <a class="nav-link dropdown-toggle" href="#" id="navbarDropdownPublications" role="button" data-toggle="dropdown" aria-haspopup="true" aria-expanded="false"> Publications </a> <div class="dropdown-menu" aria-labelledby="navbarDropdownPublications"> <a class="dropdown-item" href="https://publications.waset.org/abstracts">Abstracts</a> <a class="dropdown-item" href="https://publications.waset.org">Periodicals</a> <a class="dropdown-item" href="https://publications.waset.org/archive">Archive</a> </div> </li> <li class="nav-item"> <a class="nav-link" href="https://waset.org/page/support" title="Support">Support</a> </li> </ul> </div> </div> </nav> </div> </header> <main> <div class="container mt-4"> <div class="row"> <div class="col-md-9 mx-auto"> <form method="get" action="https://publications.waset.org/search"> <div id="custom-search-input"> <div class="input-group"> <i class="fas fa-search"></i> <input type="text" class="search-query" name="q" placeholder="Author, Title, Abstract, Keywords" value="Raptor codes"> <input type="submit" class="btn_search" value="Search"> </div> </div> </form> </div> </div> <div class="row mt-3"> <div class="col-sm-3"> <div class="card"> <div class="card-body"><strong>Commenced</strong> in January 2007</div> </div> </div> <div class="col-sm-3"> <div class="card"> <div class="card-body"><strong>Frequency:</strong> Monthly</div> </div> </div> <div class="col-sm-3"> <div class="card"> <div class="card-body"><strong>Edition:</strong> International</div> </div> </div> <div class="col-sm-3"> <div class="card"> <div class="card-body"><strong>Paper Count:</strong> 276</div> </div> </div> </div> <h1 class="mt-3 mb-3 text-center" style="font-size:1.6rem;">Search results for: Raptor codes</h1> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">276</span> On Quantum BCH Codes and Its Duals</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=J.%20S.%20Bhullar">J. S. Bhullar</a>, <a href="https://publications.waset.org/search?q=Manish%20Gupta"> Manish Gupta</a> </p> <p class="card-text"><strong>Abstract:</strong></p> <p>Classical Bose-Chaudhuri-Hocquenghem (BCH) codes C that contain their dual codes can be used to construct quantum stabilizer codes this chapter studies the properties of such codes. It had been shown that a BCH code of length n which contains its dual code satisfies the bound on weight of any non-zero codeword in C and converse is also true. One impressive difficulty in quantum communication and computation is to protect informationcarrying quantum states against undesired interactions with the environment. To address this difficulty, many good quantum errorcorrecting codes have been derived as binary stabilizer codes. We were able to shed more light on the structure of dual containing BCH codes. These results make it possible to determine the parameters of quantum BCH codes in terms of weight of non-zero dual codeword.</p> <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Quantum%20Codes" title="Quantum Codes">Quantum Codes</a>, <a href="https://publications.waset.org/search?q=BCH%20Codes" title=" BCH Codes"> BCH Codes</a>, <a href="https://publications.waset.org/search?q=Dual%20BCH%20Codes" title=" Dual BCH Codes"> Dual BCH Codes</a>, <a href="https://publications.waset.org/search?q=Designed%20Distance." title=" Designed Distance."> Designed Distance.</a> </p> <a href="https://publications.waset.org/5931/on-quantum-bch-codes-and-its-duals" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/5931/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/5931/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/5931/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/5931/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/5931/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/5931/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/5931/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/5931/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/5931/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/5931/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/5931.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">1752</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">275</span> Effect of Atmospheric Turbulence on Hybrid FSO/RF Link Availability under Qatar Harsh Climate</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Abir%20Touati">Abir Touati</a>, <a href="https://publications.waset.org/search?q=Syed%20Jawad%20Hussain"> Syed Jawad Hussain</a>, <a href="https://publications.waset.org/search?q=Farid%20Touati"> Farid Touati</a>, <a href="https://publications.waset.org/search?q=Ammar%20Bouallegue"> Ammar Bouallegue</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Although there has been a growing interest in the hybrid free-space optical link and radio frequency FSO/RF communication system, the current literature is limited to results obtained in moderate or cold environment. In this paper, using a soft switching approach, we investigate the effect of weather inhomogeneities on the strength of turbulence hence the channel refractive index under Qatar harsh environment and their influence on the hybrid FSO/RF availability. In this approach, either FSO/RF or simultaneous or none of them can be active. Based on soft switching approach and a finite state Markov Chain (FSMC) process, we model the channel fading for the two links and derive a mathematical expression for the outage probability of the hybrid system. Then, we evaluate the behavior of the hybrid FSO/RF under hazy and harsh weather. Results show that the FSO/RF soft switching renders the system outage probability less than that of each link individually. A soft switching algorithm is being implemented on FPGAs using Raptor code interfaced to the two terminals of a 1Gbps/100 Mbps FSO/RF hybrid system, the first being implemented in the region. Experimental results are compared to the above simulation results. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Atmospheric%20turbulence" title="Atmospheric turbulence">Atmospheric turbulence</a>, <a href="https://publications.waset.org/search?q=haze" title=" haze"> haze</a>, <a href="https://publications.waset.org/search?q=soft%20switching" title=" soft switching"> soft switching</a>, <a href="https://publications.waset.org/search?q=Raptor%20codes" title=" Raptor codes"> Raptor codes</a>, <a href="https://publications.waset.org/search?q=refractive%20index." title=" refractive index."> refractive index.</a> </p> <a href="https://publications.waset.org/10002401/effect-of-atmospheric-turbulence-on-hybrid-fsorf-link-availability-under-qatar-harsh-climate" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/10002401/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/10002401/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/10002401/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/10002401/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/10002401/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/10002401/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/10002401/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/10002401/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/10002401/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/10002401/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/10002401.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">2578</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">274</span> Squaring Construction for Repeated-Root Cyclic Codes</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=O.%20P.%20Vinocha">O. P. Vinocha </a>, <a href="https://publications.waset.org/search?q=J.%20S.%20Bhullar"> J. S. Bhullar </a>, <a href="https://publications.waset.org/search?q=Manish%20Gupta"> Manish Gupta</a> </p> <p class="card-text"><strong>Abstract:</strong></p> We considered repeated-root cyclic codes whose block length is divisible by the characteristic of the underlying field. Cyclic self dual codes are also the repeated root cyclic codes. It is known about the one-level squaring construction for binary repeated root cyclic codes. In this correspondence, we introduced of two level squaring construction for binary repeated root cyclic codes of length 2a b , a > 0, b is odd. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Squaring%20Construction" title="Squaring Construction">Squaring Construction</a>, <a href="https://publications.waset.org/search?q=generator%20matrix" title=" generator matrix"> generator matrix</a>, <a href="https://publications.waset.org/search?q=selfdual%20codes" title=" selfdual codes"> selfdual codes</a>, <a href="https://publications.waset.org/search?q=cyclic%20codes" title=" cyclic codes"> cyclic codes</a>, <a href="https://publications.waset.org/search?q=coset%20codes" title=" coset codes"> coset codes</a>, <a href="https://publications.waset.org/search?q=repeated%20root%20cycliccodes." title=" repeated root cycliccodes."> repeated root cycliccodes.</a> </p> <a href="https://publications.waset.org/11272/squaring-construction-for-repeated-root-cyclic-codes" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/11272/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/11272/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/11272/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/11272/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/11272/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/11272/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/11272/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/11272/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/11272/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/11272/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/11272.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">1561</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">273</span> Performance Evaluation of Low Density Parity Check Codes</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Othman%20O.%20Khalifa">Othman O. Khalifa</a>, <a href="https://publications.waset.org/search?q=Sheroz%20khan"> Sheroz khan</a>, <a href="https://publications.waset.org/search?q=Mohamad%20Zaid"> Mohamad Zaid</a>, <a href="https://publications.waset.org/search?q=Muhamad%20Nawawi"> Muhamad Nawawi</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper mainly about the study on one of the widely used error correcting codes that is Low parity check Codes (LDPC). In this paper, the Regular LDPC code has been discussed The LDPC codes explained in this paper is about the Regular Binary LDPC codes or the Gallager. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=LDPC" title="LDPC">LDPC</a>, <a href="https://publications.waset.org/search?q=channel%20coding." title=" channel coding."> channel coding.</a> </p> <a href="https://publications.waset.org/4817/performance-evaluation-of-low-density-parity-check-codes" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/4817/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/4817/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/4817/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/4817/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/4817/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/4817/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/4817/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/4817/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/4817/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/4817/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/4817.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">2824</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">272</span> Skew Cyclic Codes over Fq+uFq+…+uk-1Fq</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Jing%20Li">Jing Li</a>, <a href="https://publications.waset.org/search?q=Xiuli%20Li"> Xiuli Li</a> </p> <p class="card-text"><strong>Abstract:</strong></p> <p>This paper studies a special class of linear codes, called skew cyclic codes, over the ring <em>R</em>= <em>F<sub>q</sub></em>+<em>uF<sub>q</sub></em>+…+<em>u<sup>k-</sup></em><sup>1</sup><em>F<sub>q</sub></em>, where <em>q</em> is a prime power. A Gray map <em>ɸ</em> from <em>R</em> to <em>F<sub>q</sub></em> and a Gray map <em>ɸ'</em> from <em>R<sup>n</sup></em> to <em>F<sup>n</sup><sub>q</sub></em> are defined, as well as an automorphism <em>Θ</em> over <em>R</em>. It is proved that the images of skew cyclic codes over <em>R</em> under map <em>ɸ'</em> and <em>Θ</em> are cyclic codes over <em>F<sub>q</sub></em>, and they still keep the dual relation.</p> <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Skew%20cyclic%20code" title="Skew cyclic code">Skew cyclic code</a>, <a href="https://publications.waset.org/search?q=gray%20map" title=" gray map"> gray map</a>, <a href="https://publications.waset.org/search?q=automophism" title=" automophism"> automophism</a>, <a href="https://publications.waset.org/search?q=cyclic%20code." title=" cyclic code."> cyclic code.</a> </p> <a href="https://publications.waset.org/10007567/skew-cyclic-codes-over-fqufquk-1fq" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/10007567/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/10007567/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/10007567/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/10007567/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/10007567/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/10007567/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/10007567/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/10007567/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/10007567/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/10007567/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/10007567.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">1092</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">271</span> Pontrjagin Duality and Codes over Finite Commutative Rings</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Khalid%20Abdelmoumen">Khalid Abdelmoumen</a>, <a href="https://publications.waset.org/search?q=Mustapha%20Najmeddine"> Mustapha Najmeddine</a>, <a href="https://publications.waset.org/search?q=Hussain%20Ben-Azza"> Hussain Ben-Azza</a> </p> <p class="card-text"><strong>Abstract:</strong></p> We present linear codes over finite commutative rings which are not necessarily Frobenius. We treat the notion of syndrome decoding by using Pontrjagin duality. We also give a version of Delsarte-s theorem over rings relating trace codes and subring subcodes. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Codes" title="Codes">Codes</a>, <a href="https://publications.waset.org/search?q=Finite%20Rings" title=" Finite Rings"> Finite Rings</a>, <a href="https://publications.waset.org/search?q=Pontrjagin%20Duality" title=" Pontrjagin Duality"> Pontrjagin Duality</a>, <a href="https://publications.waset.org/search?q=Trace%20Codes." title=" Trace Codes."> Trace Codes.</a> </p> <a href="https://publications.waset.org/4423/pontrjagin-duality-and-codes-over-finite-commutative-rings" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/4423/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/4423/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/4423/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/4423/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/4423/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/4423/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/4423/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/4423/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/4423/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/4423/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/4423.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">1813</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">270</span> Low Complexity Regular LDPC codes for Magnetic Storage Devices</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Gabofetswe%20Malema">Gabofetswe Malema</a>, <a href="https://publications.waset.org/search?q=Michael%20Liebelt"> Michael Liebelt</a> </p> <p class="card-text"><strong>Abstract:</strong></p> <p>LDPC codes could be used in magnetic storage devices because of their better decoding performance compared to other error correction codes. However, their hardware implementation results in large and complex decoders. This one of the main obstacles the decoders to be incorporated in magnetic storage devices. We construct small high girth and rate 2 columnweight codes from cage graphs. Though these codes have low performance compared to higher column weight codes, they are easier to implement. The ease of implementation makes them more suitable for applications such as magnetic recording. Cages are the smallest known regular distance graphs, which give us the smallest known column-weight 2 codes given the size, girth and rate of the code.</p> <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Structured%20LDPC%20codes" title="Structured LDPC codes">Structured LDPC codes</a>, <a href="https://publications.waset.org/search?q=cage%20graphs." title=" cage graphs."> cage graphs.</a> </p> <a href="https://publications.waset.org/3485/low-complexity-regular-ldpc-codes-for-magnetic-storage-devices" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/3485/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/3485/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/3485/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/3485/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/3485/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/3485/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/3485/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/3485/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/3485/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/3485/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/3485.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">2112</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">269</span> Analysis of MAC Protocols with Correlation Receiver for OCDMA Networks - Part II</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Shivaleela%20E.%20S.">Shivaleela E. S.</a>, <a href="https://publications.waset.org/search?q=Shrikant%20S.%20Tangade"> Shrikant S. Tangade</a> </p> <p class="card-text"><strong>Abstract:</strong></p> <p>In this paper optical code-division multiple-access (OCDMA) packet network is considered, which offers inherent security in the access networks. Two types of random access protocols are proposed for packet transmission. In protocol 1, all distinct codes and in protocol 2, distinct codes as well as shifted versions of all these codes are used. O-CDMA network performance using optical orthogonal codes (OOCs) 1-D and two-dimensional (2-D) wavelength/time single-pulse-per-row (W/T SPR) codes are analyzed. The main advantage of using 2-D codes instead of onedimensional (1-D) codes is to reduce the errors due to multiple access interference among different users. In this paper, correlation receiver is considered in the analysis. Using analytical model, we compute and compare packet-success probability for 1-D and 2-D codes in an O-CDMA network and the analysis shows improved performance with 2-D codes as compared to 1-D codes.</p> <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Optical%20code-division%20multiple-access" title="Optical code-division multiple-access">Optical code-division multiple-access</a>, <a href="https://publications.waset.org/search?q=optical%20CDMA%20correlation%20receiver" title=" optical CDMA correlation receiver"> optical CDMA correlation receiver</a>, <a href="https://publications.waset.org/search?q=wavelength%2Ftime%20optical%20CDMA%20codes." title=" wavelength/time optical CDMA codes."> wavelength/time optical CDMA codes.</a> </p> <a href="https://publications.waset.org/5938/analysis-of-mac-protocols-with-correlation-receiver-for-ocdma-networks-part-ii" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/5938/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/5938/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/5938/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/5938/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/5938/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/5938/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/5938/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/5938/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/5938/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/5938/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/5938.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">1394</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">268</span> Enhancing the Error-Correcting Performance of LDPC Codes through an Efficient Use of Decoding Iterations</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Insah%20Bhurtah">Insah Bhurtah</a>, <a href="https://publications.waset.org/search?q=P.%20Clarel%20Catherine"> P. Clarel Catherine</a>, <a href="https://publications.waset.org/search?q=K.%20M.%20Sunjiv%20Soyjaudah"> K. M. Sunjiv Soyjaudah</a> </p> <p class="card-text"><strong>Abstract:</strong></p> <p>The decoding of Low-Density Parity-Check (LDPC) codes is operated over a redundant structure known as the bipartite graph, meaning that the full set of bit nodes is not absolutely necessary for decoder convergence. In 2008, Soyjaudah and Catherine designed a recovery algorithm for LDPC codes based on this assumption and showed that the error-correcting performance of their codes outperformed conventional LDPC Codes. In this work, the use of the recovery algorithm is further explored to test the performance of LDPC codes while the number of iterations is progressively increased. For experiments conducted with small blocklengths of up to 800 bits and number of iterations of up to 2000, the results interestingly demonstrate that contrary to conventional wisdom, the error-correcting performance keeps increasing with increasing number of iterations.</p> <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Error-correcting%20codes" title="Error-correcting codes">Error-correcting codes</a>, <a href="https://publications.waset.org/search?q=information%20theory" title=" information theory"> information theory</a>, <a href="https://publications.waset.org/search?q=low-density%20parity-check%20codes" title=" low-density parity-check codes"> low-density parity-check codes</a>, <a href="https://publications.waset.org/search?q=sum-product%20algorithm." title=" sum-product algorithm."> sum-product algorithm.</a> </p> <a href="https://publications.waset.org/691/enhancing-the-error-correcting-performance-of-ldpc-codes-through-an-efficient-use-of-decoding-iterations" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/691/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/691/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/691/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/691/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/691/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/691/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/691/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/691/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/691/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/691/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/691.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">1708</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">267</span> On Decomposition of Maximal Prefix Codes</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Nikolai%20Krainiukov">Nikolai Krainiukov</a>, <a href="https://publications.waset.org/search?q=Boris%20Melnikov"> Boris Melnikov</a> </p> <p class="card-text"><strong>Abstract:</strong></p> <p>We study the properties of maximal prefix codes. The codes have many applications in computer science, theory of formal languages, data processing and data classification. Our approaches to study use finite state automata (so-called flower automata) for the representation of prefix codes. An important task is the decomposition of prefix codes into prime prefix codes (factors). We discuss properties of such prefix code decompositions. A linear time algorithm is designed to find the prime decomposition. We used the GAP computer algebra system, which allows us to perform algebraic operations for free semigroups, monoids and automata.</p> <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Maximal%20prefix%20code" title="Maximal prefix code">Maximal prefix code</a>, <a href="https://publications.waset.org/search?q=regular%20languages" title=" regular languages"> regular languages</a>, <a href="https://publications.waset.org/search?q=flower%20automata" title=" flower automata"> flower automata</a>, <a href="https://publications.waset.org/search?q=prefix%20code%20decomposing." title=" prefix code decomposing."> prefix code decomposing.</a> </p> <a href="https://publications.waset.org/10013756/on-decomposition-of-maximal-prefix-codes" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/10013756/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/10013756/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/10013756/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/10013756/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/10013756/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/10013756/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/10013756/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/10013756/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/10013756/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/10013756/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/10013756.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">71</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">266</span> Systematic Unit-Memory Binary Convolutional Codes from Linear Block Codes over F2r + vF2r</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=John%20Mark%20Lampos">John Mark Lampos</a>, <a href="https://publications.waset.org/search?q=Virgilio%20Sison"> Virgilio Sison</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Two constructions of unit-memory binary convolutional codes from linear block codes over the finite semi-local ring F2r +vF2r , where v2 = v, are presented. In both cases, if the linear block code is systematic, then the resulting convolutional encoder is systematic, minimal, basic and non-catastrophic. The Hamming free distance of the convolutional code is bounded below by the minimum Hamming distance of the block code. New examples of binary convolutional codes that meet the Heller upper bound for systematic codes are given. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Convolutional%20codes" title="Convolutional codes">Convolutional codes</a>, <a href="https://publications.waset.org/search?q=semi-local%20ring" title=" semi-local ring"> semi-local ring</a>, <a href="https://publications.waset.org/search?q=free%20distance" title=" free distance"> free distance</a>, <a href="https://publications.waset.org/search?q=Heller%20bound." title="Heller bound.">Heller bound.</a> </p> <a href="https://publications.waset.org/9501/systematic-unit-memory-binary-convolutional-codes-from-linear-block-codes-over-f2r-vf2r" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/9501/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/9501/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/9501/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/9501/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/9501/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/9501/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/9501/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/9501/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/9501/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/9501/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/9501.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">1652</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">265</span> Effective Relay Communication for Scalable Video Transmission</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Jung%20Ah%20Park">Jung Ah Park</a>, <a href="https://publications.waset.org/search?q=Zhijie%20Zhao"> Zhijie Zhao</a>, <a href="https://publications.waset.org/search?q=Doug%20Young%20Suh"> Doug Young Suh</a>, <a href="https://publications.waset.org/search?q=Joern%20Ostermann"> Joern Ostermann</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper, we propose an effective relay communication for layered video transmission as an alternative to make the most of limited resources in a wireless communication network where loss often occurs. Relaying brings stable multimedia services to end clients, compared to multiple description coding (MDC). Also, retransmission of only parity data about one or more video layer using channel coder to the end client of the relay device is paramount to the robustness of the loss situation. Using these methods in resource-constrained environments, such as real-time user created content (UCC) with layered video transmission, can provide high-quality services even in a poor communication environment. Minimal services are also possible. The mathematical analysis shows that the proposed method reduced the probability of GOP loss rate compared to MDC and raptor code without relay. The GOP loss rate is about zero, while MDC and raptor code without relay have a GOP loss rate of 36% and 70% in case of 10% frame loss rate. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Relay%20communication" title="Relay communication">Relay communication</a>, <a href="https://publications.waset.org/search?q=Multiple%20Description%20Coding" title=" Multiple Description Coding"> Multiple Description Coding</a>, <a href="https://publications.waset.org/search?q=Scalable%20Video%20Coding" title="Scalable Video Coding">Scalable Video Coding</a> </p> <a href="https://publications.waset.org/12667/effective-relay-communication-for-scalable-video-transmission" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/12667/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/12667/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/12667/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/12667/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/12667/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/12667/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/12667/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/12667/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/12667/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/12667/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/12667.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">1437</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">264</span> Low Complexity, High Performance LDPC Codes Based on Defected Fullerene Graphs</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Ashish%20Goswami">Ashish Goswami</a>, <a href="https://publications.waset.org/search?q=Rakesh%20Sharma"> Rakesh Sharma</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper, LDPC Codes based on defected fullerene graphs have been generated. And it is found that the codes generated are fast in encoding and better in terms of error performance on AWGN Channel. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=LDPC%20Codes" title="LDPC Codes">LDPC Codes</a>, <a href="https://publications.waset.org/search?q=Fullerene%20Graphs" title=" Fullerene Graphs"> Fullerene Graphs</a>, <a href="https://publications.waset.org/search?q=Defected%20Fullerene%0AGraphs." title=" Defected Fullerene Graphs."> Defected Fullerene Graphs.</a> </p> <a href="https://publications.waset.org/12279/low-complexity-high-performance-ldpc-codes-based-on-defected-fullerene-graphs" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/12279/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/12279/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/12279/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/12279/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/12279/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/12279/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/12279/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/12279/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/12279/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/12279/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/12279.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">1768</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">263</span> Algebraic Quantum Error Correction Codes</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Ming-Chung%20Tsai">Ming-Chung Tsai</a>, <a href="https://publications.waset.org/search?q=Kuan-Peng%20Chen"> Kuan-Peng Chen</a>, <a href="https://publications.waset.org/search?q=Zheng-Yao"> Zheng-Yao</a> </p> <p class="card-text"><strong>Abstract:</strong></p> A systematic and exhaustive method based on the group structure of a unitary Lie algebra is proposed to generate an enormous number of quantum codes. With respect to the algebraic structure, the orthogonality condition, which is the central rule of generating quantum codes, is proved to be fully equivalent to the distinguishability of the elements in this structure. In addition, four types of quantum codes are classified according to the relation of the codeword operators and some initial quantum state. By linking the unitary Lie algebra with the additive group, the classical correspondences of some of these quantum codes can be rendered. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Quotient-Algebra%20Partition" title="Quotient-Algebra Partition">Quotient-Algebra Partition</a>, <a href="https://publications.waset.org/search?q=Codeword%20Spinors" title=" Codeword Spinors"> Codeword Spinors</a>, <a href="https://publications.waset.org/search?q=Basis%0ACodewords" title=" Basis Codewords"> Basis Codewords</a>, <a href="https://publications.waset.org/search?q=Syndrome%20Spinors" title=" Syndrome Spinors"> Syndrome Spinors</a> </p> <a href="https://publications.waset.org/5129/algebraic-quantum-error-correction-codes" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/5129/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/5129/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/5129/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/5129/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/5129/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/5129/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/5129/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/5129/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/5129/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/5129/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/5129.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">1414</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">262</span> Packing and Covering Radii of Linear Error-Block Codes</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Rabi%CB%86%C4%B1%20DARITI">Rabiˆı DARITI</a>, <a href="https://publications.waset.org/search?q=El%20Mamoun%20SOUIDI"> El Mamoun SOUIDI</a> </p> <p class="card-text"><strong>Abstract:</strong></p> <p>Linear error-block codes are a natural generalization of linear error correcting codes. The purpose of this paper is to generalize some results on the packing and the covering radii to the error-block case. We study their properties when a code undergoes some specific modifications and combinations with another code. We give a few bounds on the packing and the covering radii of these codes.</p> <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Linear%20error-block%20codes" title="Linear error-block codes">Linear error-block codes</a>, <a href="https://publications.waset.org/search?q=%CF%80-distance" title=" π-distance"> π-distance</a>, <a href="https://publications.waset.org/search?q=Correction%20capacity" title=" Correction capacity"> Correction capacity</a>, <a href="https://publications.waset.org/search?q=Packing%20radius" title=" Packing radius"> Packing radius</a>, <a href="https://publications.waset.org/search?q=Covering%20radius." title=" Covering radius."> Covering radius.</a> </p> <a href="https://publications.waset.org/17039/packing-and-covering-radii-of-linear-error-block-codes" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/17039/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/17039/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/17039/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/17039/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/17039/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/17039/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/17039/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/17039/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/17039/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/17039/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/17039.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">2184</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">261</span> Maximum Distance Separable b-Symbol Repeated-Root γ-Constacylic Codes over a Finite Chain Ring of Length 2</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Jamal%20Laaouine">Jamal Laaouine</a>, <a href="https://publications.waset.org/search?q=Mohammed%20Elhassani%20Charkani"> Mohammed Elhassani Charkani</a> </p> <p class="card-text"><strong>Abstract:</strong></p> <p>Let p be a prime and let b be an integer. MDS b-symbol codes are a direct generalization of MDS codes. The γ-constacyclic codes of length pˢ over the finite commutative chain ring Fₚm [u]/ < u² > had been classified into four distinct types, where is a nonzero element of the field Fₚm. Let C₃ be a code of Type 3. In this paper, we obtain the b-symbol distance db(C₃) of the code C₃. Using this result, necessary and sufficient conditions under which C₃ is an MDS b-symbol code are given.</p> <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=constacyclic%20code" title="constacyclic code">constacyclic code</a>, <a href="https://publications.waset.org/search?q=repeated-root%20code" title=" repeated-root code"> repeated-root code</a>, <a href="https://publications.waset.org/search?q=maximum%20distance%20separable" title=" maximum distance separable"> maximum distance separable</a>, <a href="https://publications.waset.org/search?q=MDS%20codes" title=" MDS codes"> MDS codes</a>, <a href="https://publications.waset.org/search?q=b-symbol%20distance" title=" b-symbol distance"> b-symbol distance</a>, <a href="https://publications.waset.org/search?q=finite%20chain%20rings" title=" finite chain rings"> finite chain rings</a> </p> <a href="https://publications.waset.org/10012327/maximum-distance-separable-b-symbol-repeated-root-gh-constacylic-codes-over-a-finite-chain-ring-of-length-2" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/10012327/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/10012327/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/10012327/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/10012327/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/10012327/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/10012327/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/10012327/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/10012327/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/10012327/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/10012327/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/10012327.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">420</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">260</span> String Searching in Dispersed Files using MDS Convolutional Codes</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=A.%20S.%20Poornima">A. S. Poornima</a>, <a href="https://publications.waset.org/search?q=R.%20Aparna"> R. Aparna</a>, <a href="https://publications.waset.org/search?q=B.%20B.%20Amberker"> B. B. Amberker</a>, <a href="https://publications.waset.org/search?q=Prashant%20Koulgi"> Prashant Koulgi</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper, we propose use of convolutional codes for file dispersal. The proposed method is comparable in complexity to the information Dispersal Algorithm proposed by M.Rabin and for particular choices of (non-binary) convolutional codes, is almost as efficient as that algorithm in terms of controlling expansion in the total storage. Further, our proposed dispersal method allows string search. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Convolutional%20codes" title="Convolutional codes">Convolutional codes</a>, <a href="https://publications.waset.org/search?q=File%20dispersal" title=" File dispersal"> File dispersal</a>, <a href="https://publications.waset.org/search?q=Filereconstruction" title=" Filereconstruction"> Filereconstruction</a>, <a href="https://publications.waset.org/search?q=Information%20Dispersal%20Algorithm" title=" Information Dispersal Algorithm"> Information Dispersal Algorithm</a>, <a href="https://publications.waset.org/search?q=String%20search." title=" String search."> String search.</a> </p> <a href="https://publications.waset.org/15345/string-searching-in-dispersed-files-using-mds-convolutional-codes" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/15345/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/15345/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/15345/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/15345/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/15345/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/15345/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/15345/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/15345/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/15345/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/15345/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/15345.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">1279</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">259</span> On Pseudo-Random and Orthogonal Binary Spreading Sequences</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Abhijit%20Mitra">Abhijit Mitra</a> </p> <p class="card-text"><strong>Abstract:</strong></p> <p>Different pseudo-random or pseudo-noise (PN) as well as orthogonal sequences that can be used as spreading codes for code division multiple access (CDMA) cellular networks or can be used for encrypting speech signals to reduce the residual intelligence are investigated. We briefly review the theoretical background for direct sequence CDMA systems and describe the main characteristics of the maximal length, Gold, Barker, and Kasami sequences. We also discuss about variable- and fixed-length orthogonal codes like Walsh- Hadamard codes. The equivalence of PN and orthogonal codes are also derived. Finally, a new PN sequence is proposed which is shown to have certain better properties than the existing codes.</p> <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Code%20division%20multiple%20access" title="Code division multiple access">Code division multiple access</a>, <a href="https://publications.waset.org/search?q=pseudo-noise%20codes" title=" pseudo-noise codes"> pseudo-noise codes</a>, <a href="https://publications.waset.org/search?q=maximal%20length" title="maximal length">maximal length</a>, <a href="https://publications.waset.org/search?q=Gold" title=" Gold"> Gold</a>, <a href="https://publications.waset.org/search?q=Barker" title=" Barker"> Barker</a>, <a href="https://publications.waset.org/search?q=Kasami" title=" Kasami"> Kasami</a>, <a href="https://publications.waset.org/search?q=Walsh-Hadamard" title=" Walsh-Hadamard"> Walsh-Hadamard</a>, <a href="https://publications.waset.org/search?q=autocorrelation" title=" autocorrelation"> autocorrelation</a>, <a href="https://publications.waset.org/search?q=crosscorrelation" title="crosscorrelation">crosscorrelation</a>, <a href="https://publications.waset.org/search?q=figure%20of%20merit." title=" figure of merit."> figure of merit.</a> </p> <a href="https://publications.waset.org/13716/on-pseudo-random-and-orthogonal-binary-spreading-sequences" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/13716/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/13716/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/13716/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/13716/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/13716/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/13716/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/13716/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/13716/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/13716/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/13716/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/13716.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">6054</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">258</span> H-ARQ Techniques for Wireless Systems with Punctured Non-Binary LDPC as FEC Code</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=%C5%81.%20Kiedrowski">Ł. Kiedrowski</a>, <a href="https://publications.waset.org/search?q=H.%20Gierszal"> H. Gierszal</a>, <a href="https://publications.waset.org/search?q=W.%20Ho%C5%82ubowicz"> W. Hołubowicz</a> </p> <p class="card-text"><strong>Abstract:</strong></p> <p>This paper presents the H-ARQ techniques comparison for OFDM systems with a new family of non-binary LDPC codes which has been developed within the EU FP7 DAVINCI project. The punctured NB-LDPC codes have been used in a simulated model of the transmission system. The link level performance has been evaluated in terms of spectral efficiency, codeword error rate and average number of retransmissions. The NB-LDPC codes can be easily and effective implemented with different methods of the retransmission needed if correct decoding of a codeword failed. Here the Optimal Symbol Selection method is proposed as a Chase Combining technique.</p> <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=H-ARQ" title="H-ARQ">H-ARQ</a>, <a href="https://publications.waset.org/search?q=LDPC" title=" LDPC"> LDPC</a>, <a href="https://publications.waset.org/search?q=Non-Binary" title=" Non-Binary"> Non-Binary</a>, <a href="https://publications.waset.org/search?q=Punctured%20Codes." title=" Punctured Codes."> Punctured Codes.</a> </p> <a href="https://publications.waset.org/5228/h-arq-techniques-for-wireless-systems-with-punctured-non-binary-ldpc-as-fec-code" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/5228/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/5228/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/5228/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/5228/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/5228/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/5228/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/5228/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/5228/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/5228/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/5228/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/5228.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">1734</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">257</span> Performance Evaluation of One and Two Dimensional Prime Codes for Optical Code Division Multiple Access Systems</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Gurjit%20Kaur">Gurjit Kaur</a>, <a href="https://publications.waset.org/search?q=Neena%20Gupta"> Neena Gupta</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper, we have analyzed and compared the performance of various coding schemes. The basic ID prime sequence codes are unique in only dimension, i.e. time slots, whereas 2D coding techniques are not unique by their time slots but with their wavelengths also. In this research, we have evaluated and compared the performance of 1D and 2D coding techniques constructed using prime sequence coding pattern for Optical Code Division Multiple Access (OCDMA) system on a single platform. Analysis shows that 2D prime code supports lesser number of active users than 1D codes, but they are having large code family and are the most secure codes compared to other codes. The performance of all these codes is analyzed on basis of number of active users supported at a Bit Error Rate (BER) of 10-9. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=CDMA" title="CDMA">CDMA</a>, <a href="https://publications.waset.org/search?q=OCDMA" title=" OCDMA"> OCDMA</a>, <a href="https://publications.waset.org/search?q=BER" title=" BER"> BER</a>, <a href="https://publications.waset.org/search?q=OOC" title=" OOC"> OOC</a>, <a href="https://publications.waset.org/search?q=PC" title=" PC"> PC</a>, <a href="https://publications.waset.org/search?q=EPC" title=" EPC"> EPC</a>, <a href="https://publications.waset.org/search?q=MPC" title=" MPC"> MPC</a>, <a href="https://publications.waset.org/search?q=2-D%20PC%2FPC" title=" 2-D PC/PC"> 2-D PC/PC</a>, <a href="https://publications.waset.org/search?q=%CE%BBc" title=" λc"> λc</a>, <a href="https://publications.waset.org/search?q=%CE%BBa." title=" λa."> λa.</a> </p> <a href="https://publications.waset.org/10004999/performance-evaluation-of-one-and-two-dimensional-prime-codes-for-optical-code-division-multiple-access-systems" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/10004999/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/10004999/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/10004999/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/10004999/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/10004999/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/10004999/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/10004999/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/10004999/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/10004999/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/10004999/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/10004999.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">1123</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">256</span> 2D Bar Codes Reading: Solutions for Camera Phones</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Hao%20Wang">Hao Wang</a>, <a href="https://publications.waset.org/search?q=Yanming%20Zou"> Yanming Zou</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Two-dimensional (2D) bar codes were designed to carry significantly more data with higher information density and robustness than its 1D counterpart. Thanks to the popular combination of cameras and mobile phones, it will naturally bring great commercial value to use the camera phone for 2D bar code reading. This paper addresses the problem of specific 2D bar code design for mobile phones and introduces a low-level encoding method of matrix codes. At the same time, we propose an efficient scheme for 2D bar codes decoding, of which the effort is put on solutions of the difficulties introduced by low image quality that is very common in bar code images taken by a phone camera. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=2D%20bar%20code%20reading" title="2D bar code reading">2D bar code reading</a>, <a href="https://publications.waset.org/search?q=camera%20phone" title=" camera phone"> camera phone</a>, <a href="https://publications.waset.org/search?q=low-level%0Aencoding" title=" low-level encoding"> low-level encoding</a>, <a href="https://publications.waset.org/search?q=mixed%20model" title=" mixed model"> mixed model</a> </p> <a href="https://publications.waset.org/5194/2d-bar-codes-reading-solutions-for-camera-phones" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/5194/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/5194/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/5194/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/5194/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/5194/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/5194/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/5194/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/5194/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/5194/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/5194/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/5194.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">1848</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">255</span> Performance Verification of Seismic Design Codes for RC Frames</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Payam%20Asadi">Payam Asadi</a>, <a href="https://publications.waset.org/search?q=Ali%20Bakhshi"> Ali Bakhshi</a> </p> <p class="card-text"><strong>Abstract:</strong></p> <p>In this study, a frame work for verification of famous seismic codes is utilized. To verify the seismic codes performance, damage quantity of RC frames is compared with the target performance. Due to the randomness property of seismic design and earthquake loads excitation, in this paper, fragility curves are developed. These diagrams are utilized to evaluate performance level of structures which are designed by the seismic codes. These diagrams further illustrate the effect of load combination and reduction factors of codes on probability of damage exceedance. Two types of structures; very high important structures with high ductility and medium important structures with intermediate ductility are designed by different seismic codes. The Results reveal that usually lower damage ratio generate lower probability of exceedance. In addition, the findings indicate that there are buildings with higher quantity of bars which they have higher probability of damage exceedance. Life-cycle cost analysis utilized for comparison and final decision making process.</p> <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=RC%20frame" title="RC frame">RC frame</a>, <a href="https://publications.waset.org/search?q=fragility%20curve" title=" fragility curve"> fragility curve</a>, <a href="https://publications.waset.org/search?q=performance-base%20design" title=" performance-base design"> performance-base design</a>, <a href="https://publications.waset.org/search?q=life-cycle%20cost%20analyses" title=" life-cycle cost analyses"> life-cycle cost analyses</a>, <a href="https://publications.waset.org/search?q=seismic%20design%20codes." title=" seismic design codes."> seismic design codes.</a> </p> <a href="https://publications.waset.org/12701/performance-verification-of-seismic-design-codes-for-rc-frames" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/12701/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/12701/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/12701/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/12701/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/12701/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/12701/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/12701/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/12701/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/12701/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/12701/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/12701.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">1939</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">254</span> Impact of the Decoder Connection Schemes on Iterative Decoding of GPCB Codes</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Fouad%20Ayoub">Fouad Ayoub</a>, <a href="https://publications.waset.org/search?q=Mohammed%20Lahmer"> Mohammed Lahmer</a>, <a href="https://publications.waset.org/search?q=Mostafa%20Belkasmi"> Mostafa Belkasmi</a>, <a href="https://publications.waset.org/search?q=El%20Houssine%20Bouyakhf"> El Houssine Bouyakhf</a> </p> <p class="card-text"><strong>Abstract:</strong></p> <p>In this paper we present a study of the impact of connection schemes on the performance of iterative decoding of Generalized Parallel Concatenated block (GPCB) constructed from one step majority logic decodable (OSMLD) codes and we propose a new connection scheme for decoding them. All iterative decoding connection schemes use a soft-input soft-output threshold decoding algorithm as a component decoder. Numerical result for GPCB codes transmitted over Additive White Gaussian Noise (AWGN) channel are provided. It will show that the proposed scheme is better than Hagenauer-s scheme and Lucas-s scheme [1] and slightly better than the Pyndiah-s scheme.</p> <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Generalized%20parallel%20concatenated%20block%20codes" title="Generalized parallel concatenated block codes">Generalized parallel concatenated block codes</a>, <a href="https://publications.waset.org/search?q=OSMLD%20codes" title=" OSMLD codes"> OSMLD codes</a>, <a href="https://publications.waset.org/search?q=threshold%20decoding" title=" threshold decoding"> threshold decoding</a>, <a href="https://publications.waset.org/search?q=iterative%20decoding%20scheme" title=" iterative decoding scheme"> iterative decoding scheme</a>, <a href="https://publications.waset.org/search?q=and%20performance." title=" and performance."> and performance.</a> </p> <a href="https://publications.waset.org/15687/impact-of-the-decoder-connection-schemes-on-iterative-decoding-of-gpcb-codes" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/15687/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/15687/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/15687/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/15687/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/15687/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/15687/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/15687/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/15687/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/15687/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/15687/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/15687.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">1746</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">253</span> Variable Rate Superorthogonal Turbo Code with the OVSF Code Tree</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Insah%20Bhurtah">Insah Bhurtah</a>, <a href="https://publications.waset.org/search?q=P.%20Clarel%20Catherine"> P. Clarel Catherine</a>, <a href="https://publications.waset.org/search?q=K.%20M.%20Sunjiv%20Soyjaudah"> K. M. Sunjiv Soyjaudah</a> </p> <p class="card-text"><strong>Abstract:</strong></p> <p>When using modern Code Division Multiple Access (CDMA) in mobile communications, the user must be able to vary the transmission rate of users to allocate bandwidth efficiently. In this work, Orthogonal Variable Spreading Factor (OVSF) codes are used with the same principles applied in a low-rate superorthogonal turbo code due to their variable-length properties. The introduced system is the Variable Rate Superorthogonal Turbo Code (VRSTC) where puncturing is not performed on the encoder’s final output but rather before selecting the output to achieve higher rates. Due to bandwidth expansion, the codes outperform an ordinary turbo code in the AWGN channel. Simulations results show decreased performance compared to those obtained with the employment of Walsh-Hadamard codes. However, with OVSF codes, the VRSTC system keeps the orthogonality of codewords whilst producing variable rate codes contrary to Walsh-Hadamard codes where puncturing is usually performed on the final output.</p> <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=CDMA" title="CDMA">CDMA</a>, <a href="https://publications.waset.org/search?q=MAP%20Decoding" title=" MAP Decoding"> MAP Decoding</a>, <a href="https://publications.waset.org/search?q=OVSF" title=" OVSF"> OVSF</a>, <a href="https://publications.waset.org/search?q=Superorthogonal%20Turbo%20Code." title=" Superorthogonal Turbo Code. "> Superorthogonal Turbo Code. </a> </p> <a href="https://publications.waset.org/9996956/variable-rate-superorthogonal-turbo-code-with-the-ovsf-code-tree" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/9996956/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/9996956/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/9996956/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/9996956/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/9996956/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/9996956/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/9996956/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/9996956/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/9996956/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/9996956/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/9996956.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">2176</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">252</span> Reducing Power in Error Correcting Code using Genetic Algorithm </h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Heesung%20Lee">Heesung Lee</a>, <a href="https://publications.waset.org/search?q=Joonkyung%20Sung"> Joonkyung Sung</a>, <a href="https://publications.waset.org/search?q=Euntai%20Kim">Euntai Kim</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper proposes a method which reduces power consumption in single-error correcting, double error-detecting checker circuits that perform memory error correction code. Power is minimized with little or no impact on area and delay, using the degrees of freedom in selecting the parity check matrix of the error correcting codes. The genetic algorithm is employed to solve the non linear power optimization problem. The method is applied to two commonly used SEC-DED codes: standard Hamming and odd column weight Hsiao codes. Experiments were performed to show the performance of the proposed method. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Error%20correcting%20codes" title="Error correcting codes">Error correcting codes</a>, <a href="https://publications.waset.org/search?q=genetic%20algorithm" title=" genetic algorithm"> genetic algorithm</a>, <a href="https://publications.waset.org/search?q=non-linearpower%20optimization" title=" non-linearpower optimization"> non-linearpower optimization</a>, <a href="https://publications.waset.org/search?q=Hamming%20code" title=" Hamming code"> Hamming code</a>, <a href="https://publications.waset.org/search?q=Hsiao%20code." title=" Hsiao code."> Hsiao code.</a> </p> <a href="https://publications.waset.org/13769/reducing-power-in-error-correcting-code-using-genetic-algorithm" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/13769/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/13769/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/13769/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/13769/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/13769/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/13769/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/13769/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/13769/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/13769/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/13769/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/13769.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">2185</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">251</span> ReSeT : Reverse Engineering System Requirements Tool</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Rosziati%20Ibrahim">Rosziati Ibrahim</a>, <a href="https://publications.waset.org/search?q=Tiu%20Kian%20Yong"> Tiu Kian Yong</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Reverse Engineering is a very important process in Software Engineering. It can be performed backwards from system development life cycle (SDLC) in order to get back the source data or representations of a system through analysis of its structure, function and operation. We use reverse engineering to introduce an automatic tool to generate system requirements from its program source codes. The tool is able to accept the Cµ programming source codes, scan the source codes line by line and parse the codes to parser. Then, the engine of the tool will be able to generate system requirements for that specific program to facilitate reuse and enhancement of the program. The purpose of producing the tool is to help recovering the system requirements of any system when the system requirements document (SRD) does not exist due to undocumented support of the system. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=System%20Requirements" title="System Requirements">System Requirements</a>, <a href="https://publications.waset.org/search?q=Reverse%20Engineering" title=" Reverse Engineering"> Reverse Engineering</a>, <a href="https://publications.waset.org/search?q=SourceCodes." title=" SourceCodes."> SourceCodes.</a> </p> <a href="https://publications.waset.org/9558/reset-reverse-engineering-system-requirements-tool" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/9558/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/9558/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/9558/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/9558/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/9558/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/9558/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/9558/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/9558/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/9558/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/9558/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/9558.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">1674</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">250</span> Metaheuristic Algorithms for Decoding Binary Linear Codes</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Hassan%20Berbia">Hassan Berbia</a>, <a href="https://publications.waset.org/search?q=Faissal%20Elbouanani"> Faissal Elbouanani</a>, <a href="https://publications.waset.org/search?q=Rahal%20Romadi"> Rahal Romadi</a>, <a href="https://publications.waset.org/search?q=Mostafa%20Belkasmi"> Mostafa Belkasmi</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper introduces two decoders for binary linear codes based on Metaheuristics. The first one uses a genetic algorithm and the second is based on a combination genetic algorithm with a feed forward neural network. The decoder based on the genetic algorithms (DAG) applied to BCH and convolutional codes give good performances compared to Chase-2 and Viterbi algorithm respectively and reach the performances of the OSD-3 for some Residue Quadratic (RQ) codes. This algorithm is less complex for linear block codes of large block length; furthermore their performances can be improved by tuning the decoder-s parameters, in particular the number of individuals by population and the number of generations. In the second algorithm, the search space, in contrast to DAG which was limited to the code word space, now covers the whole binary vector space. It tries to elude a great number of coding operations by using a neural network. This reduces greatly the complexity of the decoder while maintaining comparable performances. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Block%20code" title="Block code">Block code</a>, <a href="https://publications.waset.org/search?q=decoding" title=" decoding"> decoding</a>, <a href="https://publications.waset.org/search?q=methaheuristic" title=" methaheuristic"> methaheuristic</a>, <a href="https://publications.waset.org/search?q=genetic%20algorithm" title=" genetic algorithm"> genetic algorithm</a>, <a href="https://publications.waset.org/search?q=neural%20network" title="neural network">neural network</a> </p> <a href="https://publications.waset.org/13439/metaheuristic-algorithms-for-decoding-binary-linear-codes" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/13439/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/13439/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/13439/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/13439/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/13439/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/13439/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/13439/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/13439/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/13439/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/13439/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/13439.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">2081</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">249</span> Algebraic Approach for the Reconstruction of Linear and Convolutional Error Correcting Codes</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Johann%20Barbier">Johann Barbier</a>, <a href="https://publications.waset.org/search?q=Guillaume%20Sicot"> Guillaume Sicot</a>, <a href="https://publications.waset.org/search?q=Sebastien%20Houcke"> Sebastien Houcke</a> </p> <p class="card-text"><strong>Abstract:</strong></p> <p>In this paper we present a generic approach for the problem of the blind estimation of the parameters of linear and convolutional error correcting codes. In a non-cooperative context, an adversary has only access to the noised transmission he has intercepted. The intercepter has no knowledge about the parameters used by the legal users. So, before having acess to the information he has first to blindly estimate the parameters of the error correcting code of the communication. The presented approach has the main advantage that the problem of reconstruction of such codes can be expressed in a very simple way. This allows us to evaluate theorical bounds on the complexity of the reconstruction process but also bounds on the estimation rate. We show that some classical reconstruction techniques are optimal and also explain why some of them have theorical complexities greater than these experimentally observed.</p> <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Blind%20estimation%20parameters" title="Blind estimation parameters">Blind estimation parameters</a>, <a href="https://publications.waset.org/search?q=error%20correcting%20codes" title=" error correcting codes"> error correcting codes</a>, <a href="https://publications.waset.org/search?q=non-cooperative%20context" title=" non-cooperative context"> non-cooperative context</a>, <a href="https://publications.waset.org/search?q=reconstruction%20algorithm" title=" reconstruction algorithm"> reconstruction algorithm</a> </p> <a href="https://publications.waset.org/48/algebraic-approach-for-the-reconstruction-of-linear-and-convolutional-error-correcting-codes" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/48/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/48/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/48/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/48/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/48/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/48/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/48/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/48/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/48/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/48/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/48.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">2197</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">248</span> Array Data Transformation for Source Code Obfuscation</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=S.%20Praveen"> S. Praveen</a>, <a href="https://publications.waset.org/search?q=P.%20Sojan%20Lal"> P. Sojan Lal</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Obfuscation is a low cost software protection methodology to avoid reverse engineering and re engineering of applications. Source code obfuscation aims in obscuring the source code to hide the functionality of the codes. This paper proposes an Array data transformation in order to obfuscate the source code which uses arrays. The applications using the proposed data structures force the programmer to obscure the logic manually. It makes the developed obscured codes hard to reverse engineer and also protects the functionality of the codes. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Reverse%20Engineering" title="Reverse Engineering">Reverse Engineering</a>, <a href="https://publications.waset.org/search?q=Source%20Code%20Obfuscation." title=" Source Code Obfuscation."> Source Code Obfuscation.</a> </p> <a href="https://publications.waset.org/2537/array-data-transformation-for-source-code-obfuscation" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/2537/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/2537/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/2537/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/2537/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/2537/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/2537/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/2537/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/2537/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/2537/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/2537/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/2537.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">2036</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">247</span> An Investigation on Efficient Spreading Codes for Transmitter Based Techniques to Mitigate MAI and ISI in TDD/CDMA Downlink</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Abhijit%20Mitra">Abhijit Mitra</a>, <a href="https://publications.waset.org/search?q=C.%20Ardil"> C. Ardil</a> </p> <p class="card-text"><strong>Abstract:</strong></p> <p>We investigate efficient spreading codes for transmitter based techniques of code division multiple access (CDMA) systems. The channel is considered to be known at the transmitter which is usual in a time division duplex (TDD) system where the channel is assumed to be the same on uplink and downlink. For such a TDD/CDMA system, both bitwise and blockwise multiuser transmission schemes are taken up where complexity is transferred to the transmitter side so that the receiver has minimum complexity. Different spreading codes are considered at the transmitter to spread the signal efficiently over the entire spectrum. The bit error rate (BER) curves portray the efficiency of the codes in presence of multiple access interference (MAI) as well as inter symbol interference (ISI).</p> <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Code%20division%20multiple%20access" title="Code division multiple access">Code division multiple access</a>, <a href="https://publications.waset.org/search?q=time%20division%20duplex" title=" time division duplex"> time division duplex</a>, <a href="https://publications.waset.org/search?q=transmitter%20technique" title="transmitter technique">transmitter technique</a>, <a href="https://publications.waset.org/search?q=precoding" title=" precoding"> precoding</a>, <a href="https://publications.waset.org/search?q=pre-rake" title=" pre-rake"> pre-rake</a>, <a href="https://publications.waset.org/search?q=rake" title=" rake"> rake</a>, <a href="https://publications.waset.org/search?q=spreading%20code." title=" spreading code."> spreading code.</a> </p> <a href="https://publications.waset.org/10076/an-investigation-on-efficient-spreading-codes-for-transmitter-based-techniques-to-mitigate-mai-and-isi-in-tddcdma-downlink" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/10076/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/10076/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/10076/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/10076/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/10076/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/10076/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/10076/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/10076/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/10076/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/10076/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/10076.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">1474</span> </span> </div> </div> <ul class="pagination"> <li class="page-item disabled"><span class="page-link">&lsaquo;</span></li> <li class="page-item active"><span class="page-link">1</span></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/search?q=Raptor%20codes&page=2">2</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/search?q=Raptor%20codes&page=3">3</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/search?q=Raptor%20codes&page=4">4</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/search?q=Raptor%20codes&page=5">5</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/search?q=Raptor%20codes&page=6">6</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/search?q=Raptor%20codes&page=7">7</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/search?q=Raptor%20codes&page=8">8</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/search?q=Raptor%20codes&page=9">9</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/search?q=Raptor%20codes&page=10">10</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/search?q=Raptor%20codes&page=2" rel="next">&rsaquo;</a></li> </ul> </div> </main> <footer> <div id="infolinks" class="pt-3 pb-2"> <div class="container"> <div style="background-color:#f5f5f5;" class="p-3"> <div class="row"> <div class="col-md-2"> <ul class="list-unstyled"> About <li><a href="https://waset.org/page/support">About Us</a></li> <li><a href="https://waset.org/page/support#legal-information">Legal</a></li> <li><a target="_blank" rel="nofollow" href="https://publications.waset.org/static/files/WASET-16th-foundational-anniversary.pdf">WASET celebrates its 16th foundational anniversary</a></li> </ul> </div> <div class="col-md-2"> <ul class="list-unstyled"> Account <li><a href="https://waset.org/profile">My Account</a></li> </ul> </div> <div class="col-md-2"> <ul class="list-unstyled"> Explore <li><a href="https://waset.org/disciplines">Disciplines</a></li> <li><a href="https://waset.org/conferences">Conferences</a></li> <li><a href="https://waset.org/conference-programs">Conference Program</a></li> <li><a href="https://waset.org/committees">Committees</a></li> <li><a href="https://publications.waset.org">Publications</a></li> </ul> </div> <div class="col-md-2"> <ul class="list-unstyled"> Research <li><a href="https://publications.waset.org/abstracts">Abstracts</a></li> <li><a href="https://publications.waset.org">Periodicals</a></li> <li><a href="https://publications.waset.org/archive">Archive</a></li> </ul> </div> <div class="col-md-2"> <ul class="list-unstyled"> Open Science <li><a target="_blank" rel="nofollow" href="https://publications.waset.org/static/files/Open-Science-Philosophy.pdf">Open Science Philosophy</a></li> <li><a target="_blank" rel="nofollow" href="https://publications.waset.org/static/files/Open-Science-Award.pdf">Open Science Award</a></li> <li><a target="_blank" rel="nofollow" href="https://publications.waset.org/static/files/Open-Society-Open-Science-and-Open-Innovation.pdf">Open Innovation</a></li> <li><a target="_blank" rel="nofollow" href="https://publications.waset.org/static/files/Postdoctoral-Fellowship-Award.pdf">Postdoctoral Fellowship Award</a></li> <li><a target="_blank" rel="nofollow" href="https://publications.waset.org/static/files/Scholarly-Research-Review.pdf">Scholarly Research Review</a></li> </ul> </div> <div class="col-md-2"> <ul class="list-unstyled"> Support <li><a href="https://waset.org/page/support">Support</a></li> <li><a href="https://waset.org/profile/messages/create">Contact Us</a></li> <li><a href="https://waset.org/profile/messages/create">Report Abuse</a></li> </ul> </div> </div> </div> </div> </div> <div class="container text-center"> <hr style="margin-top:0;margin-bottom:.3rem;"> <a href="https://creativecommons.org/licenses/by/4.0/" target="_blank" class="text-muted small">Creative Commons Attribution 4.0 International License</a> <div id="copy" class="mt-2">© 2024 World Academy of Science, Engineering and Technology</div> </div> </footer> <a href="javascript:" id="return-to-top"><i class="fas fa-arrow-up"></i></a> <div class="modal" id="modal-template"> <div class="modal-dialog"> <div class="modal-content"> <div class="row m-0 mt-1"> <div class="col-md-12"> <button type="button" class="close" data-dismiss="modal" aria-label="Close"><span aria-hidden="true">×</span></button> </div> </div> <div class="modal-body"></div> </div> </div> </div> <script src="https://cdn.waset.org/static/plugins/jquery-3.3.1.min.js"></script> <script src="https://cdn.waset.org/static/plugins/bootstrap-4.2.1/js/bootstrap.bundle.min.js"></script> <script src="https://cdn.waset.org/static/js/site.js?v=150220211556"></script> <script> jQuery(document).ready(function() { /*jQuery.get("https://publications.waset.org/xhr/user-menu", function (response) { jQuery('#mainNavMenu').append(response); });*/ jQuery.get({ url: "https://publications.waset.org/xhr/user-menu", cache: false }).then(function(response){ jQuery('#mainNavMenu').append(response); }); }); </script> </body> </html>