相关论文: A full-fledged micromagnetic code in less than 70 …
The finite element method is a well-established method for the numerical solution of partial differential equations (PDEs), both linear and nonlinear. However, the repeated reassemblage of finite element matrices for nonlinear PDEs is…
In this work we describe an efficient implementation of a hierarchy of algorithms for the decomposition of dense matrices over the field with two elements (GF(2)). Matrix decomposition is an essential building block for solving dense…
A frequency permutation array (FPA) of length $n=m\lambda$ and distance $d$ is a set of permutations on a multiset over $m$ symbols, where each symbol appears exactly $\lambda$ times and the distance between any two elements in the array is…
We construct two-dimensional codes for correcting burst errors using the finite field Fourier transform. The encoding procedure is performed in the transformed domain using the conjugacy property of the finite field Fourier transform. The…
A well-known connection between the magnetic susceptibility and the effective exchange parameter is analyzed. It is shown that all current computational schemes use a long-wave approximation which is suitable only for localized moments…
In this study we consider rateless coding over discrete memoryless channels (DMC) with feedback. Unlike traditional fixed-rate codes, in rateless codes each codeword is infinitely long, and the decoding time depends on the confidence level…
A new code for astrophysical magnetohydrodynamics (MHD) is described. The code has been designed to be easily extensible for use with static and adaptive mesh refinement. It combines higher-order Godunov methods with the constrained…
We calculate the magnetization hysteresis for an ordered array of composite magnetic nanoparticles with a ferromagnetic (FM) core and an antiferromagnetic (AFM) shell, located on a triangular lattice and coupled via magnetostatic forces.…
In this paper, we introduce a new way of constructing and decoding multipermutation codes. Multipermutations are permutations of a multiset that may consist of duplicate entries. We first introduce a new class of matrices called…
One of the most popular methods employed in computational electromagnetics is the Finite Difference Time Domain (FDTD) method. We generalise it to a meshless setting using the Radial Basis Function generated Finite Difference (RBF-FD)…
Motivated by applications to DNA-storage, flash memory, and magnetic recording, we study perfect burst-correcting codes for the limited-magnitude error channel. These codes are lattices that tile the integer grid with the appropriate error…
Short-length Reed--Muller codes under majority-logic decoding are of particular importance for efficient hardware implementations in real-time and embedded systems. This paper significantly improves Chen's two-step majority-logic decoding…
The design of block codes for short information blocks (e.g., a thousand or less information bits) is an open research problem which is gaining relevance thanks to emerging applications in wireless communication networks. In this work, we…
Effective range is a quantity to characterize the energy dependence in two-body scattering strength, and is widely used in cold atomic systems especially across narrow resonances. Here we show that the effective range can significantly…
Structured light fields, featuring unique topological properties and high tunability, have opened new frontiers in light-matter interactions with magnetic systems. However, the ultrafast and reconfigurable optical encoding of various types…
The Landau-Lifshitz equation governing magnetization dynamics is written in terms of the amplitudes of normal modes associated with the micromagnetic system's appropriate ground state. This results in a system of nonlinear ordinary…
Deep polar codes are pre-transformed polar codes that employ a multi-layered polar kernel transformation strategy to enhance code performance in short blocklength regimes. However, like conventional polar codes, their block length is…
In order to understand the performance of a code under maximum-likelihood (ML) decoding, it is crucial to know the minimal codewords. In the context of linear programming (LP) decoding, it turns out to be necessary to know the minimal…
Low decoding latency and complexity are two important requirements of channel codes used in many applications, like machine-to-machine communications. In this paper, we show how these requirements can be fulfilled by using some special…
A lower bound on minimum distance of convolutional polar codes is provided. The bound is obtained from the minimum weight of generalized cosets of the codes generated by bottom rows of the polarizing matrix. Moreover, a construction of…