Related papers: Good Integers and Applications in Coding Theory
As mathematical induction is applied to prove statements on natural numbers, {\it continuous induction} (or, {\it real induction}) is a tool to prove some statements in real analysis.(Although, this comparison is somehow an overstatement.)…
The algebras of the title are infinite-dimensional graded Lie algebras $L= \bigoplus_{i=1}^{\infty}L_i$, over a field of positive characteristic $p$, that are generated by an element of degree $1$ and an element of degree $p$, and satisfy…
This article surveys the development of the theory of algebraic geometry codes since their discovery in the late 70's. We summarize the major results on various problems such as: asymptotic parameters, improved estimates on the minimum…
The formal study of completely prime modules was initiated by N. J. Groenewald and the current author in the paper; Completely prime submodules, {\it Int. Elect. J. Algebra}, {\bf 13}, (2013), 1--14. In this paper, the study of completely…
Universal coding of integers~(UCI) is a class of variable-length code, such that the ratio of the expected codeword length to $\max\{1,H(P)\}$ is within a constant factor, where $H(P)$ is the Shannon entropy of the decreasing probability…
Using the subdivision schemes theory, we develop a criterion to check if any natural number has at most one representation in the $n$-ary number system with a set of non-negative integer digits $A=\{a_1, a_2,\ldots, a_n\}$ that contains…
This introduction to arithmetic coding is divided in two parts. The first explains how and why arithmetic coding works. We start presenting it in very general terms, so that its simplicity is not lost under layers of implementation details.…
In the paper "An Abelian Loop for Non-Composites" (arXiv:110.14716), we introduced a group-like structure consisting of odd prime numbers and 1, with properties that allowed us to prove analogous results to well known theorems in Number…
A covering code is a set of codewords with the property that the union of balls, suitably defined, around these codewords covers an entire space. Generally, the goal is to find the covering code with the minimum size codebook. While most…
Odd numbers can be indexed by the map k(n)=(n-3)/2, n belonging to 2N+3. We first propose a basic primality test using this index function that was first introduced in article (8). Input size of operations is reduced which improves…
We study relations between subsets of integers that are large, where large can be interpreted in terms of size (such as a set of positive upper density or a set with bounded gaps) or in terms of additive structure (such as a Bohr set). Bohr…
We pursue the question how integers can be ordered or partitioned according to their divisibility properties. Based on pseudometrics on $\mathbb{Z}$, we investigate induced preorders, associated equivalence relations, and quotient sets. The…
Neural ideals were introduced by Curto, Itskov, et al as an algebraic tool to study neural codes. In this paper, we use the notion of polarization introduced by G\"{u}nt\"{u}rk\"{u}n, Jeffries, and Sun to compute Betti numbers of…
A positive integer $n$ is said to be a Zumkeller number or an integer-perfect number if the set of its positive divisors can be partitioned into two subsets of equal sums. In this paper, we prove several results regarding Zumkeller numbers.…
Algebraic geometry codes or Goppa codes are defined with places of degree one. In constructing generalised algebraic geometry codes places of higher degree are used. In this paper we present 41 new codes over GF(16) which improve on the…
In Index coding there is a single sender with multiple messages and multiple receivers each wanting a different set of messages and knowing a different set of messages a priori. The Index Coding problem is to identify the minimum number of…
We define admissible and weakly admissible subcategories in exact categories and prove that the former induce semi-orthogonal decompositions on the derived categories. We develop the theory of thin exact categories, an exact-category…
De Loera, O'Neill and Wilburne introduced a general model for random numerical semigroups in which each positive integer is chosen independently with some probability p to be a generator, and proved upper and lower bounds on the expected…
This paper concerns the \textbf{abstract geometry of numbers}: namely the pursuit of certain aspects of geometry of numbers over a suitable class of normed domains. (The standard geometry of numbers is then viewed as geometry of numbers…
An odd perfect number $N$ is said to be given in Eulerian form if $N = {q^k}{n^2}$ where $q$ is prime with $q \equiv k \equiv 1 \pmod 4$ and $\gcd(q,n) = 1$. Similarly, an even perfect number $M$ is said to be given in Euclidean form if $M…