Results 71 to 80 of about 173,309,485 (168)
Electric‐Current‐Assisted Nucleation of Zero‐Field Hopfion Rings
Advanced Materials, Volume 38, Issue 21, 13 April 2026.This work reports a novel and efficient nucleation protocol for 3D localized topological magnetic solitons‐hopfion rings in chiral magnets using pulsed electric currents. By using Lorentz transmission electron microscopy and topological analysis, we report characteristic features and extraordinary stability of hopfion rings in zero or inverted external
Xiaowen Chen +12 more
wiley +1 more source
On the structure of the linear codes with a given automorphism
Advances in Mathematics of CommunicationsThe purpose of this paper is to present the structure of the linear codes over a finite field with q elements that have a permutation automorphism of order m. These codes can be considered as generalized quasi-cyclic codes. Quasi-cyclic codes and almost quasi-cyclic codes are discussed in detail, presenting necessary and sufficient conditions for which
openaire +3 more sources
Self-Dual Codes With an Automorphism of Order 11
IEEE Transactions on Information Theory, 2015 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Nikolay I. Yankov +3 more
openaire +4 more sources
On automorphisms of generalized algebraic-geometry codes
Journal of Pure and Applied Algebra, 2007 In coding theory, one often is interested in codes admitting large automorphism group. Certainly, the knowledge of the automorphism group of a code or even of part of this group gives information about the structure of the code and can allow to developing a decoding algorithm. In [IEEE Trans. Inform. Theory 45, No. 7, 2498--2501 (1999; Zbl 0956.94023)]
openaire +2 more sources
Code Equivalence and Automorphism Problems for Codes
We study the complexity of the Code Equivalence problem and show that it is polynomially equivalent to several computational automorphism problems for codes. These problems ask for the cardinality (ACOUNT), an orbit partition (APART), and a generating set (AGEN) for the permutation automorphism group of a code. We present deterministic, polynomial-time
Biasse, Jean-Francois +2 more
openaire +2 more sources
On the automorphism group of various Goppa codes
IEEE Transactions on Information Theory, 1998 This is a very nice paper where the automorphism group of several Goppa codes has been computed as being the automorphism group of the corresponding underlying function field. By an automorphism of a code \(C\subseteq {\mathbb F_q}^n \) here one means \textit{V. D. Goppa}'s definition [Math. USSR., Izv.
openaire +4 more sources
Groups of Symmetries of the Two Classes of Synthetases in the Four-Dimensional Hypercubes of the Extended Code Type II. [PDF]
Life (Basel), 2023 José MV, Morgado ER, Bobadilla JR.
europepmc +1 more source
Automorphisms of kaleidoscopical graphs
, 2007 A regular connected graph Γ of degree s is called kaleidoscopical if there is a (s + 1)-coloring of the set of its vertices such that every unit ball in Γ has no distinct monochrome points.
Protasova, K.D., Protasov, I.V.
core +1 more source
The automorphism groups of Reed-Solomon codes
Journal of Combinatorial Theory, Series A, 1987 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources