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: bounds of linear codes</title> <meta name="description" content="Search results for: bounds of linear codes"> <meta name="keywords" content="bounds of linear 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="bounds of linear 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="bounds of linear 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> 3987</div> </div> </div> </div> <h1 class="mt-3 mb-3 text-center" style="font-size:1.6rem;">Search results for: bounds of linear codes</h1> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">3987</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">3986</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">3985</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> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">3984</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">3983</span> Constructions of Linear and Robust Codes Based on Wavelet Decompositions</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Alla%20Levina">Alla Levina</a>, <a href="https://publications.waset.org/abstracts/search?q=Sergey%20Taranov"> Sergey Taranov</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The classical approach to the providing noise immunity and integrity of information that process in computing devices and communication channels is to use linear codes. Linear codes have fast and efficient algorithms of encoding and decoding information, but this codes concentrate their detect and correct abilities in certain error configurations. To protect against any configuration of errors at predetermined probability can robust codes. This is accomplished by the use of perfect nonlinear and almost perfect nonlinear functions to calculate the code redundancy. The paper presents the error-correcting coding scheme using biorthogonal wavelet transform. Wavelet transform applied in various fields of science. Some of the wavelet applications are cleaning of signal from noise, data compression, spectral analysis of the signal components. The article suggests methods for constructing linear codes based on wavelet decomposition. For developed constructions we build generator and check matrix that contain the scaling function coefficients of wavelet. Based on linear wavelet codes we develop robust codes that provide uniform protection against all errors. In article we propose two constructions of robust code. The first class of robust code is based on multiplicative inverse in finite field. In the second robust code construction the redundancy part is a cube of information part. Also, this paper investigates the characteristics of proposed robust and linear codes. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=robust%20code" title="robust code">robust code</a>, <a href="https://publications.waset.org/abstracts/search?q=linear%20code" title=" linear code"> linear code</a>, <a href="https://publications.waset.org/abstracts/search?q=wavelet%20decomposition" title=" wavelet decomposition"> wavelet decomposition</a>, <a href="https://publications.waset.org/abstracts/search?q=scaling%20function" title=" scaling function"> scaling function</a>, <a href="https://publications.waset.org/abstracts/search?q=error%20masking%20probability" title=" error masking probability"> error masking probability</a> </p> <a href="https://publications.waset.org/abstracts/16512/constructions-of-linear-and-robust-codes-based-on-wavelet-decompositions" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/16512.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">489</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">3982</span> Linear Codes Afforded by the Permutation Representations of Finite Simple Groups and Their Support Designs</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Amin%20Saeidi">Amin Saeidi</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Using a representation-theoretic approach and considering G to be a finite primitive permutation group of degree n, our aim is to determine linear codes of length n that admit G as a permutation automorphism group. We can show that in some cases, every binary linear code admitting G as a permutation automorphism group is a submodule of a permutation module defined by a primitive action of G. As an illustration of the method, we consider the sporadic simple group M₁₁ and the unitary group U(3,3). We also construct some point- and block-primitive 1-designs from the supports of some codewords of the codes in the discussion. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=linear%20code" title="linear code">linear code</a>, <a href="https://publications.waset.org/abstracts/search?q=permutation%20representation" title=" permutation representation"> permutation representation</a>, <a href="https://publications.waset.org/abstracts/search?q=support%20design" title=" support design"> support design</a>, <a href="https://publications.waset.org/abstracts/search?q=simple%20group" title=" simple group"> simple group</a> </p> <a href="https://publications.waset.org/abstracts/174007/linear-codes-afforded-by-the-permutation-representations-of-finite-simple-groups-and-their-support-designs" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/174007.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">77</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">3981</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">3980</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">3979</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">3978</span> Model-Independent Price Bounds for the Swiss Re Mortality Bond 2003</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Raj%20Kumari%20Bahl">Raj Kumari Bahl</a>, <a href="https://publications.waset.org/abstracts/search?q=Sotirios%20Sabanis"> Sotirios Sabanis</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper, we are concerned with the valuation of the first Catastrophic Mortality Bond that was launched in the market namely the Swiss Re Mortality Bond 2003. This bond encapsulates the behavior of a well-defined mortality index to generate payoffs for the bondholders. Pricing this bond is a challenging task. We adapt the payoff of the terminal principal of the bond in terms of the payoff of an Asian put option and present an approach to derive model-independent bounds exploiting comonotonic theory. We invoke Jensen’s inequality for the computation of lower bounds and employ Lagrange optimization technique to achieve the upper bound. The success of these bounds is based on the availability of compatible European mortality options in the market. We carry out Monte Carlo simulations to estimate the bond price and illustrate the strength of these bounds across a variety of models. The fact that our bounds are model-independent is a crucial breakthrough in the pricing of catastrophic mortality bonds. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=mortality%20bond" title="mortality bond">mortality bond</a>, <a href="https://publications.waset.org/abstracts/search?q=Swiss%20Re%20Bond" title=" Swiss Re Bond"> Swiss Re Bond</a>, <a href="https://publications.waset.org/abstracts/search?q=mortality%20index" title=" mortality index"> mortality index</a>, <a href="https://publications.waset.org/abstracts/search?q=comonotonicity" title=" comonotonicity"> comonotonicity</a> </p> <a href="https://publications.waset.org/abstracts/54923/model-independent-price-bounds-for-the-swiss-re-mortality-bond-2003" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/54923.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">250</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">3977</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">3976</span> Approximation to the Hardy Operator on Topological Measure Spaces</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Kairat%20T.%20Mynbaev">Kairat T. Mynbaev</a>, <a href="https://publications.waset.org/abstracts/search?q=Elena%20N.%20Lomakina"> Elena N. Lomakina</a> </p> <p class="card-text"><strong>Abstract:</strong></p> We consider a Hardy-type operator generated by a family of open subsets of a Hausdorff topological space. The family is indexed with non-negative real numbers and is totally ordered. For this operator, we obtain two-sided bounds of its norm, a compactness criterion, and bounds for its approximation numbers. Previously, bounds for its approximation numbers have been established only in the one-dimensional case, while we do not impose any restrictions on the dimension of the Hausdorff space. The bounds for the norm and conditions for compactness earlier have been found using different methods by G. Sinnamon and K. Mynbaev. Our approach is different in that we use domain partitions for all problems under consideration. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=approximation%20numbers" title="approximation numbers">approximation numbers</a>, <a href="https://publications.waset.org/abstracts/search?q=boundedness%20and%20compactness" title=" boundedness and compactness"> boundedness and compactness</a>, <a href="https://publications.waset.org/abstracts/search?q=multidimensional%20Hardy%20operator" title=" multidimensional Hardy operator"> multidimensional Hardy operator</a>, <a href="https://publications.waset.org/abstracts/search?q=Hausdorff%20topological%20space" title=" Hausdorff topological space"> Hausdorff topological space</a> </p> <a href="https://publications.waset.org/abstracts/170957/approximation-to-the-hardy-operator-on-topological-measure-spaces" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/170957.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">104</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">3975</span> Some New Bounds for a Real Power of the Normalized Laplacian Eigenvalues</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Ay%C5%9Fe%20Dilek%20Maden">Ayşe Dilek Maden</a> </p> <p class="card-text"><strong>Abstract:</strong></p> For a given a simple connected graph, we present some new bounds via a new approach for a special topological index given by the sum of the real number power of the non-zero normalized Laplacian eigenvalues. To use this approach presents an advantage not only to derive old and new bounds on this topic but also gives an idea how some previous results in similar area can be developed. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=degree%20Kirchhoff%20index" title="degree Kirchhoff index">degree Kirchhoff index</a>, <a href="https://publications.waset.org/abstracts/search?q=normalized%20Laplacian%20eigenvalue" title=" normalized Laplacian eigenvalue"> normalized Laplacian eigenvalue</a>, <a href="https://publications.waset.org/abstracts/search?q=spanning%20tree" title=" spanning tree"> spanning tree</a>, <a href="https://publications.waset.org/abstracts/search?q=simple%20connected%20graph" title=" simple connected graph"> simple connected graph</a> </p> <a href="https://publications.waset.org/abstracts/13999/some-new-bounds-for-a-real-power-of-the-normalized-laplacian-eigenvalues" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/13999.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">366</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">3974</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">3973</span> On the Topological Entropy of Nonlinear Dynamical Systems</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Graziano%20Chesi">Graziano Chesi</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The topological entropy plays a key role in linear dynamical systems, allowing one to establish the existence of stabilizing feedback controllers for linear systems in the presence of communications constraints. This paper addresses the determination of a robust value of the topological entropy in nonlinear dynamical systems, specifically the largest value of the topological entropy over all linearized models in a region of interest of the state space. It is shown that a sufficient condition for establishing upper bounds of the sought robust value of the topological entropy can be given in terms of a semidefinite program (SDP), which belongs to the class of convex optimization problems. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=non-linear%20system" title="non-linear system">non-linear system</a>, <a href="https://publications.waset.org/abstracts/search?q=communication%20constraint" title=" communication constraint"> communication constraint</a>, <a href="https://publications.waset.org/abstracts/search?q=topological%20entropy" title=" topological entropy"> topological entropy</a> </p> <a href="https://publications.waset.org/abstracts/45742/on-the-topological-entropy-of-nonlinear-dynamical-systems" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/45742.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">321</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">3972</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">3971</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">3970</span> First Order Moment Bounds on DMRL and IMRL Classes of Life Distributions</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Debasis%20Sengupta">Debasis Sengupta</a>, <a href="https://publications.waset.org/abstracts/search?q=Sudipta%20Das"> Sudipta Das</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The class of life distributions with decreasing mean residual life (DMRL) is well known in the field of reliability modeling. It contains the IFR class of distributions and is contained in the NBUE class of distributions. While upper and lower bounds of the reliability distribution function of aging classes such as IFR, IFRA, NBU, NBUE, and HNBUE have discussed in the literature for a long time, there is no analogous result available for the DMRL class. We obtain the upper and lower bounds for the reliability function of the DMRL class in terms of first order finite moment. The lower bound is obtained by showing that for any fixed time, the minimization of the reliability function over the class of all DMRL distributions with a fixed mean is equivalent to its minimization over a smaller class of distribution with a special form. Optimization over this restricted set can be made algebraically. Likewise, the maximization of the reliability function over the class of all DMRL distributions with a fixed mean turns out to be a parametric optimization problem over the class of DMRL distributions of a special form. The constructive proofs also establish that both the upper and lower bounds are sharp. Further, the DMRL upper bound coincides with the HNBUE upper bound and the lower bound coincides with the IFR lower bound. We also prove that a pair of sharp upper and lower bounds for the reliability function when the distribution is increasing mean residual life (IMRL) with a fixed mean. This result is proved in a similar way. These inequalities fill a long-standing void in the literature of the life distribution modeling. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=DMRL" title="DMRL">DMRL</a>, <a href="https://publications.waset.org/abstracts/search?q=IMRL" title=" IMRL"> IMRL</a>, <a href="https://publications.waset.org/abstracts/search?q=reliability%20bounds" title=" reliability bounds"> reliability bounds</a>, <a href="https://publications.waset.org/abstracts/search?q=hazard%20functions" title=" hazard functions"> hazard functions</a> </p> <a href="https://publications.waset.org/abstracts/47988/first-order-moment-bounds-on-dmrl-and-imrl-classes-of-life-distributions" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/47988.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">397</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">3969</span> The Relationship between Energy Consumption and Economic Growth in Turkey: A Time Series Analysis</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Burcu%20Guvenek">Burcu Guvenek</a>, <a href="https://publications.waset.org/abstracts/search?q=Volkan%20Alptekin"> Volkan Alptekin</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Turkey is a country in the process of development and its economy has undergone structural reforms in order to realize a sustainable development and energy has vital role as a basic input for this aim. Turkey has been in the process of economic growth and development and, because of this, has an increasing energy need. This paper investigates relationship between economic growth and electricity consumption using annual data for Turkey between 1970-2008 by using bounds test. As economic growth and energy consumption variables used in empirical analysis was different order of integration I(0) and I(1), we employed bounds test approach. We have not found co-integration relationship between the variables. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=bounds%20test" title="bounds test">bounds test</a>, <a href="https://publications.waset.org/abstracts/search?q=economic%20growth" title=" economic growth"> economic growth</a>, <a href="https://publications.waset.org/abstracts/search?q=energy%20consumption" title=" energy consumption"> energy consumption</a>, <a href="https://publications.waset.org/abstracts/search?q=Turkey" title=" Turkey"> Turkey</a> </p> <a href="https://publications.waset.org/abstracts/32145/the-relationship-between-energy-consumption-and-economic-growth-in-turkey-a-time-series-analysis" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/32145.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">363</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">3968</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">3967</span> Seismic Performance Point of RC Frame Buildings Using ATC-40, FEMA 356 and FEMA 440 Guidelines</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Gram%20Y.%20Rivas%20Sanchez">Gram Y. Rivas Sanchez</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The seismic design codes in the world allow the analysis of structures considering an elastic-linear behavior; however, against earthquakes, the structures exhibit non-linear behaviors that induce damage to their elements. For this reason, it is necessary to use non-linear methods to analyze these structures, being the dynamic methods that provide more reliable results but require a lot of computational costs; on the other hand, non-linear static methods do not have this disadvantage and are being used more and more. In the present work, the nonlinear static analysis (pushover) of RC frame buildings of three, five, and seven stories is carried out considering models of concentrated plasticity using plastic hinges; and the seismic performance points are determined using ATC-40, FEMA 356, and FEMA 440 guidelines. Using this last standard, the highest inelastic displacements and basal shears are obtained, providing designs that are more conservative. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=pushover" title="pushover">pushover</a>, <a href="https://publications.waset.org/abstracts/search?q=nonlinear" title=" nonlinear"> nonlinear</a>, <a href="https://publications.waset.org/abstracts/search?q=RC%20building" title=" RC building"> RC building</a>, <a href="https://publications.waset.org/abstracts/search?q=FEMA%20440" title=" FEMA 440"> FEMA 440</a>, <a href="https://publications.waset.org/abstracts/search?q=ATC%2040" title=" ATC 40"> ATC 40</a> </p> <a href="https://publications.waset.org/abstracts/136822/seismic-performance-point-of-rc-frame-buildings-using-atc-40-fema-356-and-fema-440-guidelines" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/136822.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">146</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">3966</span> Construction of Finite Woven Frames through Bounded Linear Operators</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=A.%20Bhandari">A. Bhandari</a>, <a href="https://publications.waset.org/abstracts/search?q=S.%20Mukherjee"> S. Mukherjee</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Two frames in a Hilbert space are called woven or weaving if all possible merge combinations between them generate frames of the Hilbert space with uniform frame bounds. Weaving frames are powerful tools in wireless sensor networks which require distributed data processing. Considering the practical applications, this article deals with finite woven frames. We provide methods of constructing finite woven frames, in particular, bounded linear operators are used to construct woven frames from a given frame. Several examples are discussed. We also introduce the notion of woven frame sequences and characterize them through the concepts of gaps and angles between spaces. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=frames" title="frames">frames</a>, <a href="https://publications.waset.org/abstracts/search?q=woven%20frames" title=" woven frames"> woven frames</a>, <a href="https://publications.waset.org/abstracts/search?q=gap" title=" gap"> gap</a>, <a href="https://publications.waset.org/abstracts/search?q=angle" title=" angle"> angle</a> </p> <a href="https://publications.waset.org/abstracts/100698/construction-of-finite-woven-frames-through-bounded-linear-operators" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/100698.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">193</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">3965</span> The Impact of Bitcoin on Stock Market Performance</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Oliver%20Takawira">Oliver Takawira</a>, <a href="https://publications.waset.org/abstracts/search?q=Thembi%20Hope"> Thembi Hope</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This study will analyse the relationship between Bitcoin price movements and the Johannesburg stock exchange (JSE). The aim is to determine whether Bitcoin price movements affect the stock market performance. As crypto currencies continue to gain prominence as a safe asset during periods of economic distress, this raises the question of whether Bitcoin’s prosperity could affect investment in the stock market. To identify the existence of a short run and long run linear relationship, the study will apply the Autoregressive Distributed Lag Model (ARDL) bounds test and a Vector Error Correction Model (VECM) after testing the data for unit roots and cointegration using the Augmented Dicker Fuller (ADF) and Phillips-Perron (PP). The Non-Linear Auto Regressive Distributed Lag (NARDL) will then be used to check if there is a non-linear relationship between bitcoin prices and stock market prices. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=bitcoin" title="bitcoin">bitcoin</a>, <a href="https://publications.waset.org/abstracts/search?q=stock%20market" title=" stock market"> stock market</a>, <a href="https://publications.waset.org/abstracts/search?q=interest%20rates" title=" interest rates"> interest rates</a>, <a href="https://publications.waset.org/abstracts/search?q=ARDL" title=" ARDL"> ARDL</a> </p> <a href="https://publications.waset.org/abstracts/150006/the-impact-of-bitcoin-on-stock-market-performance" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/150006.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">107</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">3964</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">3963</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">3962</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">3961</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">3960</span> Rough Oscillatory Singular Integrals on Rⁿ</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=H.%20M.%20Al-Qassem">H. M. Al-Qassem</a>, <a href="https://publications.waset.org/abstracts/search?q=L.%20Cheng"> L. Cheng</a>, <a href="https://publications.waset.org/abstracts/search?q=Y.%20Pan"> Y. Pan </a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper we establish sharp bounds for oscillatory singular integrals with an arbitrary real polynomial phase P. Our kernels are allowed to be rough both on the unit sphere and in the radial direction. We show that the bounds grow no faster than log(deg(P)), which is optimal and was first obtained by Parissis and Papadimitrakis for kernels without any radial roughness. Among key ingredients of our methods are an L¹→L² estimate and extrapolation. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=oscillatory%20singular%20integral" title="oscillatory singular integral">oscillatory singular integral</a>, <a href="https://publications.waset.org/abstracts/search?q=rough%20kernel" title=" rough kernel"> rough kernel</a>, <a href="https://publications.waset.org/abstracts/search?q=singular%20integral" title=" singular integral"> singular integral</a>, <a href="https://publications.waset.org/abstracts/search?q=Orlicz%20spaces" title=" Orlicz spaces"> Orlicz spaces</a>, <a href="https://publications.waset.org/abstracts/search?q=Block%20spaces" title=" Block spaces"> Block spaces</a>, <a href="https://publications.waset.org/abstracts/search?q=extrapolation" title=" extrapolation"> extrapolation</a>, <a href="https://publications.waset.org/abstracts/search?q=L%5E%7Bp%7D%20boundedness" title=" L^{p} boundedness"> L^{p} boundedness</a> </p> <a href="https://publications.waset.org/abstracts/2152/rough-oscillatory-singular-integrals-on-r" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/2152.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">3959</span> Quality of the Ruin Probabilities Approximation Using the Regenerative Processes Approach regarding to Large Claims</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Safia%20Hocine">Safia Hocine</a>, <a href="https://publications.waset.org/abstracts/search?q=Djamil%20A%C3%AFssani"> Djamil Aïssani</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Risk models, recently studied in the literature, are becoming increasingly complex. It is rare to find explicit analytical relations to calculate the ruin probability. Indeed, the stability issue occurs naturally in ruin theory, when parameters in risk cannot be estimated than with uncertainty. However, in most cases, there are no explicit formulas for the ruin probability. Hence, the interest to obtain explicit stability bounds for these probabilities in different risk models. In this paper, we interest to the stability bounds of the univariate classical risk model established using the regenerative processes approach. By adopting an algorithmic approach, we implement this approximation and determine numerically the bounds of ruin probability in the case of large claims (heavy-tailed distribution). <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=heavy-tailed%20distribution" title="heavy-tailed distribution">heavy-tailed distribution</a>, <a href="https://publications.waset.org/abstracts/search?q=large%20claims" title=" large claims"> large claims</a>, <a href="https://publications.waset.org/abstracts/search?q=regenerative%20process" title=" regenerative process"> regenerative process</a>, <a href="https://publications.waset.org/abstracts/search?q=risk%20model" title=" risk model"> risk model</a>, <a href="https://publications.waset.org/abstracts/search?q=ruin%20probability" title=" ruin probability"> ruin probability</a>, <a href="https://publications.waset.org/abstracts/search?q=stability" title=" stability"> stability</a> </p> <a href="https://publications.waset.org/abstracts/63426/quality-of-the-ruin-probabilities-approximation-using-the-regenerative-processes-approach-regarding-to-large-claims" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/63426.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">364</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">3958</span> Geometric Properties of Some q-Bessel Functions</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=%C4%B0brahim%20Akta%C5%9F">İbrahim Aktaş</a>, <a href="https://publications.waset.org/abstracts/search?q=%C3%81rp%C3%A1d%20Baricz"> Árpád Baricz</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper, the radii of star likeness of the Jackson and Hahn-Exton q-Bessel functions are considered, and for each of them three different normalizations is applied. By applying Euler-Rayleigh inequalities for the first positive zeros of these functions tight lower, and upper bounds for the radii of starlikeness of these functions are obtained. The Laguerre-Pólya class of real entire functions plays an important role in this study. In particular, we obtain some new bounds for the first positive zero of the derivative of the classical Bessel function of the first kind. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=bessel%20function" title="bessel function">bessel function</a>, <a href="https://publications.waset.org/abstracts/search?q=lommel%20function" title=" lommel function"> lommel function</a>, <a href="https://publications.waset.org/abstracts/search?q=radius%20of%20starlikeness%20and%20convexity" title=" radius of starlikeness and convexity"> radius of starlikeness and convexity</a>, <a href="https://publications.waset.org/abstracts/search?q=Struve%20function" title=" Struve function"> Struve function</a> </p> <a href="https://publications.waset.org/abstracts/63119/geometric-properties-of-some-q-bessel-functions" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/63119.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">276</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=bounds%20of%20linear%20codes&page=2">2</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=bounds%20of%20linear%20codes&page=3">3</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=bounds%20of%20linear%20codes&page=4">4</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=bounds%20of%20linear%20codes&page=5">5</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=bounds%20of%20linear%20codes&page=6">6</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=bounds%20of%20linear%20codes&page=7">7</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=bounds%20of%20linear%20codes&page=8">8</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=bounds%20of%20linear%20codes&page=9">9</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=bounds%20of%20linear%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=bounds%20of%20linear%20codes&page=132">132</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=bounds%20of%20linear%20codes&page=133">133</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=bounds%20of%20linear%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>