相关论文: Combinatorial aspects of code loops

Subspace codes were introduced by K\"otter and Kschischang for error control in random linear network coding. In this paper, a layered type of subspace codes is considered, which can be viewed as a superposition of multiple component…

We present a new application of multi-orbit cyclic subspace codes to construct large optical orthogonal codes, with the aid of the multiplicative structure of finite fields extensions. This approach is different from earlier approaches…

Schubert polynomials were introduced in the context of the geometry of flag varieties. This paper investigates some of the connections not yet understood between several combinatorial structures for the construction of Schubert polynomials;…

We introduce a class of codes with overlapping code words, that we call SPO-codes. The SPO-codes are related to the Markov codes that were introduced in: G. Keller, J. Combinatorial Theory 56, (1991),pp.\ 75--83. The process of generating a…

We construct a combinatorial model that is described by the cube recurrence, a nonlinear recurrence relation introduced by Propp, which generates families of Laurent polynomials indexed by points in $\mathbb{Z}^3$. In the process, we prove…

The idea of graph compositions, which was introduced by A. Knopfmacher and M. E. Mays, generalizes both ordinary compositions of positive integers and partitions of finite sets. In their original paper they developed formulas, generating…

This paper introduces a new combinatorial construction for q-ary constant-weight codes which yields several families of optimal codes and asymptotically optimal codes. The construction reveals intimate connection between q-ary…

We present a simplified formulation of open intersection numbers, as an alternative to the theory initiated by Pandharipande, Solomon and Tessler. The relevant moduli spaces consist of Riemann surfaces (either with or without boundary) with…

Combinatorial model categories were introduced by J. H. Smith as model categories which are locally presentable and cofibrantly generated. He has not published his results yet but proofs of some of them were presented by T. Beke or D.…

This note examines a problem in enumerative and asymptotic combinatorics involving the classical structure of integer compositions. What is sought is an analysis on average and in distribution of the length of the longest run of consecutive…

We study the concept of a code (or shift) space for a generalized iterated function system (GIFS in short). We prove that relations between GIFSs and their code spaces are analogous to the case of classical IFSs. As an application, we…

In 2002, Andrews, Lewis, and Lovejoy introduced the combinatorial objects which they called partitions with designated summands. These are constructed by taking unrestricted integer partitions and designating exactly one of each occurrence…

We show how good quantum error-correcting codes can be constructed using generalized concatenation. The inner codes are quantum codes, the outer codes can be linear or nonlinear classical codes. Many new good codes are found, including both…

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…

Two isometry groups of combinatorial codes are described: the group of automorphisms and the group of monomial automorphisms, which is the group of those automorphisms that extend to monomial maps. Unlike the case of classical linear codes,…

Combinatorial $t$-designs have been an interesting topic in combinatorics for decades. It was recently reported that the image sets of a fixed size of certain special polynomials may constitute a $t$-design. Till now only a small amount of…

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…

We show the existence of regular combinatorial objects which previously were not known to exist. Specifically, for a wide range of the underlying parameters, we show the existence of non-trivial orthogonal arrays, t-designs, and t-wise…

We study the problem of generating interesting integer sequences with a combinatorial interpretation. For this we introduce a two-step approach. In the first step, we generate first-order logic sentences which define some combinatorial…

A subspace of a finite extension field is called a Sidon space if the product of any two of its elements is unique up to a scalar multiplier from the base field. Sidon spaces were recently introduced by Bachoc et al. as a means to…