Related papers: Cyclic Group Projection for Enumerating Quasi-Cycl…
Aussel et al. (J Optim Theory Appl 170 818-837 2016) introduced the concept of projected solutions for the quasi-variational inequalities with a non-self constraint map, that is, the case where the constraint map may take values outside the…
Families of regimes for discrete control systems are studied possessing a special quasi-controllability property that is similar to the Kalman controllability property. A new approach is proposed to estimate the amplitudes of transient…
Generalized quasi-cyclic (GQC) codes with arbitrary lengths over the ring $\mathbb{F}_{q}+u\mathbb{F}_{q}$, where $u^2=0$, $q=p^n$, $n$ a positive integer and $p$ a prime number, are investigated. By the Chinese Remainder Theorem,…
A model for quantum tunnelling of a cluster comprising A identical particles, coupled by oscillator-type potential, through short-range repulsive potential barriers is introduced for the first time in the new symmetrized-coordinate…
Based on cyclic and consta-cyclic simplex codes, a new explicit construction of a family of two-weight codes is presented. These two-weight codes obtained are in the form of 2-generator quasi-cyclic, or quasi-twisted structure. Based on…
We describe general methods for enumerating subsemigroups of finite semigroups and techniques to improve the algorithmic efficiency of the calculations. As a particular application we use our algorithms to enumerate all transformation…
We propose a framework for constructing efficient code-based encryption schemes from codes that do not hide any structure in their public matrix. The framework is in the spirit of the schemes first proposed by Alekhnovich in 2003 and based…
Most of the world's digital data is currently encoded in a sequential form, and compression methods for sequences have been studied extensively. However, there are many types of non-sequential data for which good compression techniques are…
Cyclic codes are an important class of linear codes, whose weight distribution have been extensively studied. So far, most of previous results obtained were for cyclic codes with no more than three zeros. Recently, \cite{Y-X-D12}…
A new lower bound on the minimum Hamming distance of linear quasi-cyclic codes over finite fields is proposed. It is based on spectral analysis and generalizes the Semenov- Trifonov bound in a similar way as the Hartmann-Tzeng bound extends…
Recent algorithmic advances in algebraic automata theory drew attention to semigroupoids (semicategories). These are mathematical descriptions of typed computational processes, but they have not been studied systematically in the context of…
Model sets (or cut and project sets) provide a familiar and commonly used method of constructing and studying nonperiodic point sets. Here we extend this method to situations where the internal spaces are no longer Euclidean, but instead…
We present a unified theoretical and computational framework that bridges mathematical quasiperiodicity with classical crystallographic models. Based on a rigorous cut-and-projection construction, the proposed proximal coincidence point set…
We introduce sparse polynomial zonotopes, a new set representation for formal verification of hybrid systems. Sparse polynomial zonotopes can represent non-convex sets and are generalizations of zonotopes, polytopes, and Taylor models.…
This paper introduces hierarchical quasi-clustering methods, a generalization of hierarchical clustering for asymmetric networks where the output structure preserves the asymmetry of the input data. We show that this output structure is…
The permutation groups of cyclic codes are widely applicable in determining the weight distribution of codes, decoding theory and various other areas. In this paper, by employing two distinct matrix representations, we can relate cyclic…
In this paper, we propose a quasigroup based block cipher design. The round functions of the encryption and decryption algorithms use quasigroup based string transformations. We show the robustness of the design against the standard…
The architecture of infinite structures with non-crystallographic symmetries can be modeled via aperiodic tilings, but a systematic construction method for finite structures with non-crystallographic symmetry at different radial levels is…
We develop the theory of coregular sequences and codepth for modules that need not be finitely generated or artinian over a Noetherian ring. We use this theory to give a new version of a theorem of Hellus characterizing set-theoretic…
The determination of weight distribution of cyclic codes involves evaluation of Gauss sums and exponential sums. Despite of some cases where a neat expression is available, the computation is generally rather complicated. In this note, we…