Results 21 to 30 of about 5,176 (95)
Isometry and Automorphisms of Constant Dimension Codes [PDF]
, 2012 We define linear and semilinear isometry for general subspace codes, used for random network coding. Furthermore, some results on isometry classes and automorphism groups of known constant dimension code constructions are ...
Trautmann, Anna-Lena
core
The DNA of Calabi–Yau Hypersurfaces
Fortschritte der Physik, Volume 74, Issue 2, February 2026.Abstract Genetic Algorithms are implemented for triangulations of four‐dimensional reflexive polytopes, which induce Calabi–Yau threefold hypersurfaces via Batyrev's construction. These algorithms are shown to efficiently optimize physical observables such as axion decay constants or axion–photon couplings in string theory compactifications.
Nate MacFadden +2 more
wiley +1 more source
Some designs and codes from L_2(q) [PDF]
Transactions on Combinatorics, 2014 For $q \in \{7,8,9,11,13,16\}$, we consider the primitive actions of $L_2(q)$ and use Key-Moori Method 1 as described in [Codes, designs and graphs from the Janko groups {$J_1$} and {$J_2$}, {\em J. Combin. Math. Combin.
Jamshid Moori +1 more
doaj
The order of the automorphism group of a binary $q$-analog of the Fano plane is at most two [PDF]
, 2016 It is shown that the automorphism group of a binary $q$-analog of the Fano plane is either trivial or of order $2$.Comment: 10 ...
Kiermaier, Michael +2 more
core +2 more sources
A general approach to the linear stability of viscoelastic shear‐flows
ZAMM - Journal of Applied Mathematics and Mechanics / Zeitschrift für Angewandte Mathematik und Mechanik, Volume 106, Issue 2, February 2026.Abstract The present work provides an in‐depth analysis of the linear stability theory of viscoelastic shear‐flows, based upon a constitutive equation of the fading memory type. The particular model considered herein was introduced by Kenneth Walters through the integration of classical rate‐type fluids in a convected frame (Walters 1962).
Johannes Conrad, Martin Oberlack
wiley +1 more source
Neighbour transitivity on codes in Hamming graphs
, 2011 We consider a \emph{code} to be a subset of the vertex set of a \emph{Hamming graph}. In this setting a \emph{neighbour} of the code is a vertex which differs in exactly one entry from some codeword.
Cheryl E. Praeger +8 more
core +1 more source
The cosymplectic Chern–Hamilton conjecture
Journal of the London Mathematical Society, Volume 113, Issue 2, February 2026.Abstract In this paper, we study the Chern–Hamilton energy functional on compact cosymplectic manifolds, fully classifying in dimension 3 those manifolds admitting a critical compatible metric for this functional. This is the case if and only if either the manifold is co‐Kähler or if it is a mapping torus of the 2‐torus by a hyperbolic toral ...
Søren Dyhr +3 more
wiley +1 more source
Fault-Tolerant Logical Clifford Gates from Code Automorphisms
PRX QuantumWe study the implementation of fault-tolerant logical Clifford gates on stabilizer quantum error-correcting codes based on their symmetries. Our approach is to map the stabilizer code to a binary linear code, compute its automorphism group, and impose ...
Hasan Sayginel +4 more
doaj +1 more source
Quantum codes from algebraic curves with automorphisms
Condensed Matter Physics, 2008 Let Χ be an algebraic curve of genus g ≥ 2 defined over a field Fq of characteristic p > 0. From Χ, under certain conditions, we can construct an algebraic geometry code C.
T.Shaska
doaj +1 more source
Permutation Decoding and the Stopping Redundancy Hierarchy of Cyclic and Extended Cyclic Codes
, 2008 We introduce the notion of the stopping redundancy hierarchy of a linear block code as a measure of the trade-off between performance and complexity of iterative decoding for the binary erasure channel.
Hehn, Thorsten +3 more
core +1 more source