Related papers: Multilevel lattice codes from Hurwitz quaternion i…
Part B (of a project involving four Parts) is about "bases of lines", a concept introduced by C. Herrmann and the author in the late 80's. Bases of lines attempt to describe a given modular lattice in a geometric way akin to how projective…
A expansion to fourth-order for lattice Boltzmann methods is presented. This expansion provides an easy model for finding fourth-order corrections to lattice Boltzmann methods for various physical systems. The fourth-order terms can give…
Constant dimension codes (CDCs) have become an important object in coding theory due to their application in random network coding. The multilevel construction is one of the most effective ways to construct constant dimension codes. The…
A central and longstanding open problem in coding theory is the rate-versus-distance trade-off for binary error-correcting codes. In a seminal work, Delsarte introduced a family of linear programs establishing relaxations on the size of…
This work aims at providing new bounds for the diversity multiplexing gain trade-off of a general class of division algebra based lattice codes. In the low multiplexing gain regime, some bounds were previously obtained from the high…
In this paper, fast-decodable lattice code constructions are designed for the nonorthogonal amplify-and-forward (NAF) multiple-input multiple-output (MIMO) channel. The constructions are based on different types of algebraic structures,…
By fully describing the lattice of subfields of some towers of number fields built by iterating square roots, we obtain infinitely many fields, each of them either contradicts Julia Robinson's problem (obtaining a JR-number $4$ which is not…
The geometrical structure known as Tulczyjew triple has been used with success in analytical mechanics and first order field theory to describe a wide range of physical systems including Lagrangian/Hamiltonian systems with constraints…
We introduce a unified generalization of several well-established high-throughput coding techniques including staircase codes, tiled diagonal zipper codes, continuously interleaved codes, open forward error correction (OFEC) codes, and…
We classify mobile Pauli stabilizer codes up to gapped interfaces and coarse-graining using the framework of algebraic $\mathrm{L}$-theory. We compare this classification with that of framed TQFTs, theories that arise naturally in the…
Toward the derivation of an effective theory for Polyakov loops in lattice QCD, we examine Polyakov loop correlation functions using the multi-level algorithm which was recently developed by Luscher and Weisz.
Several problems in computer algebra can be efficiently solved by reducing them to calculations over finite fields. In this paper, we describe an algorithm for the reconstruction of multivariate polynomials and rational functions from their…
The simple cubic lattice defines a set of points at regular distances. The volume of the Voronoi cells around each point may serve as a weight for integration over the entire space. We add interstitial points to this grid according to the…
Most practical constructions of lattice codes with high coding gains are multilevel constructions where each level corresponds to an underlying code component. Construction D, Construction D$'$, and Forney's code formula are classical…
Quadratic form reduction and lattice reduction are fundamental tools in computational number theory and in computer science, especially in cryptography. The celebrated Lenstra-Lenstra-Lov\'asz reduction algorithm (so-called LLL) has been…
The purpose of this paper is to give presentations for projective $S$-unit groups of the Hurwitz order in Hamilton's quaternions over the rational field $\mathbb{Q}$. To our knowledge, this provides the first explicit presentations of an…
We introduce the general polynomial algebras characterizing a class of higher order superintegrable systems that separate in Cartesian coordinates. The construction relies on underlying polynomial Heisenberg algebras and their defining…
We relate proper isometry classes of maximal lattices in a totally definite quaternary quadratic space (V,q) with trivial discriminant to certain equivalence classes of ideals in the quaternion algebra representing the Clifford invariant of…
We derive an algorithm to produce explicit formulas for certain generating functions of double Hurwitz numbers. These formulas generalize a formula of Goulden, Jackson and Vakil for one part double Hurwitz numbers. Immediate consequences…
It is shown why the discriminant of a maximal order within a cyclic division algebra must be minimized in order to get the densest possible matrix lattices with a prescribed nonvanishing minimum determinant. Using results from class field…