相关论文: Linear tail-biting trellises: Characteristic gener…

We present the theory of rank-metric codes with respect to the 3-tensors that generate them. We define the generator tensor and the parity check tensor of a matrix code, and describe the properties of a code through these objects. We define…

This work classifies the set of diagonal gates that can implement a single or two-qubit transversal logical gate for qubit stabilizer codes. We show that individual physical gates on the underlying qubits that compose the code are…

As a generalization of acyclic 2-Calabi-Yau categories, we consider 2-Calabi-Yau categories with a directed cluster-tilting subcategory; we study their cluster-tilting subcategories and the cluster combinatorics that they encode. We show…

We give more precise statements of Fock-Goncharov duality conjecture for cluster varieties parametrizing ${\rm SL}_{2}/{\rm PGL}_{2}$-local systems on the once punctured torus. Then we prove these statements. Along the way, using distinct…

In this article, we study $G$-covers of klt varieties, where $G$ is a reductive group. First, we exhibit an example of a klt singularity admitting a $\mathbb{P}{\rm GL}_n(\mathbb{K})$-cover that is not of klt type. Then, we restrict…

We describe a conjectural stratification of the Brill-Noether variety for general curves of fixed genus and gonality. As evidence for this conjecture, we show that this Brill-Noether variety has at least as many irreducible components as…

In this paper, we first study in detail the relationship between minimal linear codes and cutting blocking sets, which were recently introduced by Bonini and Borello, and then completely characterize minimal linear codes as cutting blocking…

One of the most important and challenging problems in coding theory is to determine the optimal values of the parameters of a linear code and to explicitly construct codes with optimal parameters, or as close to the optimal values as…

Chirality transfer from the level of molecular structure up to mesoscopic lengthscales of supramolecular morphologies is a broad and persistent theme in self-assembled soft materials, from biological to synthetic matter. Here, we analyze…

A new type of quiver theories, denoted twin quivers, was recently introduced for studying $5d$ SCFTs engineered by webs of 5-branes ending on 7-branes. Twin quivers provide an alternative perspective on various aspects of such webs,…

Network coding theory studies the transmission of information in networks whose vertices may perform nontrivial encoding and decoding operations on data as it passes through the network. The main approach to deciding the feasibility of…

In this paper a new class of lattices called turbo lattices is introduced and established. We use the lattice Construction D to produce turbo lattices. This method needs a set of nested linear codes as its underlying structure. We benefit…

We develop an algorithm for computing the weight distribution of a linear $[n,k]$ code over a finite field $\mathbb{F}_q$. We represent the codes by their characteristic vector with respect to a given generator matrix and a special type of…

While quantum low-density parity check (qLDPC) codes are a low-overhead means of quantum information storage, it is valuable for quantum codes to possess fault-tolerant features beyond this resource efficiency. In this work, we introduce…

This is Part II of our work about random tensor inequalities and tail bounds for bivariate random tensor means. After reviewing basic facts about random tensors, we first consider tail bounds with more general connection functions. Then, a…

Fekete, Jord\'an and Kaszanitzky [4] characterised the graphs which can be realised as 2-dimensional, infinitesimally rigid, bar-joint frameworks in which two given vertices are coincident. We formulate a conjecture which would extend their…

A $(v,k,\lambda, \mu)$-partial difference set (PDS) is a subset $D$ of size $k$ of a group $G$ of order $v$ such that every nonidentity element $g$ of $G$ can be expressed in either $\lambda$ or $\mu$ different ways as a product $xy^{-1}$,…

Various specifiable combinatorial structures, with d extensive parameters, can be exactly sampled both by the recursive method, with linear arithmetic complexity if a heavy preprocessing is performed, or by the Boltzmann method, with…

A general local Fourier analysis for overlapping block smoothers on triangular grids is presented. This analysis is explained in a general form for its application to problems with different discretizations. This tool is demonstrated for…

A key agreement problem is considered that has a biometric or physical identifier, a terminal for key enrollment, and a terminal for reconstruction. A nested convolutional code design is proposed that performs vector quantization during…