Zobrazeno 1 - 10
of 3 611
pro vyhledávání: '"[ INFO.INFO-IT ] Computer Science [cs]/Information Theory [cs.IT]"'
Autor:
Rocco Mora, Jean-Pierre Tillich
Publikováno v:
Designs, Codes and Cryptography
Designs, Codes and Cryptography, 2022, ⟨10.1007/s10623-022-01153-w⟩
Designs, Codes and Cryptography, 2022, ⟨10.1007/s10623-022-01153-w⟩
International audience; The Goppa Code Distinguishing (GD) problem asks to distinguish efficiently a generator matrix of a Goppa code from a randomly drawn one. We revisit a distinguisher for alternant and Goppa codes through a new approach, namely b
Publikováno v:
Designs, Codes and Cryptography
Designs, Codes and Cryptography, 2022
Designs, Codes and Cryptography, 2022
Strongly walk regular graphs (SWRGs or $s$-SWRGs) form a natural generalization of strongly regular graphs (SRGs) where paths of length~2 are replaced by paths of length~$s$. They can be constructed as coset graphs of the duals of projective three-we
Publikováno v:
Journal of the Korean Statistical Society. 52:154-184
The determination of the number of mixture components (the order) of a finite mixture model has been an enduring problem in statistical inference. We prove that the closed testing principle leads to a sequential testing procedure (STP) that allows fo
Autor:
Federico Brunero, Petros Elia
Publikováno v:
IEEE Transactions on Information Theory
IEEE Transactions on Information Theory, 2023, 69 (2), pp.1037-1056. ⟨10.1109/TIT.2022.3193723⟩
IEEE Transactions on Information Theory, 2023, 69 (2), pp.1037-1056. ⟨10.1109/TIT.2022.3193723⟩
This work identifies the fundamental limits of Multi-Access Coded Caching (MACC) where each user is connected to multiple caches in a manner that follows a generalized combinatorial topology. This topology stands out as it allows for unprecedented co
Publikováno v:
Advances in Mathematics of Communications
Advances in Mathematics of Communications, AIMS, 2021, ⟨10.3934/amc.2021022⟩
Advances in Mathematics of Communications, 2021, ⟨10.3934/amc.2021022⟩
Advances in Mathematics of Communications, AIMS, 2021, ⟨10.3934/amc.2021022⟩
Advances in Mathematics of Communications, 2021, ⟨10.3934/amc.2021022⟩
In this paper, for each of six families of three-valued \begin{document}$ m $\end{document} -sequence correlation, we construct an infinite family of five-weight codes from trace codes over the ring \begin{document}$ R = \mathbb{F}_2+u\mathbb{F}_2 $\
Autor:
Viallard, Paul
Publikováno v:
CAp 2023-Conférence sur l’Apprentissage Automatique
CAp 2023-Conférence sur l’Apprentissage Automatique, Jul 2023, Strasbourg, France
CAp 2023-Conférence sur l’Apprentissage Automatique, Jul 2023, Strasbourg, France
International audience; Dans cet article, nous dérivons des bornes de généralisation basées sur la théorie de l’information. Nous prouvons une borne dépendant de l’information mutuelle qui est plus générale que celle de Xu et Raginsky. Ce
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od_______165::5a11a7e0e837269a8b50e31b31ba4dfc
https://hal.science/hal-04093184
https://hal.science/hal-04093184
Autor:
Hien Duy Nguyen, Mayetri Gupta
In recent years, Empirical Bayesian (EB) inference has become an attractive approach for estimation in parametric models arising in a variety of real-life problems, especially in complex and high-dimensional scientific applications. However, compared
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::d605db881ddd209c3981ba69a2a220e9
http://arxiv.org/abs/2302.14531
http://arxiv.org/abs/2302.14531
Publikováno v:
IEEE Transactions on Network and Service Management
IEEE Transactions on Network and Service Management, 2022, 19 (3), pp.2309-2332. ⟨10.1109/TNSM.2022.3177512⟩
IEEE Transactions on Network and Service Management, 2022, 19 (3), pp.2309-2332. ⟨10.1109/TNSM.2022.3177512⟩
International audience; In 2016, Google introduced the concept of Federated Learning (FL), enabling collaborative Machine Learning (ML). FL does not share local data but ML models, offering applications in diverse domains. This paper focuses on the a
Publikováno v:
IEEE Transactions on Information Theory
IEEE Transactions on Information Theory, 2022
IEEE Transactions on Information Theory, 2022
International audience; We prove that the covering radius of the Melas code M (m, q) of length n = q m − 1 over Fq is 2 if q > 3. We also prove that the covering radius of M (m, 3) is 3 is m ≥ 3, the covering radius of M (2, 3) is 4, and the cove
Autor:
Andrew Whetten
Publikováno v:
Ecology and Evolution
Ecology and Evolution, Vol 11, Iss 24, Pp 17786-17800 (2021)
Ecology and Evolution, Vol 11, Iss 24, Pp 17786-17800 (2021)
The collection of animal position data via GPS tracking devices has increased in quality and usage in recent years. Animal position and movement, although measured discretely, follows the same principles of kinematic motion, and as such, the process