Results 41 to 50 of about 3,822,513 (334)
IEEE Transactions on Information Theory, volume 59, number 11,
pages 7386-7404, 2013, 2011 In network coding a constant dimension code consists of a set of k-dimensional subspaces of F_q^n. Orbit codes are constant dimension codes which are defined as orbits of a subgroup of the general linear group, acting on the set of all subspaces of F_q^n. If the acting group is cyclic, the corresponding orbit codes are called cyclic orbit codes.
arxiv +1 more source
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
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
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
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
Universal codes of the natural numbers [PDF]
Logical Methods in Computer Science, Volume 9, Issue 3 (August 29,
2013) lmcs:975, 2013 A code of the natural numbers is a uniquely-decodable binary code of the natural numbers with non-decreasing codeword lengths, which satisfies Kraft's inequality tightly. We define a natural partial order on the set of codes, and show how to construct effectively a code better than a given sequence of codes, in a certain precise sense.
arxiv +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
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
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