相关论文: On some batch code properties of the simplex code

We introduce and investigate binary $(k,k)$-designs -- combinatorial structures which are related to binary orthogonal arrays. We derive general linear programming bound and propose as a consequence a universal bound on the minimum possible…

A generic construction of linear codes over finite fields has recently received a lot of attention, and many one-weight, two-weight and three-weight codes with good error correcting capability have been produced with this generic approach.…

We present a construction of 1-perfect binary codes, which gives a new lower bound on the number of such codes. We conjecture that this lower bound is asymptotically tight.

It is well known that every finite simple group can be generated by two elements and this leads to a wide range of problems that have been the focus of intensive research in recent years. In this survey article we discuss some of the…

A finite-dimensional unital and associative algebra over $\mathbb{R}$, or what we shall call simply "an algebra" in this paper for short, generalities the construction by which we derive the complex numbers by "adjoining an element $i$" to…

We classify simple groups that act by birational transformations on compact complex K\"ahler surfaces. Moreover, we show that every finitely generated simple group that acts non-trivially by birational transformations on a projective…

We study the prime pair counting functions $\pi_{2k}(x),$ and their averages over $2k.$ We show that good results can be achieved with relatively little effort by considering averages. We prove an asymptotic relation for longer averages of…

Variable-length codes are the bases of the free submonoids of a free monoid. There are some important longstanding open questions about the structure of finite maximal codes. In this paper we discuss this conjectures and their relations…

Using an algebraic approach based on the theory of Coxeter groups, we design, and describe the performance of, a class of line codes for parallel transmission of $b$ bits over $b+1$ wires that admit especially simple encoding and decoding…

In the field of mathematics, a purely combinatorial equivalent to a simplicial complex, or more generally, a down-set, is an abstract structure known as a family of sets. This family is closed under the operation of taking subsets, meaning…

In this article we analyze the structure of $2$-categories of symmetric projective bimodules over a finite dimensional algebra with respect to the action of a finite abelian group. We determine under which condition the resulting…

We introduce a full binary directed tree structure to represent the set of natural numbers, further categorizing them into three distinct subsets: pure odd numbers, pure even numbers, and mixed numbers. We adopt a binary string…

Cyclicity of a convolutional code (CC) is relying on a nontrivial automorphism of the algebra F[x]/(x^n-1), where F is a finite field. If this automorphism itself has certain specific cyclicity properties one is lead to the class of…

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…

Using the classification of finite simple groups we prove Alperin's weight conjecture and the character theoretic version of Broue's abelian defect group conjecture for 2-blocks of finite groups with an elementary abelian defect group of…

Batch codes are of potential use for load balancing and private information retrieval in distributed data storage systems. Recently, a special case of batch codes, termed functional batch codes, was proposed in the literature. In functional…

We study the notion of formal self duality in finite abelian groups. Formal duality in finite abelian groups has been proposed by Cohn, Kumar, Reiher and Sch\"urmann. In this paper we give a precise definition of formally self dual sets and…

We relate the computational complexity of finite strings to universal representations of their underlying symmetries. First, Boolean functions are classified using the universal covering topologies of the circuits which enumerate them. A…

Binary duadic codes are an interesting subclass of cyclic codes since they have large dimensions and their minimum distances may have a square-root bound. In this paper, we present several families of binary duadic codes of length $2^m-1$…

Bazzi and Mitter [3] showed that binary dihedral group codes are asymptotically good. In this paper we prove that the dihedral group codes over any finite field with good mathematical properties are asymptotically good. If the…