相关论文: Decoding of scroll codes
We study perverse sheaves of categories their connections to classical algebraic geometry. We show how perverse sheaves of categories encode naturally derived categories of coherent sheaves on $\mathbb{P}^1$ bundles, semiorthogonal…
We refine the complexity landscape for enumeration problems by introducing very low classes defined by using Boolean circuits as enumerators. We locate well-known enumeration problems, e.g., from graph theory, Gray code enumeration, and…
The fractional and circular chromatic numbers are the two most studied non-integral refinements of the chromatic number of a graph. Starting from the definition of a coloring base of a graph, which originated in work related to ergodic…
Neural codes are collections of binary strings motivated by patterns of neural activity. In this paper, we study algorithmic and enumerative aspects of convex neural codes in dimension 1 (i.e. on a line or a circle). We use the theory of…
Consider the following two ways to colour the vertices of a graph where the requirement that adjacent vertices get distinct colours is relaxed. A colouring has "defect" $d$ if each monochromatic component has maximum degree at most $d$. A…
The Hochschild cohomology of a differential graded algebra, or a differential graded category, admits a natural map to the graded center of its homology category: the characteristic homomorphism. We interpret it as an edge homomorphism in a…
In this paper, we study algebraic geometry codes from curves over $\mathbb{F}_{q^\ell}$ through their virtual projections which are algebraic geometric codes over $\mathbb{F}_q$. We use the virtual projections to provide fractional decoding…
In this work, we develop an efficient decoding method for graph codes, a class of stabilizer quantum error-correcting codes constructed from graph states. While optimal decoding is generally NP-hard, we propose a faster decoder exploiting…
The moduli space of slope-stable vector bundles on a normal projective variety over an algebraically closed field of characteristic $p\geq 0$ is stratified with respect to the decomposition type. On a smooth projective curve of genus at…
We develop a combinatorial and order-theoretic framework for shuffles, understood as ordered concatenations of indexed families of sequences that induce total orders on the natural numbers. Motivated by the classical \v{S}arkovski\u{i}…
It has been shown that graph-cover pseudocodewords can be used to characterize the behavior of sum-product algorithm (SPA) decoding of classical codes. In this paper, we leverage and adapt these results to analyze SPA decoding of quantum…
We study Picard groups and $K_0$ groups for the cluster algebras that come from the cluster categories of \cite{HernandezLeclerc}. This is inspired by a study of boundaries and defects in the associated spin chains. We also do some…
This tutorial gives an advanced introduction to string diagrams and graph languages for higher-order computation. The subject matter develops in a principled way, starting from the two dimensional syntax of key categorical concepts such as…
In this paper we study degenerations of scrolls to union of planes, a problem already considered by G. Zappa in 1940-50. We prove, using techniques different from the ones of Zappa, a degeneration result to union of planes with the mildest…
We systematically study the splitting of vector bundles on a smooth, projective variety, whose restriction to the zero locus of a regular section of an ample vector bundle splits. First, we find ampleness and genericity conditions which…
Coded computation is an emerging research area that leverages concepts from erasure coding to mitigate the effect of stragglers (slow nodes) in distributed computation clusters, especially for matrix computation problems. In this work, we…
Text-to-CAD code generation is a long-horizon task that translates textual instructions into long sequences of interdependent operations. Existing methods typically decode text directly into executable code (e.g., bpy) without explicitly…
Graph covers are a way to describe continuous maps (and homeomorphisms) of a Cantor set, more generally than e.g.\ Bratteli-Vershik systems. Every continuous map on a zero-dimensional compact set can be expressed by a graph cover (e.g.\…
A chord diagram consists of a circle, called the backbone, with line segments, called chords, whose endpoints are attached to distinct points on the circle. The genus of a chord diagram is the genus of the orientable surface obtained by…
In this paper, we present a framework for generic decoding of convolutional codes, which allows us to do cryptanalysis of code-based systems that use convolutional codes. We then apply this framework to information set decoding, study…