Related papers: A full-fledged micromagnetic code in less than 70 …
We demonstrate that a small transformer can learn to execute programs in MicroPy, a simplified yet computationally universal programming language. Given procedure definitions together with an expression to evaluate, the transformer predicts…
The finite-element analysis of three-dimensional magnetostatic problems in terms of magnetic vector potential has proven to be one of the most efficient tools capable of providing the excellent quality results but becoming computationally…
The widely used Double-Exchange model for manganites is shown to support various "striped" phases at filling fractions 1/n (n=3, 4, 5...), in the previously unexplored regime of narrow bandwidth and small Jahn-Teller coupling. Working in…
We propose a binary message passing decoding algorithm for product codes based on generalized minimum distance decoding (GMDD) of the component codes, where the last stage of the GMDD makes a decision based on the Hamming distance metric.…
Magnetic encoders currently provide accurate positioning information by reading periodic patterns with equally spaced structures or bits. As this technology evolves to fulfill industrial demands for cheaper and more accurate systems,…
Maximum distance separable (MDS) are constructed to required specifications. The codes are explicitly given over finite fields with efficient encoding and decoding algorithms. Series of such codes over finite fields with ratio of distance…
It is reasonable to expect the theory of quantum codes to be simplified in the case of codes of minimum distance 2; thus, it makes sense to examine such codes in the hopes that techniques that prove effective there will generalize. With…
We derive a closed-form expression of the magnetic field of a finite-size current sheet and use it to calculate the field of permanent magnets, which are modeled through their surface current densities. We illustrate the method by…
In this paper we introduce a novel MDS array code with lowest density. In contrast to existing codes, this one has no restrictions on the size or the number of erasures it can correct. It is based on a simple matrix construction involving…
Error correction code is a major part of the communication physical layer, ensuring the reliable transfer of data over noisy channels. Recently, neural decoders were shown to outperform classical decoding techniques. However, the existing…
In this paper, we establish a lemma in algebraic coding theory that frequently appears in the encoding and decoding of, e.g., Reed-Solomon codes, algebraic geometry codes, and affine variety codes. Our lemma corresponds to the…
In this paper we study the decoding capabilities of convolutional codes over the erasure channel. Of special interest will be maximum distance profile (MDP) convolutional codes. These are codes which have a maximum possible column distance…
Different numerical approaches for the stray-field calculation in the context of micromagnetic simulations are investigated. We compare finite difference based fast Fourier transform methods, tensor grid methods and the finite-element…
Manapy is a parallel, unstructured, finite-volume based solver for the solution of partial differential equations (PDE). The framework is written using Python, it is object-oriented, and is organized in such a way that it is easy to…
Effective demagnetizing factors that connect the sample magnetic moment with the applied magnetic field are calculated numerically for perfectly diamagnetic samples of various non-ellipsoidal shapes. The procedure is based on calculating…
We introduce a general method for designing tailored lattices of magnetic microtraps for ultracold atoms, on the basis of patterned permanently magnetized films. A fast numerical algorithm is used to automatically generate patterns which…
We developed a micromagnetic method for modeling magnetic systems with periodic boundary conditions along an arbitrary number of dimensions. The main feature is an adaptation of the Ewald summation technique for evaluation of long-range…
The minimum distance of a code is an important concept in information theory. Hence, computing the minimum distance of a code with a minimum computational cost is a crucial process to many problems in this area. In this paper, we present…
The minimum distance graph of a code has the codewords as vertices and edges exactly when the Hamming distance between two codewords equals the minimum distance of the code. A constructive proof for reconstructibility of an extended perfect…
A quantitative understanding of the processes that trigger light-induced demagnetization on ultrashort timescales is crucial for achieving an ultrafast, radiation-controlled magnetic response in materials. This milestone is essential for…