Related papers: On Gauss codes of virtual doodles
We show that there are good long binary generalized quasi-cyclic self-dual (either Type I or Type II) codes.
In this paper, we show some applications of algebraic curves to the construction of kernels of polar codes over a discrete memoryless channel which is symmetric w.r.t the field operations. We will also study the minimum distance of the…
A classic application of description length is for model selection with the minimum description length (MDL) principle. The focus of this paper is to extend description length for data analysis beyond simple model selection and sequences of…
In this paper, we first generalize the class of linear codes by Ding and Ding (IEEE TIT, 61(11), pp. 5835-5842, 2015). Then we mainly study the augmented codes of this generalized class of linear codes. For one thing, we use Gaussian sums…
We show that (n,2^n) additive codes over GF(4) can be represented as directed graphs. This generalizes earlier results on self-dual additive codes over GF(4), which correspond to undirected graphs. Graph representation reduces the…
The hypergraph product (HGP) is a famous code construction technique with an equally famous canonical visualisation. This visual perspective provides much more than simply a way to build intuition: HGP codes can be defined graphically,…
We extend the quandle cocycle invariant to oriented singular knots and links using algebraic structures called \emph{oriented singquandles} and assigning weight functions at both regular and singular crossings. This invariant coincides with…
A novel construction of polar codes with dynamic frozen symbols is proposed. The proposed codes are subcodes of extended BCH codes, which ensure sufficiently high minimum distance. Furthermore, a decoding algorithm is proposed, which…
We begin with the characterization of quantum graphs as left ideals in $\mathcal M \otimes_{eh} \mathcal M$ (the extended Haagerup tensor product of $\mathcal M$ with itself) to avoid technicalities surrounding representation dependence of…
We compute the virtual cohomological dimension (VCD) of the group of partially symmetric outer automorphisms of a free group. We use this to obtain new upper and lower bounds on the VCD of the outer automorphism group of a two-dimensional…
Two natural generalizations of knot theory are the study of spatially embedded graphs, and Kauffman's theory of virtual knots. In this paper we combine these approaches to begin the study of virtual spatial graphs.
Virtual racks and virtual quandles are nonassociative algebraic structures based on the Reidemeister moves of virtual knots. In this note, we enumerate virtual dihedral quandles and several families of virtual permutation racks and virtual…
A voltage graph is a finite directed graph whose edges are labeled by elements of a finite group $G$. A classical construction of Gross and Tucker associates to every voltage graph with vertex set $V$ a so-called derived graph with vertex…
Some remarks are made about free anomaly groups in gauged WZW models. Considering a quite general action, anomaly cancellation is analyzed. The possibility of gauging left and right sectors independently in some cases is remarked. In…
The codeword stabilized ("CWS") quantum codes formalism presents a unifying approach to both additive and nonadditive quantum error-correcting codes (arXiv:0708.1021). This formalism reduces the problem of constructing such quantum codes to…
Detailed information about the weight distribution of a convolutional code is given by the adjacency matrix of the state diagram associated with a controller canonical form of the code. We will show that this matrix is an invariant of the…
The present paper produces examples of Gauss diagram formulae for virtual knot invariants which have no analogue in the classical knot case. These combinatorial formulae contain additional information about how a subdiagram is embedded in a…
In this paper, we construct new families of convolutional codes. Such codes are obtained by means of algebraic geometry codes. Additionally, more families of convolutional codes are constructed by means of puncturing, extending, expanding…
We present some basic theory on the duality of codes over two non-unital rings of order $6$, namely $H_{23}$ and $H_{32}$. For a code $\mathcal{C}$ over these rings, we associate a binary code $\mathcal{C}_a$ and a ternary code…
We suggest an invariant way to enumerate nodal and nodal-cuspidal real deformations of real plane curve singularities. The key idea is to assign Welschinger signs to the counted deformations. Our invariants can be viewed as a local version…