Related papers: Quasi-optimal cyclic orbit codes
We calculate numerically the periodic orbits of pseudointegrable systems of low genus numbers $g$ that arise from rectangular systems with one or two salient corners. From the periodic orbits, we calculate the spectral rigidity…
This paper considers a linear quasi-cyclic product code of two given quasi-cyclic codes of relatively prime lengths over finite fields. We give the spectral analysis of a quasi-cyclic product code in terms of the spectral analysis of the…
Coding theory and combinatorial $t$-designs have close connections and interesting interplay. One of the major approaches to the construction of combinatorial t-designs is the employment of error-correcting codes. As we all known, some…
We construct a class of three-Lee-weight and two infinite families of five-Lee-weight codes over the ring $R=\mathbb{F}_2 +v\mathbb{F}_2 +v^2\mathbb{F}_2 +v^3\mathbb{F}_2 +v^4\mathbb{F}_2,$ where $v^5=1.$ The same ring occurs in the quintic…
Consider the action of a connected complex reductive group on a finite-dimensional vector space. A fundamental result in invariant theory states that the orbit closure of a vector v is separated from the origin if and only if some…
It is reasonable to expect the theory of quantum codes to be simplified in the case of codes of minimum distance 2; thus, it makes sense to examine such codes in the hopes that techniques that prove effective there will generalize. With…
We investigate the properties of binary linear codes of even length whose permutation automorphism group is a cyclic group generated by an involution. Up to dimension or co-dimension $4$, we show that there is no quasi group code whose…
We numerically study quasiperiodic normally hyperbolic attracting invariant circles that appear for certain parameter values in a family of three-dimensional Henon-like maps. These parameter values make up contour segments in the parameter…
Nearly perfect packing codes are those codes that meet the Johnson upper bound on the size of error-correcting codes. This bound is an improvement to the sphere-packing bound. A related bound for covering codes is known as the van Wee…
We develop a quasisymmetric analogue of the theory of Schubert cycles, building off of our previous work on a quasisymmetric analogue of Schubert polynomials and divided differences. Our constructions result in a natural geometric…
Due to their efficient encoding and decoding algorithms cyclic codes, a subclass of linear codes, have applications in consumer electronics, data storage systems, and communication systems. In this paper, Dickson polynomials of the first…
We construct quasi-isometry invariants of a one-ended finitely presented group by considering the tree of cylinders of a two-ended JSJ decomposition of the group. When the group satisfies additional quasi-isometric rigidity hypotheses we…
Recently, a new algorithm to test equivalence of two cyclic codes has been introduced which is efficient and produced useful results. In this work, we generalize this algorithm to constacyclic codes. As an application of the algorithm we…
We describe and present a new construction method for codes using encodings from group rings. They consist primarily of two types: zero-divisor and unit-derived codes. Previous codes from group rings focused on ideals; for example cyclic…
Dihedral codes, particular cases of quasi-cyclic codes, have a nice algebraic structure which allows to store them efficiently. In this paper, we investigate it and prove some lower bounds on their dimension and minimum distance, in analogy…
Let $p$ be a prime integer, $n,s\geq 2$ be integers satisfying ${\rm gcd}(p,n)=1$, and denote $R=\mathbb{Z}_{p^s}[v]/\langle v^2-pv\rangle$. Then $R$ is a local non-principal ideal ring of $p^{2s}$ elements. First, the structure of any…
The study of optical orthogonal codes has been motivated by an application in an optical code-division multiple access system. This paper focuses on optimal two-dimensional optical orthogonal codes with autocorrelation and cross-correlation…
We introduce a generalization of the notion of approximately proper equivalence relations studied by Renault and with it we build an \'etale groupoid. Choosing a suitable set of continuous functions to play the role of a potential, we…
Let $G$ be an algebraic group and let $X$ be a smooth $G$-variety with two orbits: an open orbit and a a closed orbit of codimension $1$. We give an algebraic description of the category of $G$-equivariant vector bundles on $X$ under a mild…
We consider optimal route planning when the objective function is a general nonlinear and non-monotonic function. Such an objective models user behavior more accurately, for example, when a user is risk-averse, or the utility function needs…