Related papers: On maximum components of a class of perfect codes
A characterization of a class of optimal three-weight cyclic codes of dimension 3 over any finite field was recently presented in [10]. Shortly after this, a generalization for the sufficient numerical conditions of such characterization…
We study circuit codes with long bit runs (sequences of distinct transitions) and derive a formula for the maximum length for an infinite class of symmetric circuit codes with long bit runs. This formula also results in an improved lower…
We prove that the prime ideals in every class of a number field contain arbitrary large truncated ideal classes.
We introduce the factor complex of a neural code, and show how intervals and maximal codewords are captured by the combinatorics of factor complexes. We use these results to obtain algebraic and combinatorial characterizations of…
We give all bi-unitary non splitting even perfect polynomials over the prime field of two elements, which are divisible by Mersenne irreducible polynomials raised to special exponents. We also identify all bi-unitary perfect polynomials…
We show that every additive category with kernels and cokernels admits a maximal exact structure. Moreover, we discuss two examples of categories of the latter type arising from functional analysis.
A multifold $1$-perfect code ($1$-perfect code for list decoding) in any graph is a set $C$ of vertices such that every vertex of the graph is at distance not more than $1$ from exactly $\mu$ elements of $C$. In $q$-ary Hamming graphs,…
A large family of linear codes with flexible parameters from almost bent functions and perfect nonlinear functions are constructed and their parameters are determined. Some constructed linear codes and their related codes are optimal in the…
There exists a large literature of construction of convolutional codes with maximal or near maximal free distance. Much less is known about constructions of convolutional codes having optimal or near optimal column distances. In this paper,…
In this paper, we propose a class of linear codes and obtain their weight distribution. Some of these codes are almost optimal. Moreover, several classes of constant composition codes(CCCs) are constructed as subcodes of linear codes.
In this paper, we give a formula for the proper class number of a binary quadratic polynomial assuming that the conductor ideal is sufficiently divisible at dyadic places. This allows us to study the growth of the proper class numbers of…
The binary Hamming codes with parameters $[2^m-1, 2^m-1-m, 3]$ are perfect. Their extended codes have parameters $[2^m, 2^m-1-m, 4]$ and are distance-optimal. The first objective of this paper is to construct a class of binary linear codes…
We generalized to higher dimensions the notions of optical orthogonal codes. We establish uper bounds on the capacity of general $ n $-dimensional OOCs, and on specific types of ideal codes (codes with zero off-peak autocorrelation). The…
We characterize the group property of being with infinite conjugacy classes (or icc, i.e. in which all conjugacy classes beside 1 are infinite) for split extensions of groups.
In this paper we describe a class of codes called {\it permutation codes}. This class of codes is a generalization of cyclic codes and quasi-cyclic codes. We also give some examples of optimal permutation codes over binary, ternary, and…
We give a fairly complete characterization of the exact components of a large class of uniformly expanding Markov maps of $\mathbb{R}$. Using this result, for a class of $\mathbb{Z}$-invariant maps and finite modifications thereof, we prove…
In this paper we maximize a class of functionals under certain constraints. We find sufficient and necessary conditions for these maximizers to exist and be unique. Moreover, we characterize them and discuss the optimality of our results by…
We consider extended $1$-perfect codes in Hamming graphs $H(n,q)$. Such nontrivial codes are known only when $n=2^k$, $k\geq 1$, $q=2$, or $n=q+2$, $q=2^m$, $m\geq 1$. Recently, Bespalov proved nonexistence of extended $1$-perfect codes for…
A complete classification of binary doubly even self-dual codes of length 40 is given. As a consequence, a classification of binary extremal self-dual codes of length 38 is also given.
We describe odd-length-cube tilings of the n-dimensional q-ary torus what includes q-periodic integer lattice tilings of R^n. In the language of coding theory these tilings correspond to perfect codes with respect to the maximum metric. A…