2012/05/10 by José Cáceres, Cáceres, José, Carmen Hernando +8
Computer Science · Mathematics · #Coding theory and cryptography #Combinatorics (math.CO) #Cooperative Communication and Network Coding #FOS: Computer and information sciences #FOS: Mathematics #Graph Labeling and Dimension Problems #Information Theory (cs.IT) #cs.IT #math.CO #math.IT
paper · pdf · doi:10.48550/arxiv.1205.2177
6 pages, 6 figures
arxiv created 2012/05/10 · openalex publication_date 2012/05/10 · arxiv updated 2012/05/11 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
In this work, two types of codes such that they both dominate and locate the vertices of a graph are studied. Those codes might be sets of detectors in a network or processors controlling a system whose set of responses should determine a malfunctioning processor or an intruder. Here, we present our more significant contributions on λ-codes and η-codes concerning concerning bounds, extremal values and realization theorems.