Related papers: Abelian Noncyclic Orbit Codes and Multishot Subspa…
The structure of multivariate semisimple codes over a finite chain ring $R$ is established using the structure of the residue field $\bar R$. Multivariate codes extend in a natural way the univariate cyclic and negacyclic codes and include…
This paper is devoted to study the limit cycle problem of a cubic reversible system with an isochronous center, when it is perturbed inside a class of polynomials. An upper bound of the number of limit cycles is obtained using the Abelian…
We construct quantum error-correcting codes that embed a finite-dimensional code space in the infinite-dimensional Hilbert state space of rotational states of a rigid body. These codes, which protect against both drift in the body's…
Fix an abelian variety $A_0$ and a non-isotrivial abelian scheme over a smooth irreducible curve, both defined over the algebraic numbers. Consider the union of all images of translates of a fixed finite-rank subgroup of $A_0$, also defined…
It has been shown that good structured codes over non-Abelian groups do exist. Specifically, we construct codes over the smallest non-Abelian group $\mathds{D}_6$ and show that the performance of these codes is superior to the performance…
We investigate algorithms for encoding of one-point algebraic geometry (AG) codes over certain plane curves called $C_{ab}$ curves, as well as algorithms for inverting the encoding map, which we call "unencoding". Some $C_{ab}$ curves have…
The monomial codes over a Galois field F_q that can be thought invariant subspaces are essential to us in this study. More specifically, we look into the link between monomial codes and characteristic subspaces and the decomposition of…
This paper is a general survey of literature on Goppa-type codes from higher dimensional algebraic varieties. The construction and several techniques for estimating the minimum distance are described first. Codes from various classes of…
Subspace codes are the $q$-analog of binary block codes in the Hamming metric. Here the codewords are vector spaces over a finite field. They have e.g. applications in random linear network coding, distributed storage, and cryptography. In…
Irreducible cyclic codes are an interesting type of codes and have applications in space communications. They have been studied for decades and a lot of progress has been made. The objectives of this paper are to survey and extend earlier…
We express Alltop's construction of mutually unbiased bases as orbits under the Weyl-Heisenberg group in prime dimensions and find a related construction in dimensions 2 and 4. We reproduce Alltop's mutually unbiased bases using abelian…
I propose that non-Abelian topological order can emerge from the organization of quantum particles into identical indistinguishable copies of the same quantum many-body state. Quantum indistinguishability (symmetrization) of the…
Linear complementary dual (LCD) cyclic codes were referred historically to as reversible cyclic codes, which had applications in data storage. Due to a newly discovered application in cryptography, there has been renewed interest in LCD…
Connected branches of periodic orbits originating at a Hopf bifurcation point of a differential system are considered. A computable estimate for the range of amplitudes of periodic orbits contained in the branch is provided under the…
We introduce and explore a new concept of evasive subspace with respect to a collection of subspaces sharing a common dimension, most notably partial spreads. We show that this concept generalises known notions of subspace scatteredness and…
We study orbit codes in the field extension ${\mathbb F}_{q^n}$. First we show that the automorphism group of a cyclic orbit code is contained in the normalizer of the Singer subgroup if the orbit is generated by a subspace that is not…
The order bound for the minimum distance of algebraic geometry codes was originally defined for the duals of one-point codes and later generalized for arbitrary algebraic geometry codes. Another bound of order type for the minimum distance…
Polar codes are constructed for arbitrary channels by imposing an arbitrary quasigroup structure on the input alphabet. Just as with "usual" polar codes, the block error probability under successive cancellation decoding is…
Riemannian geodesic orbit spaces (G/H,g) are natural generalizations of symmetric spaces, defined by the property that their geodesics are orbits of one-parameter subgroups of G. We study the geodesic orbit spaces of the form (G/S,g), where…
In the realm of algebraic geometric (AG) codes, characterizing dual codes has long been a challenging task. In this paper we introduces a generalized criterion to characterize self-orthogonality of AG codes based on residues, drawing upon…