Related papers: Quasi-optimal cyclic orbit codes

Subspace codes, and in particular cyclic subspace codes, have gained significant attention in recent years due to their applications in error correction for random network coding. In this paper, we introduce a new technique for constructing…

We introduce a class of cyclic quantum codes, basing the construction not on the simplicity of the stabilizers, but rather on the simplicity of preparation of a code state (at least in the absence of noise). We show how certain known codes,…

We establish new results and introduce new methods in the theory of measurable orbit equivalence, using bounded cohomology of group representations. Our rigidity statements hold for a wide (uncountable) class of groups arising from negative…

Two given orbits of a minimal circle homeomorphism $f$ are said to be geometrically equivalent if there exists a quasisymmetric circle homeomorphism identifying both orbits and commuting with $f$. By a well-known theorem due to Herman and…

We give quantitative bounds for the number of quasi-integral points in orbits of semigroups of rational maps under some conditions, generalizing previous work of L. C. Hsia and J. Silverman (2011) for orbits generated by the iterations of…

In this paper, we mainly study quaternary linear codes and their binary subfield codes. First we obtain a general explicit relationship between quaternary linear codes and their binary subfield codes in terms of generator matrices and…

Spectral bounds form a powerful tool to estimate the minimum distances of quasi-cyclic codes. They generalize the defining set bounds of cyclic codes to those of quasi-cyclic codes. Based on the eigenvalues of quasi-cyclic codes and the…

In Part I, the present authors introduced the notion of a quasi-Galois point, for investigating the automorphism groups of plane curves. In this second part, the number of quasi-Galois points for smooth plane curves is described. In…

We consider quasi-perfect codes in $\mathbb{Z}^n$ over the $\ell_p$ metric, $2 \leq p < \infty$. Through a computational approach, we determine all radii for which there are linear quasi-perfect codes for $p = 2$ and $n = 2, 3$. Moreover,…

We introduce the concept of 2-cyclicity for families of one-dimensional maps with a non-hyperbolic fixed point by analogy to the cyclicity for families of planar vector fields with a weak focus. This new concept is useful in order to study…

Constacyclic codes are important classes of linear codes that have been applied to the construction of quantum codes. Six new families of asymmetric quantum codes derived from constacyclic codes are constructed in this paper. Moreover, the…

Let $G:= (C^*)^k\times SL_2(C)$ act linearly on a vector space or its projectivisation. We obtain an effective criterion to detect whether a number of orbits in an orbit-closure is finite or not.

We establish necessary and sufficient conditions for the realization of mapping schemata as post-critically finite polynomials, or more generally, as post-critically finite polynomial maps from a finite union of copies of the complex…

We introduce a definition of perfect and quasi-perfect codes for symmetric channels parametrized by an auxiliary output distribution. This notion generalizes previous definitions of perfect and quasi-perfect codes and encompasses maximum…

The groups QF, QT, and QV are groups of quasi-automorphisms of the infinite binary tree. Their names indicate a similarity with Thompson's well-known groups F, T, and V. We will use the theory of diagram groups over semigroup presentations…

We investigate the notion of cyclicity for convolutional codes as it has been introduced by Piret and Roos in the seventies. Codes of this type are described as submodules of the module of all vector polynomials in one variable with some…

Let K be a cyclic Galois extension of degree f over k and T a generator of the Galois group. For any v=(v_1,... , v_m)\in K^m such that v is linearly independent over k, and any 0< d < m the Gabidulin-like code C(v, T , d) is a maximum rank…

This work analyses types of group actions on families of $t$-dependent vector fields of a particular class, the hereby called quasi-Lie families. We devise methods to obtain the defined here quasi-Lie invariants, namely a kind of functions…

In this paper, we construct several infinite families of $q$-ary constacyclic codes over a finite field $\mathbb{F}_q$ with length $n$, dimension around $n/2$, and minimum distance at least $cn/\log_q n$ for some positive constant $c$. They…

A code is said to be two-weight if the non-zero codewords have only two different a weight w1 and w2. Two-weight codes are closely related to strongly regular graphs. In this paper. It is shown that a consta-cyclic code of composite length…