Results 31 to 40 of about 3,049,343 (222)
Use of Set Shaping Theory in the Development of Locally Testable Codes
SSRN Electronic Journal, 2022 Abstract: in developing locally testable codes, information is added to the coded message by creating redundancy in the codewords. In this article, we propose an alternative method in which redundancy is introduced on the message that must be transmitted before its encoding and not in the codewords.
openaire +2 more sources
Quantum error correction and holographic information from bilocal holography
Journal of High Energy Physics, 2021 Bilocal holography is a constructive approach to the higher spin theory holographically dual to O(N ) vector models. In contrast to other approaches to bulk reconstruction, bilocal holography does not take input from the dual gravitational theory.
Robert de Mello Koch +3 more
doaj +1 more source
From signals to music: a bottom-up approach to the structure of neuronal activity
Frontiers in Systems Neuroscience, 2023 IntroductionThe search for the “neural code” has been a fundamental quest in neuroscience, concerned with the way neurons and neuronal systems process and transmit information.
Gabriel D. Noel +4 more
doaj +1 more source
Kohn-Sham Decomposition in Real-Time Time-Dependent Density-Functional Theory: An Efficient Tool for Analyzing Plasmonic Excitations. [PDF]
Journal of Chemical Theory and Computation, 2017 Electronic excitations can be efficiently analyzed in terms of the underlying Kohn-Sham (KS) electron-hole transitions. While such a decomposition is readily available in the linear-response time-dependent density-functional theory (TDDFT) approaches ...
Tuomas P. Rossi +4 more
semanticscholar +1 more source
A Construction of Quantum LDPC Codes from Cayley Graphs [PDF]
, 2013 We study a construction of Quantum LDPC codes proposed by MacKay, Mitchison and Shokrollahi. It is based on the Cayley graph of Fn together with a set of generators regarded as the columns of the parity-check matrix of a classical code. We give a general
Couvreur, Alain +2 more
core +4 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
Journal of Chemical Theory and Computation, 2019 A priori rate predictions for gas phase reactions have undergone a gradual but dramatic transformation, with current predictions often rivaling the accuracy of the best available experimental data. The utility of such kinetic predictions would be greatly
C. Cavallotti +3 more
semanticscholar +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
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 +3 more sources