On two variations of identifying codes
Copyright policy )On two variations of identifying codes
Identifying codes have been introduced in 1998 to model fault-detection in multiprocessor systems. In this paper, we introduce two variations of identifying codes: weak codes and light codes. They correspond to fault-detection by successive rounds. We give exact bounds for those two definitions for the family of cycles.
- Universite de Bordeaux France
- UNIVERSITE DE BORDEAUX 1 France
- Institut Fourier France
- University of Bordeaux France
- UNIVERSITE DE BORDEAUX France
FOS: Computer and information sciences, Discrete Mathematics (cs.DM), Computer Science - Information Theory, identifying codes, cycles, Reliability, testing and fault tolerance of networks and computer systems, Theoretical Computer Science, Identifying codes, metric basis, FOS: Mathematics, Discrete Mathematics and Combinatorics, Mathematics - Combinatorics, Other types of codes, Information Theory (cs.IT), fault detection, Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.), Cycles, Metric basis, Combinatorics (math.CO), Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science), Paths and cycles, Computer Science - Discrete Mathematics
FOS: Computer and information sciences, Discrete Mathematics (cs.DM), Computer Science - Information Theory, identifying codes, cycles, Reliability, testing and fault tolerance of networks and computer systems, Theoretical Computer Science, Identifying codes, metric basis, FOS: Mathematics, Discrete Mathematics and Combinatorics, Mathematics - Combinatorics, Other types of codes, Information Theory (cs.IT), fault detection, Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.), Cycles, Metric basis, Combinatorics (math.CO), Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science), Paths and cycles, Computer Science - Discrete Mathematics
selected citations These citations are derived from selected sources.This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).1 popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.Average influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).Average impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.Average
Citations provided by BIP!Popularity provided by BIP!