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: channel codes</title> <meta name="description" content="Search results for: channel codes"> <meta name="keywords" content="channel 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="channel 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/abstracts/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="channel 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> 1839</div> </div> </div> </div> <h1 class="mt-3 mb-3 text-center" style="font-size:1.6rem;">Search results for: channel codes</h1> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">1839</span> Analysis of Joint Source Channel LDPC Coding for Correlated Sources Transmission over Noisy Channels</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Marwa%20Ben%20Abdessalem">Marwa Ben Abdessalem</a>, <a href="https://publications.waset.org/abstracts/search?q=Amin%20Zribi"> Amin Zribi</a>, <a href="https://publications.waset.org/abstracts/search?q=Ammar%20Bouall%C3%A8gue"> Ammar Bouallègue</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper, a Joint Source Channel coding scheme based on LDPC codes is investigated. We consider two concatenated LDPC codes, one allows to compress a correlated source and the second to protect it against channel degradations. The original information can be reconstructed at the receiver by a joint decoder, where the source decoder and the channel decoder run in parallel by transferring extrinsic information. We investigate the performance of the JSC LDPC code in terms of Bit-Error Rate (BER) in the case of transmission over an Additive White Gaussian Noise (AWGN) channel, and for different source and channel rate parameters. We emphasize how JSC LDPC presents a performance tradeoff depending on the channel state and on the source correlation. We show that, the JSC LDPC is an efficient solution for a relatively low Signal-to-Noise Ratio (SNR) channel, especially with highly correlated sources. Finally, a source-channel rate optimization has to be applied to guarantee the best JSC LDPC system performance for a given channel. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=AWGN%20channel" title="AWGN channel">AWGN channel</a>, <a href="https://publications.waset.org/abstracts/search?q=belief%20propagation" title=" belief propagation"> belief propagation</a>, <a href="https://publications.waset.org/abstracts/search?q=joint%20source%20channel%20coding" title=" joint source channel coding"> joint source channel coding</a>, <a href="https://publications.waset.org/abstracts/search?q=LDPC%20codes" title=" LDPC codes"> LDPC codes</a> </p> <a href="https://publications.waset.org/abstracts/62721/analysis-of-joint-source-channel-ldpc-coding-for-correlated-sources-transmission-over-noisy-channels" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/62721.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">357</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">1838</span> A Characterization of Skew Cyclic Code with Complementary Dual</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Eusebio%20Jr.%20Lina">Eusebio Jr. Lina</a>, <a href="https://publications.waset.org/abstracts/search?q=Ederlina%20Nocon"> Ederlina Nocon</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Cyclic codes are a fundamental subclass of linear codes that enjoy a very interesting algebraic structure. The class of skew cyclic codes (or θ-cyclic codes) is a generalization of the notion of cyclic codes. This a very large class of linear codes which can be used to systematically search for codes with good properties. A linear code with complementary dual (LCD code) is a linear code C satisfying C ∩ C^⊥ = {0}. This subclass of linear codes provides an optimum linear coding solution for a two-user binary adder channel and plays an important role in countermeasures to passive and active side-channel analyses on embedded cryptosystems. This paper aims to identify LCD codes from the class of skew cyclic codes. Let F_q be a finite field of order q, and θ be an automorphism of F_q. Some conditions for a skew cyclic code to be LCD were given. To this end, the properties of a noncommutative skew polynomial ring F_q[x, θ] of automorphism type were revisited, and the algebraic structure of skew cyclic code using its skew polynomial representation was examined. Using the result that skew cyclic codes are left ideals of the ring F_q[x, θ]/⟨x^n-1⟩, a characterization of a skew cyclic LCD code of length n was derived. A necessary condition for a skew cyclic code to be LCD was also given. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=LCD%20cyclic%20codes" title="LCD cyclic codes">LCD cyclic codes</a>, <a href="https://publications.waset.org/abstracts/search?q=skew%20cyclic%20LCD%20codes" title=" skew cyclic LCD codes"> skew cyclic LCD codes</a>, <a href="https://publications.waset.org/abstracts/search?q=skew%20cyclic%20complementary%20dual%20codes" title=" skew cyclic complementary dual codes"> skew cyclic complementary dual codes</a>, <a href="https://publications.waset.org/abstracts/search?q=theta-cyclic%20codes%20with%20complementary%20duals" title=" theta-cyclic codes with complementary duals"> theta-cyclic codes with complementary duals</a> </p> <a href="https://publications.waset.org/abstracts/56575/a-characterization-of-skew-cyclic-code-with-complementary-dual" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/56575.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">345</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">1837</span> Performance of VSAT MC-CDMA System Using LDPC and Turbo Codes over Multipath Channel</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Hassan%20El%20Ghazi">Hassan El Ghazi</a>, <a href="https://publications.waset.org/abstracts/search?q=Mohammed%20El%20Jourmi"> Mohammed El Jourmi</a>, <a href="https://publications.waset.org/abstracts/search?q=Tayeb%20Sadiki"> Tayeb Sadiki</a>, <a href="https://publications.waset.org/abstracts/search?q=Esmail%20Ahouzi"> Esmail Ahouzi</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The purpose of this paper is to model and analyze a geostationary satellite communication system based on VSAT network and Multicarrier CDMA system scheme which presents a combination of multicarrier modulation scheme and CDMA concepts. In this study the channel coding strategies (Turbo codes and LDPC codes) are adopted to achieve good performance due to iterative decoding. The envisaged system is examined for a transmission over Multipath channel with use of Ku band in the uplink case. The simulation results are obtained for each different case. The performance of the system is given in terms of Bit Error Rate (BER) and energy per bit to noise power spectral density ratio (Eb/N0). The performance results of designed system shown that the communication system coded with LDPC codes can achieve better error rate performance compared to VSAT MC-CDMA system coded with Turbo codes. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=satellite%20communication" title="satellite communication">satellite communication</a>, <a href="https://publications.waset.org/abstracts/search?q=VSAT%20Network" title=" VSAT Network"> VSAT Network</a>, <a href="https://publications.waset.org/abstracts/search?q=MC-CDMA" title=" MC-CDMA"> MC-CDMA</a>, <a href="https://publications.waset.org/abstracts/search?q=LDPC%20codes" title=" LDPC codes"> LDPC codes</a>, <a href="https://publications.waset.org/abstracts/search?q=turbo%20codes" title=" turbo codes"> turbo codes</a>, <a href="https://publications.waset.org/abstracts/search?q=uplink" title=" uplink"> uplink</a> </p> <a href="https://publications.waset.org/abstracts/20041/performance-of-vsat-mc-cdma-system-using-ldpc-and-turbo-codes-over-multipath-channel" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/20041.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">504</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">1836</span> Unequal Error Protection of VQ Image Transmission System </h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Khelifi%20Mustapha">Khelifi Mustapha</a>, <a href="https://publications.waset.org/abstracts/search?q=A.%20Moulay%20lakhdar"> A. Moulay lakhdar</a>, <a href="https://publications.waset.org/abstracts/search?q=I.%20Elawady"> I. Elawady </a> </p> <p class="card-text"><strong>Abstract:</strong></p> We will study the unequal error protection for VQ image. We have used the Reed Solomon (RS) Codes as Channel coding because they offer better performance in terms of channel error correction over a binary output channel. One such channel (binary input and output) should be considered if it is the case of the application layer, because it includes all the features of the layers located below and on the what it is usually not feasible to make changes. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=vector%20quantization" title="vector quantization">vector quantization</a>, <a href="https://publications.waset.org/abstracts/search?q=channel%20error%20correction" title=" channel error correction"> channel error correction</a>, <a href="https://publications.waset.org/abstracts/search?q=Reed-Solomon%20channel%20coding" title=" Reed-Solomon channel coding"> Reed-Solomon channel coding</a>, <a href="https://publications.waset.org/abstracts/search?q=application" title=" application"> application</a> </p> <a href="https://publications.waset.org/abstracts/21372/unequal-error-protection-of-vq-image-transmission-system" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/21372.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">365</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">1835</span> Low Density Parity Check Codes</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Kassoul%20Ilyes">Kassoul Ilyes</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The field of error correcting codes has been revolutionized by the introduction of iteratively decoded codes. Among these, LDPC codes are now a preferred solution thanks to their remarkable performance and low complexity. The binary version of LDPC codes showed even better performance, although it’s decoding introduced greater complexity. This thesis studies the performance of binary LDPC codes using simplified weighted decisions. Information is transported between a transmitter and a receiver by digital transmission systems, either by propagating over a radio channel or also by using a transmission medium such as the transmission line. The purpose of the transmission system is then to carry the information from the transmitter to the receiver as reliably as possible. These codes have not generated enough interest within the coding theory community. This forgetfulness will last until the introduction of Turbo-codes and the iterative principle. Then it was proposed to adopt Pearl's Belief Propagation (BP) algorithm for decoding these codes. Subsequently, Luby introduced irregular LDPC codes characterized by a parity check matrix. And finally, we study simplifications on binary LDPC codes. Thus, we propose a method to make the exact calculation of the APP simpler. This method leads to simplifying the implementation of the system. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=LDPC" title="LDPC">LDPC</a>, <a href="https://publications.waset.org/abstracts/search?q=parity%20check%20matrix" title=" parity check matrix"> parity check matrix</a>, <a href="https://publications.waset.org/abstracts/search?q=5G" title=" 5G"> 5G</a>, <a href="https://publications.waset.org/abstracts/search?q=BER" title=" BER"> BER</a>, <a href="https://publications.waset.org/abstracts/search?q=SNR" title=" SNR"> SNR</a> </p> <a href="https://publications.waset.org/abstracts/145269/low-density-parity-check-codes" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/145269.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">153</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">1834</span> Mitigation of Interference in Satellite Communications Systems via a Cross-Layer Coding Technique</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Mario%20A.%20Blanco">Mario A. Blanco</a>, <a href="https://publications.waset.org/abstracts/search?q=Nicholas%20Burkhardt"> Nicholas Burkhardt</a> </p> <p class="card-text"><strong>Abstract:</strong></p> An important problem in satellite communication systems which operate in the Ka and EHF frequency bands consists of the overall degradation in link performance of mobile terminals due to various types of degradations in the link/channel, such as fading, blockage of the link to the satellite (especially in urban environments), intentional as well as other types of interference, etc. In this paper, we focus primarily on the interference problem, and we develop a very efficient and cost-effective solution based on the use of fountain codes. We first introduce a satellite communications (SATCOM) terminal uplink interference channel model that is classically used against communication systems that use spread-spectrum waveforms. We then consider the use of fountain codes, with focus on Raptor codes, as our main mitigation technique to combat the degradation in link/receiver performance due to the interference signal. The performance of the receiver is obtained in terms of average probability of bit and message error rate as a function of bit energy-to-noise density ratio, Eb/N0, and other parameters of interest, via a combination of analysis and computer simulations, and we show that the use of fountain codes is extremely effective in overcoming the effects of intentional interference on the performance of the receiver and associated communication links. We then show this technique can be extended to mitigate other types of SATCOM channel degradations, such as those caused by channel fading, shadowing, and hard-blockage of the uplink signal. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=SATCOM" title="SATCOM">SATCOM</a>, <a href="https://publications.waset.org/abstracts/search?q=interference%20mitigation" title=" interference mitigation"> interference mitigation</a>, <a href="https://publications.waset.org/abstracts/search?q=fountain%20codes" title=" fountain codes"> fountain codes</a>, <a href="https://publications.waset.org/abstracts/search?q=turbo%20codes" title=" turbo codes"> turbo codes</a>, <a href="https://publications.waset.org/abstracts/search?q=cross-layer" title=" cross-layer"> cross-layer</a> </p> <a href="https://publications.waset.org/abstracts/48509/mitigation-of-interference-in-satellite-communications-systems-via-a-cross-layer-coding-technique" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/48509.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">361</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">1833</span> Tailoring the Parameters of the Quantum MDS Codes Constructed from Constacyclic Codes</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Jaskarn%20Singh%20Bhullar">Jaskarn Singh Bhullar</a>, <a href="https://publications.waset.org/abstracts/search?q=Divya%20Taneja"> Divya Taneja</a>, <a href="https://publications.waset.org/abstracts/search?q=Manish%20Gupta"> Manish Gupta</a>, <a href="https://publications.waset.org/abstracts/search?q=Rajesh%20Kumar%20Narula"> Rajesh Kumar Narula</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The existence conditions of dual containing constacyclic codes have opened a new path for finding quantum maximum distance separable (MDS) codes. Using these conditions parameters of length n=(q²+1)/2 quantum MDS codes were improved. A class of quantum MDS codes of length n=(q²+q+1)/h, where h>1 is an odd prime, have also been constructed having large minimum distance and these codes are new in the sense as these are not available in the literature. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=hermitian%20construction" title="hermitian construction">hermitian construction</a>, <a href="https://publications.waset.org/abstracts/search?q=constacyclic%20codes" title=" constacyclic codes"> constacyclic codes</a>, <a href="https://publications.waset.org/abstracts/search?q=cyclotomic%20cosets" title=" cyclotomic cosets"> cyclotomic cosets</a>, <a href="https://publications.waset.org/abstracts/search?q=quantum%20MDS%20codes" title=" quantum MDS codes"> quantum MDS codes</a>, <a href="https://publications.waset.org/abstracts/search?q=singleton%20bound" title=" singleton bound"> singleton bound</a> </p> <a href="https://publications.waset.org/abstracts/55714/tailoring-the-parameters-of-the-quantum-mds-codes-constructed-from-constacyclic-codes" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/55714.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">388</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">1832</span> Performance Comparison of Non-Binary RA and QC-LDPC Codes</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Ni%20Wenli">Ni Wenli</a>, <a href="https://publications.waset.org/abstracts/search?q=He%20Jing"> He Jing</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Repeat–Accumulate (RA) codes are subclass of LDPC codes with fast encoder structures. In this paper, we consider a nonbinary extension of binary LDPC codes over GF(q) and construct a non-binary RA code and a non-binary QC-LDPC code over GF(2^4), we construct non-binary RA codes with linear encoding method and non-binary QC-LDPC codes with algebraic constructions method. And the BER performance of RA and QC-LDPC codes over GF(q) are compared with BP decoding and by simulation over the Additive White Gaussian Noise (AWGN) channels. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=non-binary%20RA%20codes" title="non-binary RA codes">non-binary RA codes</a>, <a href="https://publications.waset.org/abstracts/search?q=QC-LDPC%20codes" title=" QC-LDPC codes"> QC-LDPC codes</a>, <a href="https://publications.waset.org/abstracts/search?q=performance%20comparison" title=" performance comparison"> performance comparison</a>, <a href="https://publications.waset.org/abstracts/search?q=BP%20algorithm" title=" BP algorithm"> BP algorithm</a> </p> <a href="https://publications.waset.org/abstracts/42170/performance-comparison-of-non-binary-ra-and-qc-ldpc-codes" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/42170.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">376</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">1831</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/abstracts/search?q=Jing%20Li">Jing Li</a>, <a href="https://publications.waset.org/abstracts/search?q=Xiuli%20Li"> Xiuli Li</a> </p> <p class="card-text"><strong>Abstract:</strong></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 class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=skew%20cyclic%20code" title="skew cyclic code">skew cyclic code</a>, <a href="https://publications.waset.org/abstracts/search?q=gray%20map" title=" gray map"> gray map</a>, <a href="https://publications.waset.org/abstracts/search?q=automorphism" title=" automorphism"> automorphism</a>, <a href="https://publications.waset.org/abstracts/search?q=cyclic%20code" title=" cyclic code"> cyclic code</a> </p> <a href="https://publications.waset.org/abstracts/70707/skew-cyclic-codes-over-fqufquk-1fq" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/70707.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">297</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">1830</span> A Generalization of the Secret Sharing Scheme Codes Over Certain Ring</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Ibrahim%20%C3%96zbek">Ibrahim Özbek</a>, <a href="https://publications.waset.org/abstracts/search?q=Erdo%C4%9Fan%20Mehmet%20%C3%96zkan"> Erdoğan Mehmet Özkan</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this study, we generalize (k,n) threshold secret sharing scheme on the study Ozbek and Siap to the codes over the ring Fq+ αFq. In this way, it is mentioned that the method obtained in that article can also be used on codes over rings, and new advantages to be obtained. The method of securely sharing the key in cryptography, which Shamir first systematized and Massey carried over to codes, became usable for all error-correcting codes. The firewall of this scheme is based on the hardness of the syndrome decoding problem. Also, an open study area is left for those working for other rings and code classes. All codes that correct errors with this method have been the working area of this method. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=secret%20sharing%20scheme" title="secret sharing scheme">secret sharing scheme</a>, <a href="https://publications.waset.org/abstracts/search?q=linear%20codes" title=" linear codes"> linear codes</a>, <a href="https://publications.waset.org/abstracts/search?q=algebra" title=" algebra"> algebra</a>, <a href="https://publications.waset.org/abstracts/search?q=finite%20rings" title=" finite rings"> finite rings</a> </p> <a href="https://publications.waset.org/abstracts/164183/a-generalization-of-the-secret-sharing-scheme-codes-over-certain-ring" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/164183.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">74</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">1829</span> A Novel Way to Create Qudit Quantum Error Correction Codes</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Arun%20Moorthy">Arun Moorthy</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Quantum computing promises to provide algorithmic speedups for a number of tasks; however, similar to classical computing, effective error-correcting codes are needed. Current quantum computers require costly equipment to control each particle, so having fewer particles to control is ideal. Although traditional quantum computers are built using qubits (2-level systems), qudits (more than 2-levels) are appealing since they can have an equivalent computational space using fewer particles, meaning fewer particles need to be controlled. Currently, qudit quantum error-correction codes are available for different level qudit systems; however, these codes have sometimes overly specific constraints. When building a qudit system, it is important for researchers to have access to many codes to satisfy their requirements. This project addresses two methods to increase the number of quantum error correcting codes available to researchers. The first method is generating new codes for a given set of parameters. The second method is generating new error-correction codes by using existing codes as a starting point to generate codes for another level (i.e., a 5-level system code on a 2-level system). So, this project builds a website that researchers can use to generate new error-correction codes or codes based on existing codes. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=qudit" title="qudit">qudit</a>, <a href="https://publications.waset.org/abstracts/search?q=error%20correction" title=" error correction"> error correction</a>, <a href="https://publications.waset.org/abstracts/search?q=quantum" title=" quantum"> quantum</a>, <a href="https://publications.waset.org/abstracts/search?q=qubit" title=" qubit"> qubit</a> </p> <a href="https://publications.waset.org/abstracts/138747/a-novel-way-to-create-qudit-quantum-error-correction-codes" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/138747.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">160</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">1828</span> Usage of Channel Coding Techniques for Peak-to-Average Power Ratio Reduction in Visible Light Communications Systems</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=P.%20L.%20D.%20N.%20M.%20de%20Silva">P. L. D. N. M. de Silva</a>, <a href="https://publications.waset.org/abstracts/search?q=S.%20G.%20Edirisinghe"> S. G. Edirisinghe</a>, <a href="https://publications.waset.org/abstracts/search?q=R.%20Weerasuriya"> R. Weerasuriya</a> </p> <p class="card-text"><strong>Abstract:</strong></p> High peak-to-average power ratio (PAPR) is a concern of orthogonal frequency division multiplexing (OFDM) based visible light communication (VLC) systems. Discrete Fourier Transform spread (DFT-s) OFDM is an alternative single carrier modulation scheme which would address this concern. Employing channel coding techniques is another mechanism to reduce the PAPR. Previous research has been conducted to study the impact of these techniques separately. However, to the best of the knowledge of the authors, no study has been done so far to identify the improvement which can be harnessed by hybridizing these two techniques for VLC systems. Therefore, this is a novel study area under this research. In addition, channel coding techniques such as Polar codes and Turbo codes have been tested in the VLC domain. However, other efficient techniques such as Hamming coding and Convolutional coding have not been studied too. Therefore, the authors present the impact of the hybrid of DFT-s OFDM and Channel coding (Hamming coding and Convolutional coding) on PAPR in VLC systems using Matlab simulations. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=convolutional%20coding" title="convolutional coding">convolutional coding</a>, <a href="https://publications.waset.org/abstracts/search?q=discrete%20Fourier%20transform%20spread%20orthogonal%20frequency%20division%20multiplexing" title=" discrete Fourier transform spread orthogonal frequency division multiplexing"> discrete Fourier transform spread orthogonal frequency division multiplexing</a>, <a href="https://publications.waset.org/abstracts/search?q=hamming%20coding" title=" hamming coding"> hamming coding</a>, <a href="https://publications.waset.org/abstracts/search?q=peak-to-average%20power%20ratio" title=" peak-to-average power ratio"> peak-to-average power ratio</a>, <a href="https://publications.waset.org/abstracts/search?q=visible%20light%20communications" title=" visible light communications"> visible light communications</a> </p> <a href="https://publications.waset.org/abstracts/150222/usage-of-channel-coding-techniques-for-peak-to-average-power-ratio-reduction-in-visible-light-communications-systems" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/150222.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">154</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">1827</span> Opportunities and Challenges of Omni Channel Retailing in the Emerging Market</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Salma%20Ahmed">Salma Ahmed</a>, <a href="https://publications.waset.org/abstracts/search?q=Anil%20Kumar"> Anil Kumar</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper develops and estimates a model for understanding the drivers and barriers for Omni-Channel retail. This study serves as one of the first attempt to empirically test the effect of various factors on Omni-channel retail. Omni-channel is relative new and evolving, we hypothesize three drivers: (1) Innovative sales and marketing opportunities, (2) channel migration, (3) Cross channel synergies; and three barriers: (1) Integrated sales and marketing operations, (2) Visibility and synchronization (3) Integration and Technology challenges. The findings from the study strongly support that Omni-channel effects exist between cross channel synergy and channel migration. However, it partially supports innovative sales and marketing operations. We also found the variables which we identified as barriers to Omni-channel retail have a strong impact on Omni-channel retail. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=retailing" title="retailing">retailing</a>, <a href="https://publications.waset.org/abstracts/search?q=multichannel" title=" multichannel"> multichannel</a>, <a href="https://publications.waset.org/abstracts/search?q=Omni-channel" title=" Omni-channel"> Omni-channel</a>, <a href="https://publications.waset.org/abstracts/search?q=emerging%20market" title=" emerging market "> emerging market </a> </p> <a href="https://publications.waset.org/abstracts/24135/opportunities-and-challenges-of-omni-channel-retailing-in-the-emerging-market" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/24135.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">549</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">1826</span> The Non-Existence of Perfect 2-Error Correcting Lee Codes of Word Length 7 over Z</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Catarina%20Cruz">Catarina Cruz</a>, <a href="https://publications.waset.org/abstracts/search?q=Ana%20Breda"> Ana Breda</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Tiling problems have been capturing the attention of many mathematicians due to their real-life applications. In this study, we deal with tilings of Zⁿ by Lee spheres, where n is a positive integer number, being these tilings related with error correcting codes on the transmission of information over a noisy channel. We focus our attention on the question ‘for what values of n and r does the n-dimensional Lee sphere of radius r tile Zⁿ?’. It seems that the n-dimensional Lee sphere of radius r does not tile Zⁿ for n ≥ 3 and r ≥ 2. Here, we prove that is not possible to tile Z⁷ with Lee spheres of radius 2 presenting a proof based on a combinatorial method and faithful to the geometric idea of the problem. The non-existence of such tilings has been studied by several authors being considered the most difficult cases those in which the radius of the Lee spheres is equal to 2. The relation between these tilings and error correcting codes is established considering the center of a Lee sphere as a codeword and the other elements of the sphere as words which are decoded by the central codeword. When the Lee spheres of radius r centered at elements of a set M ⊂ Zⁿ tile Zⁿ, M is a perfect r-error correcting Lee code of word length n over Z, denoted by PL(n, r). Our strategy to prove the non-existence of PL(7, 2) codes are based on the assumption of the existence of such code M. Without loss of generality, we suppose that O ∈ M, where O = (0, ..., 0). In this sense and taking into account that we are dealing with Lee spheres of radius 2, O covers all words which are distant two or fewer units from it. By the definition of PL(7, 2) code, each word which is distant three units from O must be covered by a unique codeword of M. These words have to be covered by codewords which dist five units from O. We prove the non-existence of PL(7, 2) codes showing that it is not possible to cover all the referred words without superposition of Lee spheres whose centers are distant five units from O, contradicting the definition of PL(7, 2) code. We achieve this contradiction by combining the cardinality of particular subsets of codewords which are distant five units from O. There exists an extensive literature on codes in the Lee metric. Here, we present a new approach to prove the non-existence of PL(7, 2) codes. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=Golomb-Welch%20conjecture" title="Golomb-Welch conjecture">Golomb-Welch conjecture</a>, <a href="https://publications.waset.org/abstracts/search?q=Lee%20metric" title=" Lee metric"> Lee metric</a>, <a href="https://publications.waset.org/abstracts/search?q=perfect%20Lee%20codes" title=" perfect Lee codes"> perfect Lee codes</a>, <a href="https://publications.waset.org/abstracts/search?q=tilings" title=" tilings"> tilings</a> </p> <a href="https://publications.waset.org/abstracts/95455/the-non-existence-of-perfect-2-error-correcting-lee-codes-of-word-length-7-over-z" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/95455.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">160</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">1825</span> Mathematical Modeling of Drip Emitter Discharge of Trapezoidal Labyrinth Channel</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=N.%20Philipova">N. Philipova</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The influence of the geometric parameters of trapezoidal labyrinth channel on the emitter discharge is investigated in this work. The impact of the dentate angle, the dentate spacing, and the dentate height are studied among the geometric parameters of the labyrinth channel. Numerical simulations of the water flow movement are performed according to central cubic composite design using Commercial codes GAMBIT and FLUENT. Inlet pressure of the dripper is set up to be 1 bar. The objective of this paper is to derive a mathematical model of the emitter discharge depending on the dentate angle, the dentate spacing, the dentate height of the labyrinth channel. As a result, the obtained mathematical model is a second-order polynomial reporting 2-way interactions among the geometric parameters. The dentate spacing has the most important and positive influence on the emitter discharge, followed by the simultaneous impact of the dentate spacing and the dentate height. The dentate angle in the observed interval has no significant effect on the emitter discharge. The obtained model can be used as a basis for a future emitter design. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=drip%20irrigation" title="drip irrigation">drip irrigation</a>, <a href="https://publications.waset.org/abstracts/search?q=labyrinth%20channel%20hydrodynamics" title=" labyrinth channel hydrodynamics"> labyrinth channel hydrodynamics</a>, <a href="https://publications.waset.org/abstracts/search?q=numerical%20simulations" title=" numerical simulations"> numerical simulations</a>, <a href="https://publications.waset.org/abstracts/search?q=Reynolds%20stress%20model." title=" Reynolds stress model."> Reynolds stress model.</a> </p> <a href="https://publications.waset.org/abstracts/75760/mathematical-modeling-of-drip-emitter-discharge-of-trapezoidal-labyrinth-channel" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/75760.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">184</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">1824</span> On the Construction of Some Optimal Binary Linear Codes</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Skezeer%20John%20B.%20Paz">Skezeer John B. Paz</a>, <a href="https://publications.waset.org/abstracts/search?q=Ederlina%20G.%20Nocon"> Ederlina G. Nocon</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Finding an optimal binary linear code is a central problem in coding theory. A binary linear code C = [n, k, d] is called optimal if there is no linear code with higher minimum distance d given the length n and the dimension k. There are bounds giving limits for the minimum distance d of a linear code of fixed length n and dimension k. The lower bound which can be taken by construction process tells that there is a known linear code having this minimum distance. The upper bound is given by theoretic results such as Griesmer bound. One way to find an optimal binary linear code is to make the lower bound of d equal to its higher bound. That is, to construct a binary linear code which achieves the highest possible value of its minimum distance d, given n and k. Some optimal binary linear codes were presented by Andries Brouwer in his published table on bounds of the minimum distance d of binary linear codes for 1 ≤ n ≤ 256 and k ≤ n. This was further improved by Markus Grassl by giving a detailed construction process for each code exhibiting the lower bound. In this paper, we construct new optimal binary linear codes by using some construction processes on existing binary linear codes. Particularly, we developed an algorithm applied to the codes already constructed to extend the list of optimal binary linear codes up to 257 ≤ n ≤ 300 for k ≤ 7. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=bounds%20of%20linear%20codes" title="bounds of linear codes">bounds of linear codes</a>, <a href="https://publications.waset.org/abstracts/search?q=Griesmer%20bound" title=" Griesmer bound"> Griesmer bound</a>, <a href="https://publications.waset.org/abstracts/search?q=construction%20of%20linear%20codes" title=" construction of linear codes"> construction of linear codes</a>, <a href="https://publications.waset.org/abstracts/search?q=optimal%20binary%20linear%20codes" title=" optimal binary linear codes"> optimal binary linear codes</a> </p> <a href="https://publications.waset.org/abstracts/31628/on-the-construction-of-some-optimal-binary-linear-codes" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/31628.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">755</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">1823</span> Performance Comparison of Space-Time Block and Trellis Codes under Rayleigh Channels</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Jing%20Qingfeng">Jing Qingfeng</a>, <a href="https://publications.waset.org/abstracts/search?q=Wu%20Jiajia"> Wu Jiajia</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Due to the crowded orbits and shortage of frequency resources, utilizing of MIMO technology to improve spectrum efficiency and increase the capacity has become a necessary trend of broadband satellite communication. We analyze the main influenced factors and compare the BER performance of space-time block code (STBC) scheme and space-time trellis code (STTC) scheme. This paper emphatically studies the bit error rate (BER) performance of STTC and STBC under Rayleigh channel. The main emphasis is placed on the effects of the factors, such as terminal environment and elevation angles, on the BER performance of STBC and STTC schemes. Simulation results indicate that performance of STTC under Rayleigh channel is obviously improved with the increasing of transmitting and receiving antennas numbers, but the encoder state has little impact on the performance. Under Rayleigh channel, performance of Alamouti code is better than that of STTC. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=MIMO" title="MIMO">MIMO</a>, <a href="https://publications.waset.org/abstracts/search?q=space%20time%20block%20code%20%28STBC%29" title=" space time block code (STBC)"> space time block code (STBC)</a>, <a href="https://publications.waset.org/abstracts/search?q=space%20time%20trellis%20code%20%28STTC%29" title=" space time trellis code (STTC)"> space time trellis code (STTC)</a>, <a href="https://publications.waset.org/abstracts/search?q=Rayleigh%20channel" title=" Rayleigh channel"> Rayleigh channel</a> </p> <a href="https://publications.waset.org/abstracts/45895/performance-comparison-of-space-time-block-and-trellis-codes-under-rayleigh-channels" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/45895.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">348</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">1822</span> Method of False Alarm Rate Control for Cyclic Redundancy Check-Aided List Decoding of Polar Codes</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Dmitry%20Dikarev">Dmitry Dikarev</a>, <a href="https://publications.waset.org/abstracts/search?q=Ajit%20Nimbalker"> Ajit Nimbalker</a>, <a href="https://publications.waset.org/abstracts/search?q=Alexei%20Davydov"> Alexei Davydov</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Polar coding is a novel example of error correcting codes, which can achieve Shannon limit at block length N→∞ with log-linear complexity. Active research is being carried to adopt this theoretical concept for using in practical applications such as 5th generation wireless communication systems. Cyclic redundancy check (CRC) error detection code is broadly used in conjunction with successive cancellation list (SCL) decoding algorithm to improve finite-length polar code performance. However, there are two issues: increase of code block payload overhead by CRC bits and decrease of CRC error-detection capability. This paper proposes a method to control CRC overhead and false alarm rate of polar decoding. As shown in the computer simulations results, the proposed method provides the ability to use any set of CRC polynomials with any list size while maintaining the desired level of false alarm rate. This level of flexibility allows using polar codes in 5G New Radio standard. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=5G%20New%20Radio" title="5G New Radio">5G New Radio</a>, <a href="https://publications.waset.org/abstracts/search?q=channel%20coding" title=" channel coding"> channel coding</a>, <a href="https://publications.waset.org/abstracts/search?q=cyclic%20redundancy%20check" title=" cyclic redundancy check"> cyclic redundancy check</a>, <a href="https://publications.waset.org/abstracts/search?q=list%20decoding" title=" list decoding"> list decoding</a>, <a href="https://publications.waset.org/abstracts/search?q=polar%20codes" title=" polar codes"> polar codes</a> </p> <a href="https://publications.waset.org/abstracts/85145/method-of-false-alarm-rate-control-for-cyclic-redundancy-check-aided-list-decoding-of-polar-codes" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/85145.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">238</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">1821</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/abstracts/search?q=Jamal%20Laaouine">Jamal Laaouine</a>, <a href="https://publications.waset.org/abstracts/search?q=Mohammed%20Elhassani%20Charkani"> Mohammed Elhassani Charkani</a> </p> <p class="card-text"><strong>Abstract:</strong></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 class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=constacyclic%20code" title="constacyclic code">constacyclic code</a>, <a href="https://publications.waset.org/abstracts/search?q=repeated-root%20code" title=" repeated-root code"> repeated-root code</a>, <a href="https://publications.waset.org/abstracts/search?q=maximum%20distance%20separable" title=" maximum distance separable"> maximum distance separable</a>, <a href="https://publications.waset.org/abstracts/search?q=MDS%20codes" title=" MDS codes"> MDS codes</a>, <a href="https://publications.waset.org/abstracts/search?q=b-symbol%20distance" title=" b-symbol distance"> b-symbol distance</a>, <a href="https://publications.waset.org/abstracts/search?q=finite%20chain%20rings" title=" finite chain rings"> finite chain rings</a> </p> <a href="https://publications.waset.org/abstracts/131201/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/abstracts/131201.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">137</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">1820</span> Performance Analysis of MIMO-OFDM Using Convolution Codes with QAM Modulation</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=I%20Gede%20Puja%20Astawa">I Gede Puja Astawa</a>, <a href="https://publications.waset.org/abstracts/search?q=Yoedy%20Moegiharto"> Yoedy Moegiharto</a>, <a href="https://publications.waset.org/abstracts/search?q=Ahmad%20Zainudin"> Ahmad Zainudin</a>, <a href="https://publications.waset.org/abstracts/search?q=Imam%20Dui%20Agus%20Salim"> Imam Dui Agus Salim</a>, <a href="https://publications.waset.org/abstracts/search?q=Nur%20Annisa%20Anggraeni"> Nur Annisa Anggraeni</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Performance of Orthogonal Frequency Division Multiplexing (OFDM) system can be improved by adding channel coding (error correction code) to detect and correct the errors that occur during data transmission. One can use the convolution code. This paper presents performance of OFDM using Space Time Block Codes (STBC) diversity technique use QAM modulation with code rate 1/2. The evaluation is done by analyzing the value of Bit Error Rate (BER) vs. Energy per Bit to Noise Power Spectral Density Ratio (Eb/No). This scheme is conducted 256 sub-carrier which transmits Rayleigh multipath channel in OFDM system. To achieve a BER of 10-3 is required 30 dB SNR in SISO-OFDM scheme. For 2x2 MIMO-OFDM scheme requires 10 dB to achieve a BER of 10-3. For 4x4 MIMO-OFDM scheme requires 5 dB while adding convolution in a 4x4 MIMO-OFDM can improve performance up to 0 dB to achieve the same BER. This proves the existence of saving power by 3 dB of 4x4 MIMO-OFDM system without coding, power saving 7 dB of 2x2 MIMO-OFDM system without coding and significant power savings from SISO-OFDM system. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=convolution%20code" title="convolution code">convolution code</a>, <a href="https://publications.waset.org/abstracts/search?q=OFDM" title=" OFDM"> OFDM</a>, <a href="https://publications.waset.org/abstracts/search?q=MIMO" title=" MIMO"> MIMO</a>, <a href="https://publications.waset.org/abstracts/search?q=QAM" title=" QAM"> QAM</a>, <a href="https://publications.waset.org/abstracts/search?q=BER" title=" BER"> BER</a> </p> <a href="https://publications.waset.org/abstracts/2398/performance-analysis-of-mimo-ofdm-using-convolution-codes-with-qam-modulation" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/2398.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">388</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">1819</span> Influence of Error Correction Codes on the Quality of Optical Broadband Connections</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Mouna%20Hemdi">Mouna Hemdi</a>, <a href="https://publications.waset.org/abstracts/search?q=Jamel%20bel%20Hadj%20Tahar"> Jamel bel Hadj Tahar</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The increasing development of multimedia applications requiring the simultaneous transport of several different services contributes to the evolution of the need for very high-speed network. In this paper, we propose an effective solution to achieve the very high speed while retaining elements of the optical transmission channel. So our study focuses on error correcting codes that aim for quality improvement on duty. We present a comparison of the quality of service for single channels and integrating the code BCH, RS and LDPC in order to find the best code in the different conditions of the transmission. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=code%20error%20correction" title="code error correction">code error correction</a>, <a href="https://publications.waset.org/abstracts/search?q=high%20speed%20broadband" title=" high speed broadband"> high speed broadband</a>, <a href="https://publications.waset.org/abstracts/search?q=optical%20transmission" title=" optical transmission"> optical transmission</a>, <a href="https://publications.waset.org/abstracts/search?q=information%20systems%20security" title=" information systems security"> information systems security</a> </p> <a href="https://publications.waset.org/abstracts/28490/influence-of-error-correction-codes-on-the-quality-of-optical-broadband-connections" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/28490.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">393</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">1818</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/abstracts/search?q=Gurjit%20Kaur">Gurjit Kaur</a>, <a href="https://publications.waset.org/abstracts/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/abstracts/search?q=CDMA" title="CDMA">CDMA</a>, <a href="https://publications.waset.org/abstracts/search?q=OCDMA" title=" OCDMA"> OCDMA</a>, <a href="https://publications.waset.org/abstracts/search?q=BER" title=" BER"> BER</a>, <a href="https://publications.waset.org/abstracts/search?q=OOC" title=" OOC"> OOC</a>, <a href="https://publications.waset.org/abstracts/search?q=PC" title=" PC"> PC</a>, <a href="https://publications.waset.org/abstracts/search?q=EPC" title=" EPC"> EPC</a>, <a href="https://publications.waset.org/abstracts/search?q=MPC" title=" MPC"> MPC</a>, <a href="https://publications.waset.org/abstracts/search?q=2-D%20PC%2FPC" title=" 2-D PC/PC"> 2-D PC/PC</a>, <a href="https://publications.waset.org/abstracts/search?q=%CE%BBc" title=" λc"> λc</a>, <a href="https://publications.waset.org/abstracts/search?q=%CE%BBa" title=" λa"> λa</a> </p> <a href="https://publications.waset.org/abstracts/45035/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/abstracts/45035.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">337</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">1817</span> Numerical Simulation of Effect of Various Rib Configurations on Enhancing Heat Transfer of Matrix Cooling Channel</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Seok%20Min%20Choi">Seok Min Choi</a>, <a href="https://publications.waset.org/abstracts/search?q=Minho%20Bang"> Minho Bang</a>, <a href="https://publications.waset.org/abstracts/search?q=Seuong%20Yun%20Kim"> Seuong Yun Kim</a>, <a href="https://publications.waset.org/abstracts/search?q=Hyungmin%20Lee"> Hyungmin Lee</a>, <a href="https://publications.waset.org/abstracts/search?q=Won-Gu%20Joo"> Won-Gu Joo</a>, <a href="https://publications.waset.org/abstracts/search?q=Hyung%20Hee%20Cho"> Hyung Hee Cho</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The matrix cooling channel was used for gas turbine blade cooling passage. The matrix cooling structure is useful for the structure stability however the cooling performance of internal cooling channel was not enough for cooling. Therefore, we designed the rib configurations in the matrix cooling channel to enhance the cooling performance. The numerical simulation was conducted to analyze cooling performance of rib configured matrix cooling channel. Three different rib configurations were used which are vertical rib, angled rib and c-type rib. Three configurations were adopted in two positions of matrix cooling channel which is one fourth and three fourth of channel. The result shows that downstream rib has much higher cooling performance than upstream rib. Furthermore, the angled rib in the channel has much higher cooling performance than vertical rib. This is because; the angled rib improves the swirl effect of matrix cooling channel more effectively. The friction factor was increased with the installation of rib. However, the thermal performance was increased with the installation of rib in the matrix cooling channel. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=matrix%20cooling" title="matrix cooling">matrix cooling</a>, <a href="https://publications.waset.org/abstracts/search?q=rib" title=" rib"> rib</a>, <a href="https://publications.waset.org/abstracts/search?q=heat%20transfer" title=" heat transfer"> heat transfer</a>, <a href="https://publications.waset.org/abstracts/search?q=gas%20turbine" title=" gas turbine"> gas turbine</a> </p> <a href="https://publications.waset.org/abstracts/80524/numerical-simulation-of-effect-of-various-rib-configurations-on-enhancing-heat-transfer-of-matrix-cooling-channel" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/80524.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">460</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">1816</span> Efficient Single Relay Selection Scheme for Cooperative Communication</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Sung-Bok%20Choi">Sung-Bok Choi</a>, <a href="https://publications.waset.org/abstracts/search?q=Hyun-Jun%20Shin"> Hyun-Jun Shin</a>, <a href="https://publications.waset.org/abstracts/search?q=Hyoung-Kyu%20Song"> Hyoung-Kyu Song</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper proposes a single relay selection scheme in cooperative communication. Decode and forward scheme is considered when a source node wants to cooperate with a single relay for data transmission. To use the proposed single relay selection scheme, the source node make a little different pattern signal which is not complex pattern and broadcasts it. The proposed scheme does not require the channel state information between the source node and candidates of the relay during the relay selection. Therefore, it is able to be used in many fields. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=relay%20selection" title="relay selection">relay selection</a>, <a href="https://publications.waset.org/abstracts/search?q=cooperative%20communication" title=" cooperative communication"> cooperative communication</a>, <a href="https://publications.waset.org/abstracts/search?q=df" title=" df"> df</a>, <a href="https://publications.waset.org/abstracts/search?q=channel%20codes" title=" channel codes"> channel codes</a> </p> <a href="https://publications.waset.org/abstracts/3523/efficient-single-relay-selection-scheme-for-cooperative-communication" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/3523.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">670</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">1815</span> Adaptive Transmission Scheme Based on Channel State in Dual-Hop System</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Seung-Jun%20Yu">Seung-Jun Yu</a>, <a href="https://publications.waset.org/abstracts/search?q=Yong-Jun%20Kim"> Yong-Jun Kim</a>, <a href="https://publications.waset.org/abstracts/search?q=Jung-In%20Baik"> Jung-In Baik</a>, <a href="https://publications.waset.org/abstracts/search?q=Hyoung-Kyu%20Song"> Hyoung-Kyu Song</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper, a dual-hop relay based on channel state is studied. In the conventional relay scheme, a relay uses the same modulation method without reference to channel state. But, a relay uses an adaptive modulation method with reference to channel state. If the channel state is poor, a relay eliminates latter 2 bits and uses Quadrature Phase Shift Keying (QPSK) modulation. If channel state is good, a relay modulates the received symbols with 16-QAM symbols by using 4 bits. The performance of the proposed scheme for Symbol Error Rate (SER) and throughput is analyzed. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=adaptive%20transmission" title="adaptive transmission">adaptive transmission</a>, <a href="https://publications.waset.org/abstracts/search?q=channel%20state" title=" channel state"> channel state</a>, <a href="https://publications.waset.org/abstracts/search?q=dual-hop" title=" dual-hop"> dual-hop</a>, <a href="https://publications.waset.org/abstracts/search?q=hierarchical%20modulation" title=" hierarchical modulation"> hierarchical modulation</a>, <a href="https://publications.waset.org/abstracts/search?q=relay" title=" relay"> relay</a> </p> <a href="https://publications.waset.org/abstracts/52599/adaptive-transmission-scheme-based-on-channel-state-in-dual-hop-system" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/52599.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">380</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">1814</span> Performance Analysis and Comparison of Various 1-D and 2-D Prime Codes for OCDMA Systems</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Gurjit%20Kaur">Gurjit Kaur</a>, <a href="https://publications.waset.org/abstracts/search?q=Shashank%20Johri"> Shashank Johri</a>, <a href="https://publications.waset.org/abstracts/search?q=Arpit%20Mehrotra"> Arpit Mehrotra</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 OCDMA system on a single platform. Results shows that 1D Extended Prime Code (EPC) can support more number of active users compared to other codes but at the expense of larger code length which further increases the complexity of the code. Modified Prime Code (MPC) supports lesser number of active users at λc=2 but it has a lesser code length as compared to 1D prime code. 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/abstracts/search?q=CDMA" title="CDMA">CDMA</a>, <a href="https://publications.waset.org/abstracts/search?q=OCDMA" title=" OCDMA"> OCDMA</a>, <a href="https://publications.waset.org/abstracts/search?q=BER" title=" BER"> BER</a>, <a href="https://publications.waset.org/abstracts/search?q=OOC" title=" OOC"> OOC</a>, <a href="https://publications.waset.org/abstracts/search?q=PC" title=" PC"> PC</a>, <a href="https://publications.waset.org/abstracts/search?q=EPC" title=" EPC"> EPC</a>, <a href="https://publications.waset.org/abstracts/search?q=MPC" title=" MPC"> MPC</a>, <a href="https://publications.waset.org/abstracts/search?q=2-D%20PC%2FPC" title=" 2-D PC/PC"> 2-D PC/PC</a>, <a href="https://publications.waset.org/abstracts/search?q=%CE%BBc" title=" λc"> λc</a>, <a href="https://publications.waset.org/abstracts/search?q=%CE%BBa" title=" λa"> λa</a> </p> <a href="https://publications.waset.org/abstracts/35194/performance-analysis-and-comparison-of-various-1-d-and-2-d-prime-codes-for-ocdma-systems" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/35194.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">510</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">1813</span> Role of QR Codes in Environmental Consciousness of Apparel Consumption</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Eleanor%20L.%20Kutschera">Eleanor L. Kutschera</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This study explores the possible impact that QR codes play in helping individuals make more sustainable choices regarding apparel consumption. Data was collected via an online survey to ascertain individuals’ knowledge, attitudes, and behaviors with regard to QR codes and how this impacts their decisions to purchase apparel. Results from 250 participants provide both qualitative and quantitative data that provide valuable information regarding consumers’ use of QR codes and more sustainable purchases. Specifically, results indicate that QR codes are currently under-utilized in the apparel industry but have the potential to generate more environmentally conscious purchases. Also, results posit that while the cost of the item is the most influential factor in purchasing sustainable garments, other factors such as how, where, and what it is made of are in the middle, along with the company’s story/inspiration for creation have an impact. Moreover, participants posit the use of QR codes could make them more informed and empowered consumers, and they would be more likely to make purchases that are better for the environment. Participants’ qualitative responses provide useful incentives that could increase their future sustainable purchases. Finally, this study touches on the study’s limitations, implications, and future direction of research. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=digital%20ID" title="digital ID">digital ID</a>, <a href="https://publications.waset.org/abstracts/search?q=QR%20codes" title=" QR codes"> QR codes</a>, <a href="https://publications.waset.org/abstracts/search?q=environmental%20consciousness" title=" environmental consciousness"> environmental consciousness</a>, <a href="https://publications.waset.org/abstracts/search?q=sustainability" title=" sustainability"> sustainability</a>, <a href="https://publications.waset.org/abstracts/search?q=fashion%20industry" title=" fashion industry"> fashion industry</a>, <a href="https://publications.waset.org/abstracts/search?q=apparel%20consumption" title=" apparel consumption"> apparel consumption</a> </p> <a href="https://publications.waset.org/abstracts/153535/role-of-qr-codes-in-environmental-consciousness-of-apparel-consumption" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/153535.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">103</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">1812</span> Formation of Round Channel for Microfluidic Applications</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=A.%20Zahra">A. Zahra</a>, <a href="https://publications.waset.org/abstracts/search?q=G.%20de%20Cesare"> G. de Cesare</a>, <a href="https://publications.waset.org/abstracts/search?q=D.%20Caputo"> D. Caputo</a>, <a href="https://publications.waset.org/abstracts/search?q=A.%20Nascetti"> A. Nascetti</a> </p> <p class="card-text"><strong>Abstract:</strong></p> PDMS (Polydimethylsiloxane) polymer is a suitable material for biological and MEMS (Microelectromechanical systems) designers, because of its biocompatibility, transparency and high resistance under plasma treatment. PDMS round channel is always been of great interest due to its ability to confine the liquid with membrane type micro valves. In this paper we are presenting a very simple way to form round shape microfluidic channel, which is based on reflow of positive photoresist AZ® 40 XT. With this method, it is possible to obtain channel of different height simply by varying the spin coating parameters of photoresist. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=lab-on-chip" title="lab-on-chip">lab-on-chip</a>, <a href="https://publications.waset.org/abstracts/search?q=PDMS" title=" PDMS"> PDMS</a>, <a href="https://publications.waset.org/abstracts/search?q=reflow" title=" reflow"> reflow</a>, <a href="https://publications.waset.org/abstracts/search?q=round%20microfluidic%20channel" title=" round microfluidic channel"> round microfluidic channel</a> </p> <a href="https://publications.waset.org/abstracts/7886/formation-of-round-channel-for-microfluidic-applications" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/7886.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">431</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">1811</span> Simulation Analysis of Wavelength/Time/Space Codes Using CSRZ and DPSK-RZ Formats for Fiber-Optic CDMA Systems</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Jaswinder%20Singh">Jaswinder Singh</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper, comparative analysis is carried out to study the performance of wavelength/time/space optical CDMA codes using two well-known formats; those are CSRZ and DPSK-RZ using RSoft’s OptSIM. The analysis is carried out under the real-like scenario considering the presence of various non-linear effects such as XPM, SPM, SRS, SBS and FWM. Fiber dispersion and the multiple access interference are also considered. The codes used in this analysis are 3-D wavelength/time/space codes. These are converted into 2-D wavelength-time codes so that their requirement of space couplers and fiber ribbons is eliminated. Under the conditions simulated, this is found that CSRZ performs better than DPSK-RZ for fiber-optic CDMA applications. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=Optical%20CDMA" title="Optical CDMA">Optical CDMA</a>, <a href="https://publications.waset.org/abstracts/search?q=Multiple%20access%20interference%20%28MAI%29" title=" Multiple access interference (MAI)"> Multiple access interference (MAI)</a>, <a href="https://publications.waset.org/abstracts/search?q=CSRZ" title=" CSRZ"> CSRZ</a>, <a href="https://publications.waset.org/abstracts/search?q=DPSK-RZ" title=" DPSK-RZ"> DPSK-RZ</a> </p> <a href="https://publications.waset.org/abstracts/7843/simulation-analysis-of-wavelengthtimespace-codes-using-csrz-and-dpsk-rz-formats-for-fiber-optic-cdma-systems" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/7843.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">645</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">1810</span> Constant Dimension Codes via Generalized Coset Construction</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Kanchan%20Singh">Kanchan Singh</a>, <a href="https://publications.waset.org/abstracts/search?q=Sheo%20Kumar%20Singh"> Sheo Kumar Singh</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The fundamental problem of subspace coding is to explore the maximum possible cardinality Aq(n, d, k) of a set of k-dimensional subspaces of an n-dimensional vector space over Fq such that the subspace distance satisfies ds(W1, W2) ≥ d for any two distinct subspaces W1, W2 in this set. In this paper, we construct a new class of constant dimension codes (CDCs) by generalizing the coset construction and combining it with CDCs derived from parallel linkage construction and coset construction with an aim to improve the new lower bounds of Aq(n, d, k). We found a remarkable improvement in some of the lower bounds of Aq(n, d, k). <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=constant%20dimension%20codes" title="constant dimension codes">constant dimension codes</a>, <a href="https://publications.waset.org/abstracts/search?q=rank%20metric%20codes" title=" rank metric codes"> rank metric codes</a>, <a href="https://publications.waset.org/abstracts/search?q=coset%20construction" title=" coset construction"> coset construction</a>, <a href="https://publications.waset.org/abstracts/search?q=parallel%20linkage%20construction" title=" parallel linkage construction"> parallel linkage construction</a> </p> <a href="https://publications.waset.org/abstracts/193021/constant-dimension-codes-via-generalized-coset-construction" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/193021.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">20</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/abstracts/search?q=channel%20codes&page=2">2</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=channel%20codes&page=3">3</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=channel%20codes&page=4">4</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=channel%20codes&page=5">5</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=channel%20codes&page=6">6</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=channel%20codes&page=7">7</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=channel%20codes&page=8">8</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=channel%20codes&page=9">9</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=channel%20codes&page=10">10</a></li> <li class="page-item disabled"><span class="page-link">...</span></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=channel%20codes&page=61">61</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=channel%20codes&page=62">62</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=channel%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>