Results 41 to 50 of about 2,875,199 (333)
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
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
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
Code subspaces for LLM geometries [PDF]
, 2017 We consider effective field theory around classical background geometries with a gauge theory dual, specifically those in the class of LLM geometries. These are dual to half-BPS states of N=4 SYM.
D. Berenstein, Alexandra Miller
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
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
Asymptotic bounds for spherical codes [PDF]
, 2018 The set of all error-correcting codes C over a fixed finite alphabet F of cardinality q determines the set of code points in the unit square with coordinates (R(C), delta (C)):= (relative transmission rate, relative minimal distance). The central problem
Manin, Yuri I., Marcolli, Matilde
core +3 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
The ONETEP linear-scaling density functional theory program.
Journal of Chemical Physics, 2020 We present an overview of the onetep program for linear-scaling density functional theory (DFT) calculations with large basis set (plane-wave) accuracy on parallel computers.
Joseph C. A. Prentice +35 more
semanticscholar +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