Related papers: Direct construction of code loops
In this paper, we study the dihedral codes, i.e. the left ideals of $\mathbb{F}_qD_{n}$ in the case $\gcd(q, n) = 1$. An explicit algebraic description of the dihedral codes and their duals is obtained. In addition, a criterion for…
We construct bijections giving three "codes" for trees. These codes follow naturally from the Matrix Tree Theorem of Tutte and have many advantages over the one produced by Prufer in 1918. One algorithm gives explicitly a bijection that is…
Triorthogonal matrices were introduced in Quantum Information Theory in connection with distillation of magic states (Bravyi and Haah (2012)). We give an algorithm to construct binary triorthogonal matrices from binary self-dual codes.…
The field of computability and complexity was, where computer science sprung from. Turing, Church, and Kleene all developed formalisms that demonstrated what they held "intuitively computable". The times change however and today's…
Cyclic codes are a subclass of linear codes and have applications in consumer electronics, data storage systems, and communication systems as they have efficient encoding and decoding algorithms. In this paper, monomials and trinomials over…
We give the construction of a class of weak Hopf algebras (or quantum groupoids) associated to a matched pair of groupoids and certain cocycle data. This generalizes a now well-known construction for Hopf algebras, first studied by G. I.…
Many codes have been developed to study highly relativistic, magnetized flows around and inside compact objects. Depending on the adopted formalism, some of these codes evolve the vector potential $\mathbf{A}$, and others evolve the…
Code summarization generates brief natural language description given a source code snippet, while code retrieval fetches relevant source code given a natural language query. Since both tasks aim to model the association between natural…
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…
In this paper, we consider minimal linear codes in a general construction of linear codes from q-ary functions. First, we give the sufficient and necessary condition for codewords to be minimal. Second, as an application, we present four…
In this paper, we describe linear and cyclic codes over the rings of the form $R_{s,p}=\mathbb{Z}_{p}[u]/\left( f\left(u\right) /\left( u-s\right) \right)$, where $p$ is a prime number and $f\left( u\right) =u^{p}-u$, with $s\in…
Twisted generalized Reed-Solomon (TGRS) codes, as a flexible extension of classical generalized Reed-Solomon (GRS) codes, have attracted significant attention in recent years. In this paper, we construct two classes of LCD codes from the…
The problem of finding network codes for general connections is inherently difficult in capacity constrained networks. Resource minimization for general connections with network coding is further complicated. Existing methods for…
We review the recent developments of the Loop-Tree Duality method, focussing our discussion on the first numerical implementation and its use in the direct numerical computation of multi-leg Feynman integrals. Non-trivial examples are…
In this paper, we propose a general construction of linear perfect codes over infinite skew fields and quasi skew fields with right (left) unity. A complete classification of such codes over associative skew fields is given. Since the…
Linear codes with few weights have significant applications in secret sharing schemes, authentication codes, association schemes, and strongly regular graphs. There are a number of methods to construct linear codes, one of which is based on…
Binary optimal codes often contain optimal or near-optimal subcodes. In this paper we show that this is true for the family of self-dual codes. One approach is to compute the optimum distance profiles (ODPs) of linear codes, which was…
Linear codes with a few weights are an important class of codes in coding theory and have attracted a lot of attention. In this paper, we present several constructions of $q$-ary linear codes with two or three weights from vectorial…
In 2021, Augot, Couvreur, Lavauzelle and Neri introduced a new class of rank metric codes which can be regarded as rank metric counterparts of Reed-Muller codes. Given a finite Galois extension $\mathbb{L} / \mathbb{K}$, these codes are…
The idea of graph compositions, which was introduced by A. Knopfmacher and M. E. Mays, generalizes both ordinary compositions of positive integers and partitions of finite sets. In their original paper they developed formulas, generating…