Related papers: Pl\"ucker Embedding of Cyclic Orbit Codes
We present an optimal method for encoding cluster assignments of arbitrary data sets. Our method, Random Cycle Coding (RCC), encodes data sequentially and sends assignment information as cycles of the permutation defined by the order of…
In this paper, we describe linear and cyclic codes over the rings of the form $R_{s,p}=\mathbb{Z}_{p}[u]/\left( f\left(u\right) /\left( u-s\right) \right)$, where $p$ is a prime number and $f\left( u\right) =u^{p}-u$, with $s\in…
Polar Grassmann codes of orthogonal type have been introduced in I. Cardinali and L. Giuzzi, \emph{Codes and caps from orthogonal Grassmannians}, {Finite Fields Appl.} {\bf 24} (2013), 148-169. They are subcodes of the Grassmann code…
Two generalizations of the Hartmann--Tzeng (HT) bound on the minimum distance of q-ary cyclic codes are proposed. The first one is proven by embedding the given cyclic code into a cyclic product code. Furthermore, we show that unique…
This paper considers cyclic DNA codes of arbitrary length over the ring $R=\F_2[u]/u^4-1$. A mapping is given between the elements of $R$ and the alphabet $\{A,C,G,T\}$ which allows the additive stem distance to be extended to this ring.…
In this paper we introduce the class of Spread Codes for the use in random network coding. Spread Codes are based on the construction of spreads in finite projective geometry. The major contribution of the paper is an efficient decoding…
Random network coding recently attracts attention as a technique to disseminate information in a network. This paper considers a non-coherent multi-shot network, where the unknown and time-variant network is used several times. In order to…
Let $\texttt{R}$ be a commutative finite chain ring of invariants $(q,s)$ and $\Gamma(\texttt{R})$ the Teichm\"uller's set of $\texttt{R}.$ In this paper, the trace representation cyclic $\texttt{R}$-linear codes of length $\ell,$ is…
Dynamic unary encoding takes unary encoding to the next level. Every n-bit binary string is an encoding of dynamic unary and every n-bit binary string is encodable by dynamic unary. By utilizing both forms of unary code and a single bit of…
We propose a novel encoding scheme for algebraic codes such as codes on algebraic curves, multidimensional cyclic codes, and hyperbolic cascaded Reed-Solomon codes and present numerical examples. We employ the recurrence from the Gr\"obner…
Although there are very algorithms for embedding graphs on unbounded grids, only few results on embedding or drawing graphs on restricted grids has been published. In this work, we consider the problem of embedding paths and cycles on grid…
Orbits of graphs under local complementation (LC) and edge local complementation (ELC) have been studied in several different contexts. For instance, there are connections between orbits of graphs and error-correcting codes. We define a new…
Given a quantum error correcting code, an important task is to find encoded operations that can be implemented efficiently and fault-tolerantly. In this Letter we focus on topological stabilizer codes and encoded unitary gates that can be…
In this article, we study the skew cyclic codes over R_{k}=F_{p}+uF_{p}+\dots +u^{k-1}F_{p} of length n. We characterize the skew cyclic codes of length $n$ over R_{k} as free left R_{k}[x;\theta]-submodules of R_{k}[x;\theta]/\langle…
In this paper we characterize the orbit codes as geometrically uniform codes. This characterization is based on the description of all isometries over a projective geometry. In addition, the Abelian orbit codes are defined and a 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…
Cyclic codes and their various generalizations, such as quasi-twisted (QT) codes, have a special place in algebraic coding theory. Among other things, many of the best-known or optimal codes have been obtained from these classes. In this…
Orbit harmonics is a tool in combinatorial representation theory which promotes the (ungraded) action of a linear group $G$ on a finite set $X$ to a graded action of $G$ on a polynomial ring quotient by viewing $X$ as a $G$-stable point…
The purpose of this paper is to study the cyclic self orthogonal codes over $\mathbb{Z}_{p^m}$. After providing the generator polynomial of cyclic self orthogonal codes over $\mathbb{Z}_{p^m}$, we give the necessary and sufficient condition…
In his Ph.D. disseration, Feldman and his collaborators define the linear programming decoder for binary linear codes, which is a linear programming relaxation of the maximum-likelihood decoding problem. This decoder does not, in general,…