Related papers: Construction C*: an inter-level coded version of C…
A classification is given of certain separable nuclear C*-algebras not necessarily of real rank zero, namely the class of simple C*-algebras which are inductive limits of continuous-trace C*-algebras whose building blocks have their…
The component-by-component construction is the standard method of finding good lattice rules or polynomial lattice rules for numerical integration. Several authors have reported that in numerical experiments the generating vector sometimes…
Concurrent coding is an unconventional encoding technique that simultaneously provides protection against noise, burst errors and interference. This simple-to-understand concept is investigated by distinguishing 2 types of code, open and…
LDPC lattices were the first family of lattices which have an efficient decoding algorithm in high dimensions over an AWGN channel. Considering Construction D' of lattices with one binary LDPC code as underlying code gives the well known…
Low density parity check (LDPC) lattices are obtained from Construction D' and a family of nested binary LDPC codes. We consider an special case of these lattices with one binary LDPC code as underlying code. This special case of LDPC…
In this paper, we propose new coupled codes constructed by overlapping circular spatially-coupled low-density parity-check (SC-LDPC) codes, which show better asymptotic and finite-length decoding performance compared to the conventional…
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…
We construct the first example of a lattice on an irreducible Euclidean building that is not residually finite. Conjecturally, the normal subgroup theorem extends to this lattice making it virtually simple.
In this work, we address the low-complexity construction of shortened and punctured polar codes from a unified view. While several independent puncturing and shortening designs were attempted in the literature, our goal is a unique,…
We analyze the properties of a class of improved lattice topological charge density operators, constructed by a smearing-like procedure. By optimizing the choice of the parameters introduced in their definition, we find operators having (i)…
This is an unpublished manuscript written in 1983-4. It contains several results about lattices (=integral quadratic forms) including the classification of the unimodular lattices in dimensions up to 25 and the construction of unimodular…
Several types of AL-FEC (Application-Level FEC) codes for the Packet Erasure Channel exist. Random Linear Codes (RLC), where redundancy packets consist of random linear combinations of source packets over a certain finite field, are a…
In this work, we propose a decoding method of Golay codes from the perspective of Polarization Adjusted Convolutional (PAC) codes. By invoking Forney's cubing construction of Golay codes and their generators $G^*(8,7)/(8,4)$, we found…
This is the Lattice '95 review of recent progress towards accurate QCD simulations using very coarse lattices. This development could have revolutionary implications for low energy (nonperturbative) QCD.
The structure of component and connector (C&C) models, which are used in many application domains of software engineering, consists of components at different containment levels, their typed input and output ports, and the connectors…
This paper characterizes which subsets of C^n can be the set of positions of n points on a linkage in the complex plane C. For example, assuming compactness they are just compact semialgebraic sets. Noncompact configuration spaces are…
We propose two low-complexity lattice code constructions that have competitive coding and shaping gains. The first construction, named systematic Voronoi shaping, maps short blocks of integers to the dithered Voronoi integers, which are…
Lattice coding over a Gaussian wiretap channel, where an eavesdropper listens to transmissions between a transmitter and a legitimate receiver, is considered. A new lattice invariant called the secrecy gain is used as a code design…
Skew lattices are non-commutative generalizations of lattices. The coset structure decomposition is an original approach to the study of these algebras describing the relation between its rectangular classes. In this paper we will look at…
The purpose of this article is to propose and investigate a partial order structure weaker than the lattice structure and which have nice properties regarding closure operators. We extend accordingly closed pattern mining and formal concept…