Related papers: (Re)constructing Code Loops
Cyclic codes, as linear block error-correcting codes in coding theory, play a vital role and have wide applications. Ding in \cite{D} constructed a number of classes of cyclic codes from almost perfect nonlinear (APN) functions and planar…
The general subject considered in this thesis is a recently discovered coding technique, polar coding, which is used to construct a class of error correction codes with unique properties. In his ground-breaking work, Ar{\i}kan proved that…
For piecewise-smooth differential systems, in this paper we focus on crossing limit cycles and sliding loops bifurcating from a grazing loop connecting one high multiplicity tangent point. For the low multiplicity cases considered in…
We introduce a novel construction of a contour deformation within the framework of Loop-Tree Duality for the numerical computation of loop integrals featuring threshold singularities in momentum space. The functional form of our contour…
We reformulate the monodromy relations of open-string scattering amplitudes as boundary terms of twisted homologies on the configuration spaces of Riemann surfaces of arbitrary genus. This allows us to write explicit linear relations…
This paper proposes a new family of recursive systematic convolutional codes, defined in the non-binary domain over different Galois fields GF(q) and intended to be used as component codes for the design of non-binary turbo codes. A general…
Probabilistic circuits (PCs) are a unifying representation for probabilistic models that support tractable inference. Numerous applications of PCs like controllable text generation depend on the ability to efficiently multiply two circuits.…
Golay complementary pairs (GCPs) and complete complementary codes (CCCs) have found a wide range of practical applications in coding, signal processing and wireless communication due to their ideal correlation properties. In fact, binary…
We calculate mod-p cohomology of extended powers, and their group completions which are free infinite loop spaces. We consider the cohomology of all extended powers of a space together and identify a Hopf ring structure with divided powers…
Rudolph (1967) introduced one-step majority logic decoding for linear codes derived from combinatorial designs. The decoder is easily realizable in hardware and requires that the dual code has to contain the blocks of so called geometric…
Inspired by code vertex operator algebras (VOAs) and their representation theory, we define code algebras, a new class of commutative non-associative algebras constructed from binary linear codes. Let $C$ be a binary linear code of length…
Provably correct software is one of the key challenges in our softwaredriven society. While formal verification establishes the correctness of a given program, the result of program synthesis is a program which is correct by construction.…
We propose a new family of spatially coupled product codes, called sub-block rearranged staircase (SR-staircase) codes. Each code block of SR-staircase codes is obtained by encoding rearranged preceding code blocks and new information…
Given a Hopf algebra $A$ graded by a discrete group together with an action of the same group preserving the grading, we define a new Hopf algebra, which we call the graded twisting of $A$. If the action is adjoint, this new Hopf algebra is…
Different approaches to construct linear codes using skew polynomials can be unified by using the nonassociative algebras built from skew-polynomial rings by Petit.
To refactor already working code while keeping reliability, compatibility and perhaps security, we can borrow ideas from micropass/nanopass compilers. By treating the procedure of software refactoring as composing code transformations, and…
By using cocycle deformation, we construct a certain class of Hopf algebras, containing the quantized enveloping algebras and their analogues, from what we call pre-Nichols algebras. Our construction generalizes in some sense the known…
It is explicitly shown how the Lie algebras can be associated with the analytic Moufang loops. The resulting Lie algebra commutation relations are well known from the theory of alternative algebras and can be seen as a preliminary step to…
The quark form factor is known to exponentiate within the framework of dimensionally regularized perturbative QCD. The logarithm of the form factor is expressed in terms of integrals over the scale of the running coupling. I show that these…
We take initial steps towards a general framework for constructing logical gates in general quantum CSS codes. Viewing CSS codes as cochain complexes, we observe that cohomology invariants naturally give rise to diagonal logical gates. We…