Results 11 to 20 of about 2,108,997 (280)
Universal Gr\"obner Bases for Binary Linear Codes [PDF]
, 2013 Each linear code can be described by a code ideal given as the sum of a toric ideal and a non-prime ideal. In this way, several concepts from the theory of toric ideals can be translated into the setting of code ideals.
Dück, Natalia, Zimmermann, Karl-Heinz
core +2 more sources
Numerical simulation of complicated grains with 3D burnback and Quasi-One-Dimensional flow field of solid rocket motors [PDF]
فصلنامه علوم و فناوری فضایی, 2019 In this research, the 3D grain burnback with quasi-one-dimensional internal ballistic in a solid rocket motor is simulated using the Level set theory and the utilization of Sections method, while achieving high accuracy in the simulation of green's post ...
mohammad shahbazi +2 more
doaj +1 more source
Toward the Unification of Physics and Number Theory [PDF]
Reports in Advances of Physical Sciences, 2019 This paper introduces the notion of simplex-integers and shows how, in contrast to digital numbers, they are the most powerful numerical symbols that implicitly express the information of an integer and its set theoretic substructure.
Klee Irwin
doaj +1 more source
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
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 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
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
Use of Set Shaping theory in the development of locally testable codes [PDF]
, 2022 Solomon Kozlov
+5 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