Related papers: Fast component-by-component construction of lattic…
Higher order scrambled digital nets are randomized quasi-Monte Carlo rules which have recently been introduced in [J. Dick, Ann. Statist., 39 (2011), 1372--1398] and shown to achieve the optimal rate of convergence of the root mean square…
The so-called min-sum algorithm has been applied for decoding lattices constructed by Construction D'. We generalize this iterative decoding algorithm to decode lattices constructed by Construction D. An upper bound on the decoding…
Higher order digital nets are special classes of point sets for quasi-Monte Carlo rules which achieve the optimal convergence rate for numerical integration of smooth functions. An explicit construction of higher order digital nets was…
In this paper we investigate multivariate integration in weighted unanchored Sobolev spaces of smoothness of arbitrarily high order. As quadrature points we employ higher order polynomial lattice point sets over $\mathbb{F}_{2}$ which are…
The present research is developed into the realm of industrial design engineering and additive manufacturing by introducing a parametric design model and adaptive mechanical analysis for a new lattice structure, with a focus on 3D additive…
While proper orthogonal decomposition (POD) is widely used for model reduction, its standard form does not take into account any parametric model structure. Extensions to POD have been proposed to address this, but these either require…
We present a lattice algorithm specifically designed for some classical applications of lattice reduction. The applications are for lattice bases with a generalized knapsack-type structure, where the target vectors are boundably short. For…
Lattice structures have great potential for several application fields ranging from medical and tissue engineering to aeronautical one. Their development is further speeded up by the continuing advances in additive manufacturing…
Neural network decoding algorithms are recently introduced by Nachmani et al. to decode high-density parity-check (HDPC) codes. In contrast with iterative decoding algorithms such as sum-product or min-sum algorithms in which the weight of…
LDPC lattices were the first family of lattices that equipped with iterative decoding algorithms under which they perform very well in high dimensions. In this paper, we introduce quasi cyclic low density parity check (QC-LDPC) lattices as…
This paper considers $n= 128$ dimensional construction A lattice design, using binary codes with known minimum Hamming distance and codeword multiplicity, the number of minimum weight codeword. A truncated theta series of the lattice is…
This paper addresses the overwhelming computational resources needed with standard numerical approaches to simulate architected materials. Those multiscale heterogeneous lattice structures gain intensive interest in conjunction with the…
Protein design is the inverse approach of the three-dimensional (3D) structure prediction for elucidating the relationship between the 3D structures and amino acid sequences. In general, the computation of the protein design involves a…
Construction $C^\star$ was recently introduced as a generalization of the multilevel Construction C (or Forney's code-formula), such that the coded levels may be dependent. Both constructions do not produce a lattice in general, hence the…
This paper introduces a multilevel kernel-based approximation method to estimate efficiently solutions to elliptic partial differential equations (PDEs) with periodic random coefficients. Building upon the work of Kaarnioja, Kazashi, Kuo,…
Recently, Branco da Silva and Silva described an efficient encoding and decoding algorithm for Construction D$^\prime$ lattices. Using their algorithm, we propose a Construction D$^\prime$ lattice based on binary quasi-cyclic low-density…
Lattice and special nonlattice multilevel constellations constructed from binary codes, such as Constructions A, C, and D, have relevant applications in Mathematics (sphere packing) and in Communication (multi-stage decoding and efficient…
We present a multi-scale lattice Boltzmann scheme, which adaptively refines particles' velocity space. Different velocity sets, i.e., higher- and lower-order lattices, are consistently and efficiently coupled, allowing us to use the…
Lattice-like structures can provide a combination of high stiffness with light weight that is useful in many applications, but a resolved finite element mesh of such structures results in a computationally expensive discretization. This…
In this work, we exhibit a hierarchy of polynomial time algorithms solving approximate variants of the Closest Vector Problem (CVP). Our first contribution is a heuristic algorithm achieving the same distance tradeoff as HSVP algorithms,…