Academia.edu no longer supports Internet Explorer.
To browse Academia.edu and the wider internet faster and more securely, please take a few seconds to upgrade your browser.
SIAM Journal on Discrete Mathematics
Revisiting and Improving Upper Bounds for Identifying CodesIn this paper, we analyze the construction of identification codes. Identification codes are based on the question: “Is the message I have just received the one I am interested in?”, as opposed to Shannon’s transmission, where the receiver is interested in not only one, but any, message. The advantage of identification is that it allows rates growing double exponentially in the blocklength at the cost of not being able to decode every message, which might be beneficial in certain applications. We focus on a special identification code construction based on two concatenated Reed-Solomon codes and have a closer look at its implementation, analyzing the trade-offs of identification with respect to transmission and the trade-offs introduced by the computational cost of identification codes.
First, we discuss issues raised with respect to the Theory of Event Coding (TEC)’s scope, that is, its limitations and possible extensions. Then, we address the issue of specificity, that is, the widespread concern that TEC is too unspecified and, therefore, too vague in a number of important respects. Finally, we elaborate on our views about TEC’s relations to other important frameworks and approaches in the field like stages models, ecological approaches, and the two-visual-pathways model.
2011 •
Abstract We consider the problem of generating a connected robust identifying code of a graph, by which we mean a subgraph with two properties:(i) it is connected,(ii) it is robust identifying, in the sense that the (subgraph-) induced neighborhoods of any two vertices differ by at least 2r+ 1 vertices, where r is the robustness parameter. This particular formulation builds upon a rich literature on the identifying code problem but adds a property that is important for some practical networking applications.
2007 •
2024 •
VNU Journal of Foreign Studies
Understanding validity and reliability from qualitative and quantitative research traditionsNeuromarketing y emprendimiento. Plan de marketing para el diseño de un servicio de asesoramiento emprendedor con perspectiva neurocientífica.
Neuromarketing y emprendimiento. Plan de marketing para el diseño de un servicio de asesoramiento emprendedor con perspectiva neurocientífica.2019 •
Journal of Arabic Literature
From Diyārāt to Ziyārat: The Transmutation of the Sacred and Generic Landscape in Syria2022 •
ANCIENT THRACE: MYTH AND REALITY THE PROCEEDINGS OF THE THIRTEENTH INTERNATIONAL CONGRESS OF THRACOLOGY KAZANLAK, SEPTEMBER 3 – 7, 2017
Comparing the Metal Vessel Acquisition Patterns and Trends of the Thracian and Cypriot Elite during the Classical Period2022 •
Anuarul Institutului de Istorie A. D. Xenopol
„Cu iubire tandră, Elisabeta”. „Mereu al tău credincios, Carol”. Corespondența perechii regale, volumul I, 1869–1888, ediție critică și comentată, note și traducere din germană de SILVIA IRINA ZIMMERMANN și ROMANIȚA CONSTANTINESCU2020 •
Isi Bilimi Ve Teknigi Dergisi-journal of Thermal Science and Technology
Üç Katmanli Gözenekli̇ Yakicida Ön Karişimsiz Yanmanin Flamelet Modeli̇ İle Sayisal İncelenmesi̇2021 •
RT/FI (73) 9, CNEN, Roma.
Assessment of the Reliability of the CNEN’s Methods for the Neutronic Design of PWR’s (Part. II: Analysis of B. W. Lumped Burnable Poison Program Experiments)1973 •
Biomedical science and engineering
Engineering a dynamic model of the alveolar interface for the study of aerosol deposition2020 •
Journal of Materials Science: Materials in Electronics
Barium ferrite prepared by modified Pechini method: effects of chloride and nitrate counter ions on microstructures and magnetic properties2017 •
Journal of Public Health
Public health and economic development: the case of Medicaid2023 •
2023 •
2022 •
PAIRS Annual Meeting
Acute Deep Vein Thrombosis with Duplication of Inferior Venecava2018 •