Zobrazeno 1 - 10
of 188
pro vyhledávání: '"Golomb ruler"'
Publikováno v:
IEEE Access, Vol 10, Pp 1132-1137 (2022)
Let $G$ be an additive group of order $v$ . A $k$ -element subset $D$ of $G$ is called a $(v, k, \lambda, t)$ -almost difference set if the expressions $g-h$ , for $g$ and $h$ in $D$ , represent $t$ of the non-identity elements in $G$ exactly $\lambd
Externí odkaz:
https://doaj.org/article/010388db4e704187bce798b86abd15af
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Publikováno v:
St. Petersburg Polytechnical University Journal: Physics and Mathematics, Vol 14, Iss 4 (2021)
The features of the amplitude behavior of the electromagnetic waves (the profile of a standing wave) reflected by antenna arrays have been studied. These arrays are Golomb rulers of different orders made of copper and HTSC structures. The dependences
Externí odkaz:
https://doaj.org/article/907daed7b91c405ea709ed9d6b922a21
Publikováno v:
Open Mathematics, Vol 15, Iss 1, Pp 520-547 (2017)
Nowadays, nature–inspired metaheuristic algorithms are most powerful optimizing algorithms for solving the NP–complete problems. This paper proposes three approaches to find near–optimal Golomb ruler sequences based on nature–inspired algorit
Externí odkaz:
https://doaj.org/article/d34706ce49134114a0716a2728964e0f
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Publikováno v:
RAIRO - Operations Research. 55:2241-2246
A Golomb Ruler (GR) is a set of integer marks along an imaginary ruler such that all the distances of the marks are different. Computing a GR of minimum length is associated to many applications (from astronomy to information theory). Although not ye
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::5abad734f1741427b666ef1473daa88b
https://doi.org/10.1051/ro/2021103
https://doi.org/10.1051/ro/2021103
Publikováno v:
IEEE Transactions on Communications. 69:2812-2823
In his pioneering work on LDPC codes, Gallager dismissed codes with parity-check matrices of weight two after proving that their minimum Hamming distances grow at most logarithmically with their code lengths. In spite of their poor minimum Hamming di
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::19b614ce3ac38cad11d004cfd76755df
https://doi.org/10.1109/tcomm.2021.3059001
https://doi.org/10.1109/tcomm.2021.3059001
Publikováno v:
IEEE Access, Vol 9, Pp 65482-65489 (2021)
A set of positive integers A is called a $g$ -Golomb ruler if the difference between two distinct elements of A is repeated up to $g$ times. This definition is a generalization of the Golomb ruler $(g = 1)$ . In this paper, we obtain new construction
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::e2084460e51b6de13ed4655c2560a1b7
https://ieeexplore.ieee.org/document/9416442/
https://ieeexplore.ieee.org/document/9416442/
Publikováno v:
IEEE Access, Vol 9, Pp 118042-118050 (2021)
A set of positive integers $A$ is called a Golomb ruler if the difference between two distinct elements of $A$ are different, equivalently if the sums of two elements are different ( $B_{2}$ set, Sidon set). An extension of this concept is to conside
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::0b9164edf88b4ce7fa925451f5c3c060
https://doi.org/10.1109/access.2021.3106617
https://doi.org/10.1109/access.2021.3106617