相关论文: A full-fledged micromagnetic code in less than 70 …

The construction of Maximum Distance Profile (MDP) convolutional codes in general requires the use of very large finite fields. In contrast convolutional codes with optimal column distances maximize the column distances for a given…

Here, we report a numerical implementation of the nonlocal homogenization approach recently proposed in [M. Silveirinha, Phys. Rev. B 75, 115104 (2007)], using the finite difference frequency-domain method to discretize the…

We present a micromagnetic approach to exchange bias (EB) in ferromagnetic (FM)/antiferromagnetic (AFM) thin film systems with a small number of irreversible interfacial magnetic moments. We express the exchange bias field $H_{EB}$ in terms…

This paper presents a new decoding for polynomial residue codes, called the minimum degree-weighted distance decoding. The newly proposed decoding is based on the degree-weighted distance and different from the traditional minimum Hamming…

Multivariate multiplicity codes (Kopparty, Saraf, and Yekhanin, J. ACM 2014) are linear codes where the codewords are described by evaluations of multivariate polynomials (with a degree bound) and their derivatives up to a fixed order, on a…

magnum.np is a micromagnetic finite-difference library completely based on the tensor library PyTorch. The use of such a high level library leads to a highly maintainable and extensible code base which is the ideal candidate for the…

We implement an efficient energy-minimization algorithm for finite-difference micromagnetics that proofs especially useful for the computation of hysteresis loops. Compared to results obtained by time integration of the…

We describe a numerical code to solve the equations for ideal magnetohydrodynamics (MHD). It is based on an explicit finite difference scheme on an Eulerian grid, called the Total Variation Diminishing (TVD) scheme, which is a…

We design a heuristic method, a genetic algorithm, for the computation of an upper bound of the minimum distance of a linear code over a finite field. By the use of the row reduced echelon form, we obtain a permutation encoding of the…

In this paper, we introduce a new way of constructing and decoding multipermutation codes. Multipermutations are permutations of a multiset that generally consist of duplicate entries. We first introduce a class of binary matrices called…

An implementation of the fast multiple method (FMM) is performed for magnetic systems with long-ranged dipolar interactions. Expansion in spherical harmonics of the original FMM is replaced by expansion of polynomials in Cartesian…

We present for astrophysical use a multi-dimensional numerical code to solve the equations for ideal magnetohydrodynamics (MHD). It is based on an explicit finite difference method on an Eulerian grid, called the Total Variation Diminishing…

Modelling complex line emission in the interstellar medium (ISM) is a degenerate, high-dimensional problem. Here, we present McFine, a tool for automated multi-component fitting of emission lines with complex hyperfine structure, in a fully…

The Landau-Lifshitz equation describes the dynamics of the magnetization inside ferromagnetic materials. This equation is highly nonlinear and has a non-convex constraint (the magnitude of the magnetization is constant) which pose…

The bottleneck of micromagnetic simulations is the computation of the long-ranged magnetostatic fields. This can be tackled on regular N-node grids with Fast Fourier Transforms in time N logN, whereas the geometrically more versatile finite…

The open-source python package diffpy.mpdf, part of the DiffPy suite for diffraction and pair distribution function analysis, provides a user-friendly approach for performing magnetic pair distribution function (mPDF) analysis. The package…

We report a study of demagnetization protocols for frustrated arrays of interacting single domain permalloy nanomagnets by rotating the arrays in a changing magnetic field. The most effective demagnetization is achieved by not only stepping…

This paper proposes a highly efficient global coded-multiplexing scheme, conceptualized as Orthogonal Frequency Division Multiplexing over a finite field (FF-OFDM), for reliable multiuser communications. By utilizing a prime length cyclic…

Partial spread is important in finite geometry and can be used to construct linear codes. From the results in (Designs, Codes and Cryptography 90:1-15, 2022) by Xia Li, Qin Yue and Deng Tang, we know that if the number of the elements in a…

We describe here a library aimed at automating the solution of partial differential equations using the finite element method. By employing novel techniques for automated code generation, the library combines a high level of expressiveness…