Related papers: Linear tail-biting trellises: Characteristic gener…
The web of dual gauge theories engineered from a class of toric Calabi-Yau threefolds is explored. In previous work, we have argued for a triality structure by compiling evidence for the fact that every such manifold $X_{N,M}$ (for given…
Balanced incomplete block designs (BIBDs) have wide applications in engineering, business and sciences. In this paper, for each (v, k, \lambda)-BIBD, we construct a strongly symmetric k-th order v-dimensional tensor. We call such a strongly…
We study the Coulomb branches of $3d$ $\mathcal{N}=4$ quiver gauge theories, focusing on the generators for their quantized coordinate rings. We show that there is a surjective map from a shifted Yangian onto the quantized Coulomb branch,…
Kliuchnikov, Maslov, and Mosca proved in 2012 that a $2\times 2$ unitary matrix $V$ can be exactly represented by a single-qubit Clifford+$T$ circuit if and only if the entries of $V$ belong to the ring $\mathbb{Z}[1/\sqrt{2},i]$. Later…
Rate-(n-2)/n unrestricted and CSS-type quantum convolutional codes with up to 4096 states and minimum distances up to 10 are constructed as stabilizer codes from classical self-orthogonal rate-1/n F_4-linear and binary linear convolutional…
The problem of computing the permanent of a matrix has attracted interest since the work of Ryser(1963) and Valiant(1979). On the other hand, trellises were extensively studied in coding theory since the 1960s. In this work, we establish a…
One of the main goals of coding theory is to construct codes with best possible parameters and properties. A special class of codes called quasi-twisted (QT) codes is well-known to produce codes with good parameters. Most of the work on QT…
An $SL_k$-tiling is a bi-infinite array of integers having all adjacent $k\times k$ minors equal to one and all adjacent $(k+1)\times (k+1)$ minors equal to zero. Introduced and studied by Bergeron and Reutenauer, $SL_k$-tilings generalize…
This work classifies stabilizer codes by the set of diagonal Clifford gates that can be implemented transversally on them. We show that, for any stabilizer code, its group of diagonal transversal Clifford gates on $\ell$ code blocks must be…
Directional codes, recently introduced by Geh\'er--Byfield--Ruban \cite{Geher2025Directional}, constitute a hardware-motivated family of quantum low-density parity-check (qLDPC) codes. These codes are defined by stabilizers measured by…
We propose two approximate algorithms for MAP decoding on tail-biting trellises. The algorithms work on a subset of nodes of the tail-biting trellis, judiciously selected. We report the results of simulations on an AWGN channel using the…
Most design approaches for trellis-coded quantization take advantage of the duality of trellis-coded quantization with trellis-coded modulation, and use the same empirically-found convolutional codes to label the trellis branches. This…
Cyclic redundancy check (CRC) codes combined with convolutional codes yield a powerful concatenated code that can be efficiently decoded using list decoding. To help design such systems, this paper presents an efficient algorithm for…
Trellises play an important theoretical and practical role for classical codes. Their main utility is to devise complexity-efficient error estimation algorithms. Here, we describe trellis representations for quantum stabilizer codes. We…
In a group trellis, the sequence of branches that split from the identity path and merge to the identity path form two normal chains. The Schreier refinement theorem can be applied to these two normal chains. The refinement of the two…
Stabilizer codes are a simple and successful class of quantum error-correcting codes. Yet this success comes in spite of some harsh limitations on the ability of these codes to fault-tolerantly compute. Here we introduce a new metric for…
For a finite dimensional vector space V of dimension n, we consider the incidence correspondence (or partial flag variety) X in P(V) x P(V*), parametrizing pairs consisting of a point and a hyperplane containing it. We completely…
Using an algebraic approach based on the theory of Coxeter groups, we design, and describe the performance of, a class of line codes for parallel transmission of $b$ bits over $b+1$ wires that admit especially simple encoding and decoding…
This paper is concerned with the local reducibility properties of linear realizations of codes on finite graphs. Trimness and properness are dual properties of constraint codes. A linear realization is locally reducible if any constraint…
Coding theory and $t$-designs have close connections and interesting interplay. In this paper, we first introduce a class of ternary linear codes and study their parameters. We then focus on their three-weight subcodes with a special weight…