Related papers: On the factor set of code loops
We study the number of factorizations of a positive integer, where the parts of the factorization are of l different colors (or kinds). Recursive or explicit formulas are derived for the case of unordered and ordered, distinct and…
A framework for linear-programming (LP) decoding of nonbinary linear codes over rings is developed. This framework facilitates linear-programming based reception for coded modulation systems which use direct modulation mapping of coded…
A conjugate code pair is defined as a pair of linear codes either of which contains the dual of the other. A conjugate code pair represents the essential structure of the corresponding Calderbank-Shor-Steane (CSS) quantum error-correcting…
A sharp bound is obtained for the number of ways to express the monomial $X^n$ as a product of linear factors over $\mathbb{Z}/p^{\alpha}\mathbb{Z}$. The proof relies on an induction-on-scale procedure which is used to estimate the number…
The Euclidean hull of a linear code $C$ is defined as $C\cap C^{\perp}$, where $C^\perp$ denotes the dual of $C$ under the Euclidean inner product. A linear code with zero hull dimension is called a linear complementary dual (LCD) code. A…
In this paper, on one hand, a class of linear codes with one or two weights is obtained. Based on these linear codes, we construct two classes of constant composition codes, which includes optimal constant composition codes depending on…
Linear Programs (LP) are celebrated widely, particularly so in machine learning where they have allowed for effectively solving probabilistic inference tasks or imposing structure on end-to-end learning systems. Their potential might seem…
In previous work, we demonstrated how decoding of a non-binary linear code could be formulated as a linear-programming problem. In this paper, we study different polytopes for use with linear-programming decoding, and show that for many…
A generalization of the polar coding scheme called mixed-kernels is introduced. This generalization exploits several homogeneous kernels over alphabets of different sizes. An asymptotic analysis of the proposed scheme shows that its…
We present some basic theory on the duality of codes over two non-unital rings of order $6$, namely $H_{23}$ and $H_{32}$. For a code $\mathcal{C}$ over these rings, we associate a binary code $\mathcal{C}_a$ and a ternary code…
The choice of an isomorphism, a duality, between a finite abelian group $A$ and its character group allows one to define dual codes of additive codes over $A$. Properties of dualities and dual codes are studied, continuing work of Delsarte…
Four circulant codes form a special class of $2$-generator, index $4$, quasi-cyclic codes. Under some conditions on their generator matrices they can be shown to be self-dual. Artin primitive root conjecture shows the existence of an…
We create a sequence version of calculus. First, we define equivalence, some fundamental operations, differential, and integral for sequences. Then, we propose sequence versions of identity function, power function, exponential function,…
The main result concerns a bicategorical factorization system on the bicategory $\mathrm{Cat}$ of categories and functors. Each functor $A\xra{f} B$ factors up to isomorphism as $A\xra{j}E\xra{p}B$ where $j$ is what we call an ultimate…
Binary Reed-Muller (RM) codes are defined via evaluations of Boolean-valued functions on $\mathbb{Z}_2^m$. We introduce a class of binary linear codes that generalizes the RM family by replacing the domain $\mathbb{Z}_2^m$ with an arbitrary…
There are three kinds of multiple polylogarithms; complex, finite and symmetric. The dualities for the complex and finite cases are known. In this paper, we present proofs of them via iterated integrals and its symmetric counterpart by a…
A combinatorial code $\mathcal{C}$ is a collection of subsets of $[n]$, or equivalently a set of points in $\{0,1\}^n$. A morphism of codes is a map from one combinatorial code to another such that the coordinates of points in the image can…
We study conjugacy closed loops (CC-loops) and power-associative CC-loops (PACC-loops). If $Q$ is a PACC-loop with nucleus $N$, then $Q/N$ is an abelian group of exponent 12; if in addition $Q$ is finite, then $|Q|$ is divisible by 16 or by…
We define a ring whose elements are rational functions, whose addition is polynomial multiplication, and whose multiplication is a convolution operation. It is then show that this ring's endomorphisms exhibit a strong classification.…
This paper considers a base station that delivers packets to multiple receivers through a sequence of coded transmissions. All receivers overhear the same transmissions. Each receiver may already have some of the packets as side…