Results 31 to 40 of about 2,148,225 (286)
The internal description of a causal set: What the universe looks like from the inside [PDF]
, 1999 We describe an algebraic way to code the causal information of a discrete spacetime. The causal set C is transformed to a description in terms of the causal pasts of the events in C.
Markopoulou, Fotini
core +2 more sources
The Compared Costs of Domination Location-Domination and Identification
Discussiones Mathematicae Graph Theory, 2020 Let G = (V, E) be a finite graph and r ≥ 1 be an integer. For v ∈ V, let Br(v) = {x ∈ V : d(v, x) ≤ r} be the ball of radius r centered at v. A set C ⊆ V is an r-dominating code if for all v ∈ V, we have Br(v) ∩ C ≠ ∅; it is an r-locating-dominating code
Hudry Olivier, Lobstein Antoine
doaj +1 more source
Note on decipherability of three-word codes
International Journal of Mathematics and Mathematical Sciences, 2002 The theory of uniquely decipherable (UD) codes has been widely developed in connection with automata theory, combinatorics on words, formal languages, and monoid theory.
F. Blanchet-Sadri, T. Howell
doaj +1 more source
, 2014 We introduce {\bf complementary information set codes} of higher-order. A binary linear code of length $tk$ and dimension $k$ is called a complementary information set code of order $t$ ($t$-CIS code for short) if it has $t$ pairwise disjoint information
Carlet, Claude +5 more
core +2 more sources
On the Future of Information: Reunification, Computability, Adaptation, Cybersecurity, Semantics
IEEE Access, 2016 The vulnerability of software and the Internet and the accumulation of unprocessed information in big data are serious problems in informatics. Both are human-related. The former was traced to flaws caused by human interventions in development.
Sergio Pissanetzky
doaj +1 more source
Statistical mechanics of typical set decoding [PDF]
, 2001 The performance of ``typical set (pairs) decoding'' for ensembles of Gallager's linear code is investigated using statistical physics. In this decoding, error happens when the information transmission is corrupted by an untypical noise or two or more ...
C.E. Shannon +24 more
core +2 more sources
F1000ResearchBackground Several scholars defined the concepts of fuzzy soft set theory and their application on decision-making problem. Based on this concept, researchers defined the generalised fuzzy soft set and its applications. However, to the best of the author’
Mihret Alamneh Taye +2 more
doaj +1 more source
Visualizing Items and Measures: An Overview and Demonstration of the Kernel Smoothing Item Response Theory Technique [PDF]
Tutorials in Quantitative Methods for Psychology, 2020 The current demonstration was conducted to familiarize a broader audience of applied researchers in psychology and social sciences with the benefits of an exploratory psychometric technique -- kernel smoothing item response theory (KSIRT). A data-driven,
Rajlic, Gordana
doaj +1 more source
On the Separation of Lossy Source-Network Coding and Channel Coding in Wireline Networks [PDF]
, 2010 This paper proves the separation between source-network coding and channel coding in networks of noisy, discrete, memoryless channels. We show that the set of achievable distortion matrices in delivering a family of dependent sources across such a ...
Effros, Michelle, Jalali, Shirin
core +3 more sources
A new class of codes for Boolean masking of cryptographic computations
, 2012 We introduce a new class of rate one-half binary codes: {\bf complementary information set codes.} A binary linear code of length $2n$ and dimension $n$ is called a complementary information set code (CIS code for short) if it has two disjoint ...
Carlet, Claude +3 more
core +3 more sources