Related papers: On Lattice Constructions D and D' from q-ary Linea…
This chapter investigates the properties of (linear) codes in $ A_n $ lattices, the practical motivation for which is found in several communication scenarios, such as asymmetric channels, sticky-insertion channels, bit-shift channels, and…
In this paper we construct new optimal hierarchical locally recoverable codes. Our construction is based on a combination of the ideas of \cite{ballentine2019codes,sasidharan2015codes} with an algebraic number theoretical approach that…
A review of investigations of running couplings using lattice techniques is given. This includes i) studies of the running of particular non-perturbatively defined renormalized couplings in pure gauge theories over a range of energies, and…
We consider linear cyclic codes with the locality property, or locally recoverable codes (LRC codes). A family of LRC codes that generalize the classical construction of Reed-Solomon codes was constructed in a recent paper by I. Tamo and A.…
We consider linear codes over a finite field of odd characteristic, derived from determinantal varieties, obtained from symmetric matrices of bounded ranks. A formula for the weight of a code word is derived. Using this formula, we have…
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…
Surface bound states in a discrete-lattice model of a $d_{x^2 - y^2}$ cuprate superconductor are shown to be, in general, coherent superpositions of an incoming excitation and more than one outgoing excitation, and a simple graphical…
Recent results studying the masses and widths of low-lying baryon resonances in lattice QCD are presented. The $S$-wave $N\pi$ scattering lengths for both total isospins $I = 1/2$ and $I = 3/2$ are inferred from the finite-volume spectrum…
As a generalization of cyclic codes, quasi-cyclic (QC) codes contain many good linear codes. But quasi-cyclic codes studied so far are mainly limited to one generator (1-generator) QC codes. In this correspondence, 2-generator and…
In recent years the investigation of hadron structure using lattice techniques has attracted growing attention. In this talk we give an overview on recent work with a focus on results for nucleon spectrum and structure from the QCDSF…
Universally decodable matrices can be used for coding purposes when transmitting over slow fading channels. These matrices are parameterized by positive integers $L$ and $n$ and a prime power $q$. Based on Pascal's triangle we give an…
We present a generic and systematic approach for constructing D-dimensional lattice models with exactly solvable d-dimensional boundary states localized to corners, edges, hinges and surfaces. These solvable models represent a class of…
We review results on hadron structure using lattice QCD simulations with pion masses close or at to the physical value. We pay particular attention to recent successes on the computation of the mass of the low-lying baryons and on the…
Supersymmetric gauge theories in four dimensions have taught us many important physics lessons. These can both inform and be informed by future work on the lattice. I focus on three issues: the properties of supersymmetric Yang-Mills theory…
The low-density parity-check (LDPC) lattices perform very well in high dimensions under generalized min-sum iterative decoding algorithm. In this work we focus on 1-level LDPC lattices. We show that these lattices are the same as lattices…
A distributive lattice $L$ with minimum element $0$ is called decomposable if $a$ and $b$ are not comparable elements in $L$ then there exist $\overline{a},\overline{b}\in L$ such that $a=\overline{a}\vee(a\wedge b),…
Two new constructions of linear code pairs $C_2 \subset C_1$ are given for which the codimension and the relative minimum distances $M_1(C_1,C_2)$, $M_1(C_2^\perp,C_1^\perp)$ are good. By this we mean that for any two out of the three…
We consider the lattice of coarse structures on a set $X$ and study metrizable, locally finite and cellular coarse structures on $X$ from the lattice point of view.
Minimal linear codes are in one-to-one correspondence with special types of blocking sets of projective spaces over a finite field, which are called strong or cutting blocking sets. In this paper we prove an upper bound on the minimal…
Due to their efficient encoding and decoding algorithms cyclic codes, a subclass of linear codes, have applications in consumer electronics, data storage systems, and communication systems. In this paper, Dickson polynomials of the first…