Related papers: On some batch code properties of the simplex code

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 equip the product of countably many copies of a compact Abelian group X with the uniform topology, and study some properties of the topological group G thus obtained. In particular, we determine the cardinality of the dual group of G,…

Minimal linear codes have significant applications in secret sharing schemes and secure two-party computation. There are several methods to construct linear codes, one of which is based on functions over finite fields. Recently, many…

Let Delta_{n-1} denote the (n-1)-dimensional simplex. Let Y be a random k-dimensional subcomplex of Delta_{n-1} obtained by starting with the full (k-1)-dimensional skeleton of Delta_{n-1} and then adding each k-simplex independently with…

Consider the Grassmann graph formed by $k$-dimensional subspaces of an $n$-dimensional vector space over the field of $q$ elements ($1<k<n-1$) and denote by $\Pi(n,k)_q$ the restriction of this graph to the set of projective $[n,k]_q$…

Let G be a finite group and let p be a prime. A module for G over a field of characteristic p is called algebraic if it satisfies a polynomial, with addition and multiplication given by direct sum and tensor product. In some sense, having…

In an interesting paper Professor Cunsheng Ding provided three constructions of cyclic codes of length being a product of two primes. Numerical data shows that many codes from these constructions are best cyclic codes of the same length and…

We obtain a new upper bound for binary sums with multiplicative characters over variables belong to some sets, having small additive doubling.

The union of a collection of $n$ sets is generally expressed in terms of a characteristic (indicator) function that contains $2^{n}-1$ terms. In this article, a much simpler expression is found that requires the evaluation of $n$ terms…

The main result can be given a short and elementary proof which has been incorporated into Lemma 3.2 of arXiv:1206.5775

We introduce new yet easily accessible codes for elements of $GL_r(A)$ with $A$ the adelic ring of a (dimension one) function field over a finite field. They are linear codes, and coincide with classical algebraic geometry codes when $r=1$.…

The generalized binary sequences of order 2 have been used to construct good binary cyclic codes [4]. The linear complexity of these sequences has been computed in [2]. The autocorrelation values of such sequences have been determined in…

In this paper, we investigate the symbol-pair weight distributions of MDS codes and simplex codes over finite fields. Furthermore, the result shows that all the nonzero codewords of simplex codes have the same symbol $b$-weight and…

We obtain a classification of the finite two-generated cyclic-by-abelian groups of prime-power order. For that we associate to each such group $G$ a list $\inv(G)$ of numerical group invariants which determines the isomorphism type of $G$.…

For a family of functionals defined on a Hilbert manifold and smoothly depending on a compact finite dimensional manifold, we give a sufficient condition on the parameter space in such a way the family bifurcate from the trivial branch.

We note with B2 the Boole algebra with two elements. We define for the R->B2 functions the limits, the derivatives, the differentiability, the test functions, the integrals. We also define the distributions over the space of these test…

We consider two quantities that measure complexity of binary strings: $\mathit{KA}(x)$ is defined as the minus logarithm of continuous a priori probability on the binary tree, and $\mathit{KP}(x)$ denotes prefix complexity of a binary…

We determine the structure of 2-blocks with minimal nonabelian defect groups, by making use of the classification of finite simple groups.

We provide a "shared axiomatization" of natural numbers and hereditarily finite sets built around a polymorphic abstraction of bijective base-2 arithmetics. The "axiomatization" is described as a progressive refinement of Haskell type…

Assume that $\mathfrak A$ is a real Banach space of finite dimension $n\geq2$. Consider any Borel probability measure $\nu$ supported on the unit ball $K$ of $\mathfrak A$. We show that \[\Delta(\nu)=\int_{x \in K}\int_{ y\in…