İçeriğe geç
akaturk Akademik ölçüm

OpenAlex konusu

graph theory and CDMA systems

Bu sayfa OpenAlex konu etiketine göre çalışmaları ve o konuda görünen akademisyenleri listeler. YÖKSİS temel alan / yan dal değildir.

OpenAlex 1.365 eser 74 yazar konusu

Çalışmalar

1.365 eser

  1. OpenAlex üst %10 OpenAlex 96.3%

    The authors provide an analysis of the performance of optical orthogonal codes in an optical code division multiple access (CDMA) network by considering the probability distribution of the interference patterns. It is shown that the actual performance is close to a previous estimate. A less structured temporal code in…

  2. OpenAlex üst %10 OpenAlex 98.2%

    The sixth generation (6G) of mobile network will be composed by different nodes, from macro-devices (satellite) to nano-devices (sensors inside the human body), providing a full connectivity fabric all around us. These heterogeneous nodes constitute an ultra dense network managing tons of information, often very sensi…

  3. YÖKSİS SJR Q1 JCR Q2 OpenAlex üst %1 OpenAlex 99.4%

    Özet henüz yok.

  4. YÖKSİS OpenAlex üst %10 OpenAlex 98.6%

    Linear complementary dual (LCD) codes are binary linear codes that meet their dual trivially. We construct LCD codes using orthogonal matrices, self-dual codes, combinatorial designs and Gray map from codes over the family of rings Rk. We give a linear programming bound on the largest size of an LCD code of given leng…

  5. OpenAlex üst %10 OpenAlex 97.1%

    Özet henüz yok.

  6. YÖKSİS SJR Q1 JCR Q2 OpenAlex üst %10 OpenAlex 97.1%

    Özet henüz yok.

  7. OpenAlex üst %10 OpenAlex 94.5%

    In this letter, we propose a parallel artificial bee colony (P-ABC) algorithm based on a new search strategy. Performance of the P-ABC is tested for peak-to-average power ratio (PAPR) reduction problem using selected mapping (SLM) scheme in both orthogonal frequency division multiplexing (OFDM) and multiple-input mult…

  8. YÖKSİS SJR Q1 JCR Q2 OpenAlex üst %10 OpenAlex 94.9%

    Özet henüz yok.

  9. YÖKSİS SJR Q1 JCR Q1 OpenAlex üst %10 OpenAlex 95.6%

    We report on careful implementations of seven algorithms for solving the problem of finding a maximum transversal of a sparse matrix. We analyze the algorithms and discuss the design choices. To the best of our knowledge, this is the most comprehensive comparison of maximum transversal algorithms based on augmenting p…

  10. YÖKSİS SJR Q2 JCR Q4 OpenAlex üst %10 OpenAlex 92.1%

    In this paper, a new class of additive codes which is referred to as ℤ2 ℤ2[u]-additive codes is introduced. This is a generalization towards another direction of recently introduced ℤ2 ℤ4-additive codes [J. Borges, C. Fernández-Córdoba, J. Pujol, J. Rif´a, and M. Villanueva, ℤ2 ℤ4-linear codes: Generator matrices and…

  11. OpenAlex üst %10 OpenAlex 98.6%

    Linear complementary dual (LCD) codes are binary linear codes that meet their dual trivially. We construct LCD codes using orthogonal matrices, self-dual codes, combinatorial designs and Gray map from codes over the family of rings Rk. We give a linear programming bound on the largest size of an LCD code of given leng…

  12. YÖKSİS SJR Q3 JCR Q3 OpenAlex üst %10 OpenAlex 93.1%

    Abstract: Z2Z4-additive codes, as a special class of abelian codes, have found a very welcoming place in the recent studies of algebraic coding theory. This family in one hand is similar to binary codes on the other hand is similar to quaternary codes. The structure ofZ2Z4additive codes and their duals has been determ…

Akademisyenler

74 akademisyen