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: rank metric codes</title> <meta name="description" content="Search results for: rank metric codes"> <meta name="keywords" content="rank metric 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="rank metric 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="rank metric 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> 1317</div> </div> </div> </div> <h1 class="mt-3 mb-3 text-center" style="font-size:1.6rem;">Search results for: rank metric codes</h1> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">1317</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">1316</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">1315</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">1314</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">1313</span> Irreducible Sign Patterns of Minimum Rank of 3 and Symmetric Sign Patterns That Allow Diagonalizability</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Sriparna%20Bandopadhyay">Sriparna Bandopadhyay</a> </p> <p class="card-text"><strong>Abstract:</strong></p> It is known that irreducible sign patterns in general may not allow diagonalizability and in particular irreducible sign patterns with minimum rank greater than or equal to 4. It is also known that every irreducible sign pattern matrix with minimum rank of 2 allow diagonalizability with rank of 2 and the maximum rank of the sign pattern. In general sign patterns with minimum rank of 3 may not allow diagonalizability if the condition of irreducibility is dropped, but the problem of whether every irreducible sign pattern with minimum rank of 3 allows diagonalizability remains open. In this paper it is shown that irreducible sign patterns with minimum rank of 3 under certain conditions on the underlying graph allow diagonalizability. An alternate proof of the results that every sign pattern matrix with minimum rank of 2 and no zero lines allow diagonalizability with rank of 2 and also that every full sign pattern allows diagonalizability with all permissible ranks of the sign pattern is given. Some open problems regarding composite cycles in an irreducible symmetric sign pattern that support of a rank principal certificate are also answered. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=irreducible%20sign%20patterns" title="irreducible sign patterns">irreducible sign patterns</a>, <a href="https://publications.waset.org/abstracts/search?q=minimum%20rank" title=" minimum rank"> minimum rank</a>, <a href="https://publications.waset.org/abstracts/search?q=symmetric%20sign%20patterns" title=" symmetric sign patterns"> symmetric sign patterns</a>, <a href="https://publications.waset.org/abstracts/search?q=rank%20-principal%20certificate" title=" rank -principal certificate"> rank -principal certificate</a>, <a href="https://publications.waset.org/abstracts/search?q=allowing%20diagonalizability" title=" allowing diagonalizability"> allowing diagonalizability</a> </p> <a href="https://publications.waset.org/abstracts/173597/irreducible-sign-patterns-of-minimum-rank-of-3-and-symmetric-sign-patterns-that-allow-diagonalizability" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/173597.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">98</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">1312</span> A Simple Recursive Framework to Generate Gray Codes for Weak Orders in Constant Amortized Time </h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Marsden%20Jacques">Marsden Jacques</a>, <a href="https://publications.waset.org/abstracts/search?q=Dennis%20Wong"> Dennis Wong</a> </p> <p class="card-text"><strong>Abstract:</strong></p> A weak order is a way to rank n objects where ties are allowed. In this talk, we present a recursive framework to generate Gray codes for weak orders. We then describe a simple algorithm based on the framework that generates 2-Gray codes for weak orders in constant amortized time per string. This framework can easily be modified to generate other Gray codes for weak orders. We provide an example on using the framework to generate the first Shift Gray code for weak orders, also in constant amortized time, where consecutive strings differ by a shift or a symbol change. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=weak%20order" title="weak order">weak order</a>, <a href="https://publications.waset.org/abstracts/search?q=Cayley%20permutation" title=" Cayley permutation"> Cayley permutation</a>, <a href="https://publications.waset.org/abstracts/search?q=Gray%20code" title=" Gray code"> Gray code</a>, <a href="https://publications.waset.org/abstracts/search?q=shift%20Gray%20code" title=" shift Gray code"> shift Gray code</a> </p> <a href="https://publications.waset.org/abstracts/118752/a-simple-recursive-framework-to-generate-gray-codes-for-weak-orders-in-constant-amortized-time" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/118752.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">177</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">1311</span> A Combinatorial Representation for the Invariant Measure of Diffusion Processes on Metric Graphs</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Michele%20Aleandri">Michele Aleandri</a>, <a href="https://publications.waset.org/abstracts/search?q=Matteo%20Colangeli"> Matteo Colangeli</a>, <a href="https://publications.waset.org/abstracts/search?q=Davide%20%20Gabrielli"> Davide Gabrielli</a> </p> <p class="card-text"><strong>Abstract:</strong></p> We study a generalization to a continuous setting of the classical Markov chain tree theorem. In particular, we consider an irreducible diffusion process on a metric graph. The unique invariant measure has an atomic component on the vertices and an absolutely continuous part on the edges. We show that the corresponding density at x can be represented by a normalized superposition of the weights associated to metric arborescences oriented toward the point x. A metric arborescence is a metric tree oriented towards its root. The weight of each oriented metric arborescence is obtained by the product of the exponential of integrals of the form ∫a/b², where b is the drift and σ² is the diffusion coefficient, along the oriented edges, for a weight for each node determined by the local orientation of the arborescence around the node and for the inverse of the diffusion coefficient at x. The metric arborescences are obtained by cutting the original metric graph along some edges. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=diffusion%20processes" title="diffusion processes">diffusion processes</a>, <a href="https://publications.waset.org/abstracts/search?q=metric%20graphs" title=" metric graphs"> metric graphs</a>, <a href="https://publications.waset.org/abstracts/search?q=invariant%20measure" title=" invariant measure"> invariant measure</a>, <a href="https://publications.waset.org/abstracts/search?q=reversibility" title=" reversibility"> reversibility</a> </p> <a href="https://publications.waset.org/abstracts/137576/a-combinatorial-representation-for-the-invariant-measure-of-diffusion-processes-on-metric-graphs" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/137576.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">172</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">1310</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">1309</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">1308</span> Nadler's Fixed Point Theorem on Partial Metric Spaces and its Application to a Homotopy Result</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Hemant%20Kumar%20Pathak">Hemant Kumar Pathak</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In 1994, Matthews (S.G. Matthews, Partial metric topology, in: Proc. 8th Summer Conference on General Topology and Applications, in: Ann. New York Acad. Sci., vol. 728, 1994, pp. 183-197) introduced the concept of a partial metric as a part of the study of denotational semantics of data flow networks. He gave a modified version of the Banach contraction principle, more suitable in this context. In fact, (complete) partial metric spaces constitute a suitable framework to model several distinguished examples of the theory of computation and also to model metric spaces via domain theory. In this paper, we introduce the concept of almost partial Hausdorff metric. We prove a fixed point theorem for multi-valued mappings on partial metric space using the concept of almost partial Hausdorff metric and prove an analogous to the well-known Nadler’s fixed point theorem. In the sequel, we derive a homotopy result as an application of our main result. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=fixed%20point" title="fixed point">fixed point</a>, <a href="https://publications.waset.org/abstracts/search?q=partial%20metric%20space" title=" partial metric space"> partial metric space</a>, <a href="https://publications.waset.org/abstracts/search?q=homotopy" title=" homotopy"> homotopy</a>, <a href="https://publications.waset.org/abstracts/search?q=physical%20sciences" title=" physical sciences"> physical sciences</a> </p> <a href="https://publications.waset.org/abstracts/5182/nadlers-fixed-point-theorem-on-partial-metric-spaces-and-its-application-to-a-homotopy-result" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/5182.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">441</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">1307</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">1306</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">1305</span> Some Results on the Generalized Higher Rank Numerical Ranges</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Mohsen%20Zahraei">Mohsen Zahraei</a> </p> <p class="card-text"><strong>Abstract:</strong></p> ‎In this paper, ‎the notion of ‎rank-k numerical range of rectangular complex matrix polynomials‎ ‎are introduced. ‎Some algebraic and geometrical properties are investigated. ‎Moreover, ‎for ε>0 the notion of Birkhoff-James approximate orthogonality sets for ε-higher ‎rank numerical ranges of rectangular matrix polynomials is also introduced and studied. ‎The proposed definitions yield a natural generalization of the standard higher rank numerical ranges. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=%E2%80%8E%E2%80%8ERank-k%20numerical%20range%E2%80%8E" title="‎‎Rank-k numerical range‎">‎‎Rank-k numerical range‎</a>, <a href="https://publications.waset.org/abstracts/search?q=%E2%80%8Eisometry%E2%80%8E" title=" ‎isometry‎"> ‎isometry‎</a>, <a href="https://publications.waset.org/abstracts/search?q=%E2%80%8Enumerical%20range%E2%80%8E" title=" ‎numerical range‎"> ‎numerical range‎</a>, <a href="https://publications.waset.org/abstracts/search?q=%E2%80%8Erectangular%20matrix%20polynomials" title=" ‎rectangular matrix polynomials"> ‎rectangular matrix polynomials</a> </p> <a href="https://publications.waset.org/abstracts/28955/some-results-on-the-generalized-higher-rank-numerical-ranges" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/28955.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">459</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">1304</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">1303</span> Metric Suite for Schema Evolution of a Relational Database</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=S.%20Ravichandra">S. Ravichandra</a>, <a href="https://publications.waset.org/abstracts/search?q=D.%20V.%20L.%20N.%20Somayajulu"> D. V. L. N. Somayajulu</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Requirement of stakeholders for adding more details to the database is the main cause of the schema evolution in the relational database. Further, this schema evolution causes the instability to the database. Hence, it is aimed to define a metric suite for schema evolution of a relational database. The metric suite will calculate the metrics based on the features of the database, analyse the queries on the database and measures the coupling, cohesion and component dependencies of the schema for existing and evolved versions of the database. This metric suite will also provide an indicator for the problems related to the stability and usability of the evolved database. The degree of change in the schema of a database is presented in the forms of graphs that acts as an indicator and also provides the relations between various parameters (metrics) related to the database architecture. The acquired information is used to defend and improve the stability of database architecture. The challenges arise in incorporating these metrics with varying parameters for formulating a suitable metric suite are discussed. To validate the proposed metric suite, an experimentation has been performed on publicly available datasets. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=cohesion" title="cohesion">cohesion</a>, <a href="https://publications.waset.org/abstracts/search?q=coupling" title=" coupling"> coupling</a>, <a href="https://publications.waset.org/abstracts/search?q=entropy" title=" entropy"> entropy</a>, <a href="https://publications.waset.org/abstracts/search?q=metric%20suite" title=" metric suite"> metric suite</a>, <a href="https://publications.waset.org/abstracts/search?q=schema%20evolution" title=" schema evolution"> schema evolution</a> </p> <a href="https://publications.waset.org/abstracts/54754/metric-suite-for-schema-evolution-of-a-relational-database" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/54754.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">451</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">1302</span> Cognitive Weighted Polymorphism Factor: A New Cognitive Complexity Metric</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=T.%20Francis%20Thamburaj">T. Francis Thamburaj</a>, <a href="https://publications.waset.org/abstracts/search?q=A.%20Aloysius"> A. Aloysius</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Polymorphism is one of the main pillars of the object-oriented paradigm. It induces hidden forms of class dependencies which may impact software quality, resulting in higher cost factor for comprehending, debugging, testing, and maintaining the software. In this paper, a new cognitive complexity metric called Cognitive Weighted Polymorphism Factor (CWPF) is proposed. Apart from the software structural complexity, it includes the cognitive complexity on the basis of type. The cognitive weights are calibrated based on 27 empirical studies with 120 persons. A case study and experimentation of the new software metric shows positive results. Further, a comparative study is made and the correlation test has proved that CWPF complexity metric is a better, more comprehensive, and more realistic indicator of the software complexity than Abreu’s Polymorphism Factor (PF) complexity metric. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=cognitive%20complexity%20metric" title="cognitive complexity metric">cognitive complexity metric</a>, <a href="https://publications.waset.org/abstracts/search?q=object-oriented%20metrics" title=" object-oriented metrics"> object-oriented metrics</a>, <a href="https://publications.waset.org/abstracts/search?q=polymorphism%20factor" title=" polymorphism factor"> polymorphism factor</a>, <a href="https://publications.waset.org/abstracts/search?q=software%20metrics" title=" software metrics"> software metrics</a> </p> <a href="https://publications.waset.org/abstracts/36961/cognitive-weighted-polymorphism-factor-a-new-cognitive-complexity-metric" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/36961.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">458</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">1301</span> Some Classes of Lorentzian Alpha-Sasakian Manifolds with Respect to Quarter-Symmetric Metric Connection</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Santu%20Dey">Santu Dey</a>, <a href="https://publications.waset.org/abstracts/search?q=Arindam%20Bhattacharyya"> Arindam Bhattacharyya</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The object of the present paper is to study a quarter-symmetric metric connection in a Lorentzian α-Sasakian manifold. We study some curvature properties of Lorentzian α-Sasakian manifold with respect to quarter-symmetric metric connection. We investigate quasi-projectively at, Φ-symmetric, Φ-projectively at Lorentzian α-Sasakian manifolds with respect to quarter-symmetric metric connection. We also discuss Lorentzian α-Sasakian manifold admitting quartersymmetric metric connection satisfying P.S = 0, where P denote the projective curvature tensor with respect to quarter-symmetric metric connection. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=quarter-symmetric%20metric%20connection" title="quarter-symmetric metric connection">quarter-symmetric metric connection</a>, <a href="https://publications.waset.org/abstracts/search?q=Lorentzian%20alpha-Sasakian%20manifold" title=" Lorentzian alpha-Sasakian manifold"> Lorentzian alpha-Sasakian manifold</a>, <a href="https://publications.waset.org/abstracts/search?q=quasi-projectively%20flat%20Lorentzian%20alpha-Sasakian%20manifold" title=" quasi-projectively flat Lorentzian alpha-Sasakian manifold"> quasi-projectively flat Lorentzian alpha-Sasakian manifold</a>, <a href="https://publications.waset.org/abstracts/search?q=phi-symmetric%20manifold" title=" phi-symmetric manifold"> phi-symmetric manifold</a> </p> <a href="https://publications.waset.org/abstracts/66809/some-classes-of-lorentzian-alpha-sasakian-manifolds-with-respect-to-quarter-symmetric-metric-connection" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/66809.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">239</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">1300</span> Metric Dimension on Line Graph of Honeycomb Networks</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=M.%20Hussain">M. Hussain</a>, <a href="https://publications.waset.org/abstracts/search?q=Aqsa%20Farooq"> Aqsa Farooq</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Let G = (V,E) be a connected graph and distance between any two vertices a and b in G is a−b geodesic and is denoted by d(a, b). A set of vertices W resolves a graph G if each vertex is uniquely determined by its vector of distances to the vertices in W. A metric dimension of G is the minimum cardinality of a resolving set of G. In this paper line graph of honeycomb network has been derived and then we calculated the metric dimension on line graph of honeycomb network. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=Resolving%20set" title="Resolving set">Resolving set</a>, <a href="https://publications.waset.org/abstracts/search?q=Metric%20dimension" title=" Metric dimension"> Metric dimension</a>, <a href="https://publications.waset.org/abstracts/search?q=Honeycomb%20network" title=" Honeycomb network"> Honeycomb network</a>, <a href="https://publications.waset.org/abstracts/search?q=Line%20graph" title=" Line graph"> Line graph</a> </p> <a href="https://publications.waset.org/abstracts/101558/metric-dimension-on-line-graph-of-honeycomb-networks" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/101558.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">200</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">1299</span> Choosing between the Regression Correlation, the Rank Correlation, and the Correlation Curve</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Roger%20L.%20Goodwin">Roger L. Goodwin</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper presents a rank correlation curve. The traditional correlation coefficient is valid for both continuous variables and for integer variables using rank statistics. Since the correlation coefficient has already been established in rank statistics by Spearman, such a calculation can be extended to the correlation curve. This paper presents two survey questions. The survey collected non-continuous variables. We will show weak to moderate correlation. Obviously, one question has a negative effect on the other. A review of the qualitative literature can answer which question and why. The rank correlation curve shows which collection of responses has a positive slope and which collection of responses has a negative slope. Such information is unavailable from the flat, "first-glance" correlation statistics. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=Bayesian%20estimation" title="Bayesian estimation">Bayesian estimation</a>, <a href="https://publications.waset.org/abstracts/search?q=regression%20model" title=" regression model"> regression model</a>, <a href="https://publications.waset.org/abstracts/search?q=rank%20statistics" title=" rank statistics"> rank statistics</a>, <a href="https://publications.waset.org/abstracts/search?q=correlation" title=" correlation"> correlation</a>, <a href="https://publications.waset.org/abstracts/search?q=correlation%20curve" title=" correlation curve"> correlation curve</a> </p> <a href="https://publications.waset.org/abstracts/9847/choosing-between-the-regression-correlation-the-rank-correlation-and-the-correlation-curve" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/9847.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">475</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">1298</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">1297</span> Developing HRCT Criterion to Predict the Risk of Pulmonary Tuberculosis</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Vandna%20Raghuvanshi">Vandna Raghuvanshi</a>, <a href="https://publications.waset.org/abstracts/search?q=Vikrant%20Thakur"> Vikrant Thakur</a>, <a href="https://publications.waset.org/abstracts/search?q=Anupam%20Jhobta"> Anupam Jhobta</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Objective: To design HRCT criterion to forecast the threat of pulmonary tuberculosis. Material and methods: This was a prospective study of 69 patients with clinical suspicion of pulmonary tuberculosis. We studied their medical characteristics, numerous separate HRCT-results, and a combination of HRCT findings to foresee the danger for PTB by utilizing univariate and multivariate investigation. Temporary HRCT diagnostic criteria were planned in view of these outcomes to find out the risk of PTB and tested these criteria on our patients. Results: The results of HRCT chest were analyzed, and Rank was given from 1 to 4 according to the HRCT chest findings. Sensitivity, specificity, positive predictive value, and negative predictive value were calculated. Rank 1: Highly suspected PTB. Rank 2: Probable PTB Rank 3: Nonspecific or difficult to differentiate from other diseases Rank 4: Other suspected diseases • Rank 1 (Highly suspected TB) was present in 22 (31.9%) patients, all of them finally diagnosed to have pulmonary tuberculosis. The sensitivity, specificity, and negative likelihood ratio for RANK 1 on HRCT chest was 53.6%, 100%, and 0.43, respectively. • Rank 2 (Probable TB) was present in 13 patients, out of which 12 were tubercular, and 1 was non-tubercular. • The sensitivity, specificity, positive likelihood ratio, and negative likelihood ratio of the combination of Rank 1 and Rank 2 was 82.9%, 96.4%, 23.22, and 0.18, respectively. • Rank 3 (Non-specific TB) was present in 25 patients, and out of these, 7 were tubercular, and 18 were non-tubercular. • When all these 3 ranks were considered together, the sensitivity approached 100% however, the specificity reduced to 35.7%. The positive likelihood ratio and negative likelihood ratio were 1.56 and 0, respectively. • Rank 4 (Other specific findings) was given to 9 patients, and all of these were non-tubercular. Conclusion: HRCT is useful in selecting individuals with greater chances of pulmonary tuberculosis. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=pulmonary" title="pulmonary">pulmonary</a>, <a href="https://publications.waset.org/abstracts/search?q=tuberculosis" title=" tuberculosis"> tuberculosis</a>, <a href="https://publications.waset.org/abstracts/search?q=multivariate" title=" multivariate"> multivariate</a>, <a href="https://publications.waset.org/abstracts/search?q=HRCT" title=" HRCT"> HRCT</a> </p> <a href="https://publications.waset.org/abstracts/142334/developing-hrct-criterion-to-predict-the-risk-of-pulmonary-tuberculosis" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/142334.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">172</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">1296</span> A Basic Metric Model: Foundation for an Evidence-Based HRM System</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=K.%20M.%20Anusha">K. M. Anusha</a>, <a href="https://publications.waset.org/abstracts/search?q=R.%20Krishnaveni"> R. Krishnaveni</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Crossing a decade of the 21st century, the paradigm of human resources can be seen evolving with the strategic gene induced into it. There seems to be a radical shift descending as the corporate sector calls on its HR team to become strategic rather than administrative. This transferal eventually requires the metrics employed by these HR teams not to be just operationally reactive but to be aligned to an evidence-based strategic thinking. Realizing the growing need for a prescriptive metric model for effective HR analytics, this study has designed a conceptual framework for a basic metric model that can assist IT-HRM professionals to transition to a practice of evidence-based decision-making to enhance organizational performance. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=metric%20model" title="metric model">metric model</a>, <a href="https://publications.waset.org/abstracts/search?q=evidence%20based%20HR" title=" evidence based HR"> evidence based HR</a>, <a href="https://publications.waset.org/abstracts/search?q=HR%20analytics" title=" HR analytics"> HR analytics</a>, <a href="https://publications.waset.org/abstracts/search?q=strategic%20HR%20practices" title=" strategic HR practices"> strategic HR practices</a>, <a href="https://publications.waset.org/abstracts/search?q=IT%20sector" title=" IT sector"> IT sector</a> </p> <a href="https://publications.waset.org/abstracts/10122/a-basic-metric-model-foundation-for-an-evidence-based-hrm-system" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/10122.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">403</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">1295</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">1294</span> On the Influence of the Metric Space in the Critical Behavior of Magnetic Temperature</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=J.%20C.%20Ria%C3%B1o-Rojas">J. C. Riaño-Rojas</a>, <a href="https://publications.waset.org/abstracts/search?q=J.%20D.%20Alzate-Cardona"> J. D. Alzate-Cardona</a>, <a href="https://publications.waset.org/abstracts/search?q=E.%20Restrepo-Parra"> E. Restrepo-Parra</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this work, a study of generic magnetic nanoparticles varying the metric space is presented. As the metric space is changed, the nanoparticle form and the inner product are also varied, since the energetic scale is not conserved. This study is carried out using Monte Carlo simulations combined with the Wolff embedding and Metropolis algorithms. The Metropolis algorithm is used at high temperature regions to reach the equilibrium quickly. The Wolff embedding algorithm is used at low and critical temperature regions in order to reduce the critical slowing down phenomenon. The ions number is kept constant for the different forms and the critical temperatures using finite size scaling are found. We observed that critical temperatures don't exhibit significant changes when the metric space was varied. Additionally, the effective dimension according the metric space was determined. A study of static behavior for reaching the static critical exponents was developed. The objective of this work is to observe the behavior of the thermodynamic quantities as energy, magnetization, specific heat, susceptibility and Binder's cumulants at the critical region, in order to demonstrate if the magnetic nanoparticles describe their magnetic interactions in the Euclidean space or if there is any correspondence in other metric spaces. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=nanoparticles" title="nanoparticles">nanoparticles</a>, <a href="https://publications.waset.org/abstracts/search?q=metric" title=" metric"> metric</a>, <a href="https://publications.waset.org/abstracts/search?q=Monte%20Carlo" title=" Monte Carlo"> Monte Carlo</a>, <a href="https://publications.waset.org/abstracts/search?q=critical%20behaviour" title=" critical behaviour"> critical behaviour</a> </p> <a href="https://publications.waset.org/abstracts/29244/on-the-influence-of-the-metric-space-in-the-critical-behavior-of-magnetic-temperature" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/29244.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">515</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">1293</span> Fairness in Recommendations Ranking: From Pairwise Approach to Listwise Approach</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Patik%20Joslin%20Kenfack">Patik Joslin Kenfack</a>, <a href="https://publications.waset.org/abstracts/search?q=Polyakov%20Vladimir%20Mikhailovich"> Polyakov Vladimir Mikhailovich</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Machine Learning (ML) systems are trained using human generated data that could be biased by implicitly containing racist, sexist, or discriminating data. ML models learn those biases or even amplify them. Recent research in work on has begun to consider issues of fairness. The concept of fairness is extended to recommendation. A recommender system will be considered fair if it doesn’t under rank items of protected group (gender, race, demographic...). Several metrics for evaluating fairness concerns in recommendation systems have been proposed, which take pairs of items as ‘instances’ in fairness evaluation. It doesn’t take in account the fact that the fairness should be evaluated across a list of items. The paper explores a probabilistic approach that generalize pairwise metric by using a list k (listwise) of items as ‘instances’ in fairness evaluation, parametrized by k. We also explore new regularization method based on this metric to improve fairness ranking during model training. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=Fairness" title="Fairness">Fairness</a>, <a href="https://publications.waset.org/abstracts/search?q=Recommender%20System" title=" Recommender System"> Recommender System</a>, <a href="https://publications.waset.org/abstracts/search?q=Ranking" title=" Ranking"> Ranking</a>, <a href="https://publications.waset.org/abstracts/search?q=Listwise%20Approach" title=" Listwise Approach"> Listwise Approach</a> </p> <a href="https://publications.waset.org/abstracts/124058/fairness-in-recommendations-ranking-from-pairwise-approach-to-listwise-approach" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/124058.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">148</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">1292</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">1291</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">1290</span> Robust Variogram Fitting Using Non-Linear Rank-Based Estimators</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Hazem%20M.%20Al-Mofleh">Hazem M. Al-Mofleh</a>, <a href="https://publications.waset.org/abstracts/search?q=John%20E.%20Daniels"> John E. Daniels</a>, <a href="https://publications.waset.org/abstracts/search?q=Joseph%20W.%20McKean"> Joseph W. McKean</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper numerous robust fitting procedures are considered in estimating spatial variograms. In spatial statistics, the conventional variogram fitting procedure (non-linear weighted least squares) suffers from the same outlier problem that has plagued this method from its inception. Even a 3-parameter model, like the variogram, can be adversely affected by a single outlier. This paper uses the Hogg-Type adaptive procedures to select an optimal score function for a rank-based estimator for these non-linear models. Numeric examples and simulation studies will demonstrate the robustness, utility, efficiency, and validity of these estimates. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=asymptotic%20relative%20efficiency" title="asymptotic relative efficiency">asymptotic relative efficiency</a>, <a href="https://publications.waset.org/abstracts/search?q=non-linear%20rank-based" title=" non-linear rank-based"> non-linear rank-based</a>, <a href="https://publications.waset.org/abstracts/search?q=rank%20estimates" title=" rank estimates"> rank estimates</a>, <a href="https://publications.waset.org/abstracts/search?q=variogram" title=" variogram"> variogram</a> </p> <a href="https://publications.waset.org/abstracts/43980/robust-variogram-fitting-using-non-linear-rank-based-estimators" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/43980.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">1289</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">1288</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> <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=rank%20metric%20codes&page=2">2</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=rank%20metric%20codes&page=3">3</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=rank%20metric%20codes&page=4">4</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=rank%20metric%20codes&page=5">5</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=rank%20metric%20codes&page=6">6</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=rank%20metric%20codes&page=7">7</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=rank%20metric%20codes&page=8">8</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=rank%20metric%20codes&page=9">9</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=rank%20metric%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=rank%20metric%20codes&page=43">43</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=rank%20metric%20codes&page=44">44</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=rank%20metric%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>