Related papers: Improved Spectral Bound for Quasi-Cyclic Codes
A new approach for upper bounding the channel reliability function using the code spectrum is described. It allows to treat in a unified way both a low and a high rate cases. In particular, the earlier known upper bounds are improved, and a…
Subspace codes, especially cyclic constant subspace codes, are of great use in random network coding. Subspace codes can be constructed by subspaces and subspace polynomials. In particular, many researchers are keen to find special…
Using a sum rule, we derive new bounds on Herglotz functions that generalize those given in (Gustafson and Sj\"oberg 2010) and (Bernland, Luger and Gustafson 2011). These bounds apply to a wide class of linear passive systems such as…
Self-orthogonal $J$-affine variety codes have been successfully used to obtain quantum stabilizer codes with excellent parameters. In a previous paper we gave formulae for the dimension of this family of quantum codes, but no bound for the…
Circuit codes are constructed from induced cycles in the graph of the $n$ dimensional hypercube. They are both theoretically and practically important, as circuit codes can be used as error correcting codes. When constructing circuit codes,…
We describe a general method for turning quantum circuits into sparse quantum subsystem codes. The idea is to turn each circuit element into a set of low-weight gauge generators that enforce the input-output relations of that circuit…
We study a notion of "width" for Jordan curves in $\mathbb{CP}^1$, paying special attention to the class of quasicircles. The width of a Jordan curve is defined in terms of the geometry of its convex hull in hyperbolic three-space. A…
Introducing an axis of reflectional symmetry in a quasicrystal leads to the creation of localised edge modes that can be used to build waveguides. We develop theory that characterises reflection-induced localised modes in materials that are…
We prove a new bound for the minimum distance of geometric Goppa codes that generalizes two previous improved bounds. We include examples of the bound to one and two point codes over both the Suzuki and Hermitian curves.
The applications of additive codes mainly lie in quantum error correction and quantum computing. Due to their applications in quantum codes, additive codes have grown in importance. In addition to this, additive codes allow the…
A lower bound on minimum distance of convolutional polar codes is provided. The bound is obtained from the minimum weight of generalized cosets of the codes generated by bottom rows of the polarizing matrix. Moreover, a construction of…
In this paper we study the structure of $\theta$-cyclic codes over the ring $B_k$ including its connection to quasi-$\tilde{\theta}$-cyclic codes over finite field $\mathbb{F}_{p^r}$ and skew polynomial rings over $B_k.$ We also…
We obtain new upper and lower bounds on the number of unit perimeter triangles spanned by points in the plane. We also establish improved bounds in the special case where the point set is a section of the integer grid.
Cyclic codes over finite fields are widely employed in communication systems, storage devices and consumer electronics, as they have efficient encoding and decoding algorithms. BCH codes, as a special subclass of cyclic codes, are in most…
Maximum distance separable (MDS) codes are very important in both theory and practice. There is a classical construction of a family of $[2^m+1, 2u-1, 2^m-2u+3]$ MDS codes for $1 \leq u \leq 2^{m-1}$, which are cyclic, reversible and BCH…
We study a class of quasi-cyclic LDPC codes. We provide precise conditions guaranteeing high girth in their Tanner graph. Experimentally, the codes we propose perform no worse than random LDPC codes with their same parameters, which is a…
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…
A subspace of a finite field is called a Sidon space if the product of any two of its nonzero elements is unique up to a scalar multiplier from the base field. Sidon spaces, introduced by Roth et al. (IEEE Trans Inf Theory 64(6): 4412-4422,…
Long quasi-cyclic codes of any fixed index $>1$ have been shown to be asymptotically good, depending on Artin primitive root conjecture in (A. Alahmadi, C. G\"uneri, H. Shoaib, P. Sol\'e, 2017). We use this recent result to construct good…
In the present article, we consider Algebraic Geometry codes on some rational surfaces. The estimate of the minimum distance is translated into a point counting problem on plane curves. This problem is solved by applying the upper bound…