Related papers: On generalized Sidon spaces
The paper has a threefold purpose. The first purpose is to present an explicit description of expanded cyclic codes defined in $\GF(q^m)$. The proposed explicit construction of expanded generator matrix and expanded parity check matrix…
In this paper we summarize and give examples of a generalization of the coorbit space theory initiated in the 1980's by H.G. Feichtinger and K.H. Gr\"ochenig. Coorbit theory has been a powerful tool in characterizing Banach spaces of…
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…
Semenov and Trifonov [22] developed a spectral theory for quasi-cyclic codes and formulated a BCH-like minimum distance bound. Their approach was generalized by Zeh and Ling [24], by using the HT bound. The first spectral bound for…
While studying some properties of linear operators in a Euclidean Jordan algebra, Gowda, Sznajder and Tao have introduced generalized lattice operations based on the projection onto the cone of squares. In two recent papers of the authors…
Reeb spaces of continuous real-valued functions on topological spaces are fundamental and strong tools in investigating the spaces. The Reeb space is the natural quotient space of the space of the domain represented by connected components…
Vector spaces over finite fields and Anzahl formulas of subspaces were studied by Wan (Geometry of Classical Groups over Finite Fields, Science Press, 2002). As a generalization, we study vector spaces and singular linear spaces over…
A subset $A$ of a commutative semigroup $X$ is called a $B_h$ set in $X$ if the only solutions to $a_1+\dots+a_h = b_1 + \cdots +b_h$ (with $a_i,b_i \in A$) are the trivial solutions $\{a_1,\dots,a_h\} = \{b_1,\dots,b_h\}$ (as multisets).…
Number sequences with wide-ranging applications in mathematics, physics, medicine, and engineering remain an active research topic. This study examines these sequences through the general framework of Horadam numbers and their special cases…
The space $\mathscr B_{mt}[(m_j)_j,(n_j)_j]$ is a Bourgain-Delbaen space modelled on a mixed Tsirelson space $T[(m_j)_j,(n_j)_j]$ and is a slight modification of $\mathfrak B_{\text{mt}}[(m_j)_j,(n_j)_j]$, a space defined by S. Argyros and…
In 2003 Peter Cameron introduced the concept of a Jordan scheme and asked whether there exist Jordan schemes which are not symmetrisations of coherent configurations (proper Jordan schemes). The question was answered affirmatively by the…
Subspace codes were introduced in order to correct errors and erasures for randomized network coding, in the case where network topology is unknown (the noncoherent case). Subspace codes are indeed collections of subspaces of a certain…
In 1975, M. M. Choban introduced a new topology on the set of all closed subsets of a topological space, similar to the Tychonoff topology but weaker than it. In 1998, G. Dimov and D. Vakarelov used a generalized version of this new…
LDPC codes constructed from permutation matrices have recently attracted the interest of many researchers. A crucial point when dealing with such codes is trying to avoid cycles of short length in the associated Tanner graph, i.e. obtaining…
The notions of compactness and Hausdorff separation for generalized enriched categories allow us, as classically done for the category $\mathsf{Top}$ of topological spaces and continuous functions, to study $\textit{compactly generated…
The topology of periodic spaces has attracted a lot of interest in recent years in order to study and classify crystalline structures and other large homogeneous data sets, such as the distribution of galaxies in cosmology. In practice,…
After a seminal paper by Shekeey (2016), a connection between maximum $h$-scattered $\mathbb{F}_q$-subspaces of $V(r,q^n)$ and maximum rank distance (MRD) codes has been established in the extremal cases $h=1$ and $h=r-1$. In this paper, we…
Subspace codes have important applications in random network coding. It is interesting to construct subspace codes with both sizes, and the minimum distances are as large as possible. In particular, cyclic constant dimension subspaces codes…
We introduce a "hyperbicycle" ansatz for quantum codes which gives the hypergraph-product (generalized toric) codes by Tillich and Z\'emor and generalized bicycle codes by MacKay et al. as limiting cases. The construction allows for both…
The theory of designs is an important branch of combinatorial mathematics. It is well-known in the theory of designs that a finite subset of a sphere is a tight spherical 1-design if and only if it is a pair of antipodal points. On the…