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.
In 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 •
2006 •
Abstract We consider the problem of finding a minimum identifying code in a graph, ie, a designated set of vertices whose neighborhoods uniquely overlap at any vertex on the graph. This identifying code problem was initially introduced in 1998 and has been since fundamentally connected to a wide range of applications, including fault diagnosis, location detection, environmental monitoring, and connections to information theory, superimposed codes, and tilings.
CEUTA Y MELILLA : LA UNIÓN EUROPEA EN LA ORILLA SUR DEL MEDITERRÁNEO -- PROPUESTAS DE CONSOLIDACIÓN EUROPEA PARA LAS CIUDADES, ISLAS Y PEÑONES DE ESPAÑA
2023--LOS PEÑONES DE VÉLEZ Y ALHUCEMAS, PROPUESTAS PARA SU CONVERSION EN LUGARES DE REENCUENTRO Y MEMORIA DE LAS GUERRAS DEL RIF2023 •
Discurso, Cultura e Psicanálise (NASCIMENTO, J; CHAVES, R. orgs)
Entre sujeito, sentido e história: artimanhas entre uma análise do discurso e uma psicanálise2024 •
2024 •
Russian Mathematical Surveys
Mikhail Shlyomovich Birman (on his 70th birthday)2000 •
IEEE Transactions on Information Forensics and Security
Frontal View Gait Recognition With Fusion of Depth Features From a Time of Flight Camera2019 •
The Journal of Clinical Hypertension
Right ventricular mechanics in patients with aortic stenosis and preserved ejection fraction: Is arterial hypertension a new player in the game?2019 •
Otolaryngology-Head and Neck Surgery
P41– Engaging with Spanish speaking patients ‐ Learning from the challenges and achievements of the “Pacientes Online” initiative2010 •
Acta Scientific Dental Scienecs
Comparison of Effectiveness between Acellular Dermal Matrix Allograft and Subepithelial Connective Tissue Graft with Coronally Advanced Flap in Recession Treatment: A Systematic Review2019 •
Revista Terra & Cultura: Cadernos de Ensino e Pesquisa
Stress em renais crônicos: treino de relaxamento amenizando a sessão de hemodiálise2018 •