Related papers: (Re)constructing Code Loops
Subspace codes have received an increasing interest recently due to their application in error-correction for random network coding. In particular, cyclic subspace codes are possible candidates for large codes with efficient encoding and…
We study sheaf codes, a type of linear codes with a fixed hierarchical collection of local codes, viewed as a sheaf of vector spaces on a finite topological space we call coded space. Many existing codes, such as tensor product codes,…
This article begins with an exploration of nonlinear codes ($\mathbb{F}_q$-linear subspaces of $\mathbb{F}_{q^m}^n$) which are generalizations of the familiar Reed-Solomon codes. This then leads to a wider exploration of nonlinear analogues…
Locally recoverable codes deal with the task of reconstructing a lost symbol by relying on a portion of the remaining coordinates smaller than an information set. We consider the case of codes over finite chain rings, generalizing known…
Classical Goppa codes are a well-known class of codes with applications in code-based cryptography, which are a special case of alternant codes. Many papers are devoted to the search for Goppa codes with a cyclic extension or with a cyclic…
Using the $E_\infty-$structure on singular cochains, we construct a homotopy coherent map from the cyclic bar construction of the differential graded algebra of cochains on a space to a model for the cochains on its free loop space. This…
A question associated with the 2005 open problem of Michael Kinyon (Is every Osborn loop universal?), is answered. Two nice identities that characterize universal (left and right universal) Osborn loops are established. Numerous new…
The quantum circuit model essentially treats every quantum algorithm as a straight-line program. While this view is universal, recent work has shown that it is inconvenient for using different-length quantum subroutines in superposition.…
We design a non-commutative version of the Peterson-Gorenstein-Zierler decoding algorithm for a class of codes that we call skew RS codes. These codes are left ideals of a quotient of a skew polynomial ring, which endow them of a sort of…
Zipper codes are a framework for describing spatially-coupled product-like codes. Many well-known codes, such as staircase codes and braided block codes, are subsumed into this framework. New types of codes such as tiled diagonal and…
The ring of symmetric functions $\Lambda$, with natural basis given by the Schur functions, arise in many different areas of mathematics. For example, as the cohomology ring of the grassmanian, and as the representation ring of the…
Counting non-isomorphic tree-like multigraphs that include self-loops and multiple edges is an important problem in combinatorial enumeration, with applications in chemical graph theory, polymer science, and network modeling. Traditional…
We consider the problem of coded distributed computing where a large linear computational job, such as a matrix multiplication, is divided into $k$ smaller tasks, encoded using an $(n,k)$ linear code, and performed over $n$ distributed…
A new class of spatially-coupled turbo-like codes (SC-TCs), dubbed generalized spatially coupled parallel concatenated codes (GSC-PCCs), is introduced. These codes are constructed by applying spatial coupling on parallel concatenated codes…
The loop algebra construction by Allison, Berman, Faulkner, and Pianzola, describes graded-central-simple algebras with split centroid in terms of central simple algebras graded by a quotient of the original grading group. Here the…
A construction is presented that allows to produce subspace codes of long length using subspace codes of shorter length in combination with a rank metric code. The subspace distance of the resulting code, called linkage code, is as good as…
Cyclic codes have many applications in consumer electronics, communication and data storage systems due to their efficient encoding and decoding algorithms. An efficient approach to constructing cyclic codes is the sequence approach. In…
Modern distributed computation infrastructures are often plagued by unavailabilities such as failing or slow servers. These unavailabilities adversely affect the tail latency of computation in distributed infrastructures. The simple…
The causal representation of multi-loop scattering amplitudes, obtained from the application of the loop-tree duality formalism, comprehensively elucidates, at integrand level, the behaviour of only physical singularities. This…
It is well known that central extensions of a group G correspond to 2-cocycles on G. Cocycles can be used to construct extensions of G-graded algebras via a version of the Drinfeld twist introduced by Majid. We show how 2-cocycles can be…