Related papers: Toric surface codes and Minkowski length of polygo…
Partial spread is important in finite geometry and can be used to construct linear codes. From the results in (Designs, Codes and Cryptography 90:1-15, 2022) by Xia Li, Qin Yue and Deng Tang, we know that if the number of the elements in a…
In this paper, we introduce the so-called $L_p$ $q$-torsional measure for $p\in\mathbb{R}$ and $q>1$ by establishing the $L_p$ variational formula for the $q$-torsional rigidity of convex bodies without smoothness conditions. Moreover, we…
We give a lower bound on the number of non-simple closed curves on a hyperbolic surface, given upper bounds on both length and self-intersection number. In particular, we carefully show how to construct closed geodesics on pairs of pants,…
We define a statistical measure of the typical size of short words in a linear code over a finite field. We prove that the dual toric codes coming from polytopes of degree one are characterized, among all dual toric codes, by being extremal…
This paper was submitted to the Oberwolfach Conference "Combinatorial Convexity and Algebraic Geometry", October 1997. Let $M={\mathbb Z}^r$. For convex lattice polytopes $P,P'$ in ${\mathbb R}^r$, when is $(M \cap P)+ (M \cap P') = M \cap…
We investigate degree bounds for fields of rational invariants of representations of finite groups. We prove many cases of a bound for $\mathbb{Z}/p\mathbb{Z}$ conjectured by Blum-Smith, Garcia, Hidalgo, and Rodriguez. For arbitrary groups,…
The Orlicz-Brunn-Minkowski theory receives considerable attention recently, and many results in the $L_p$-Brunn-Minkowski theory have been extended to their Orlicz counterparts. The aim of this paper is to develop Orlicz $L_{\phi}$ affine…
In this paper convolutional codes with cyclic structure will be investigated. These codes can be understood as left principal ideals in a suitable skew-polynomial ring. It has been shown in [3] that only certain combinations of the…
In this paper we use the Ekeland-Hofer-Zehnder symplectic capacity to provide several bounds and inequalities for the length of the shortest periodic billiard trajectory in a smooth convex body in ${\mathbb R}^{n}$. Our results hold both…
In this paper we present several classes of asymptotically good concatenated quantum codes and derive lower bounds on the minimum distance and rate of the codes. We compare these bounds with the best-known bound of…
This survey is an introduction to the geometry of co-Minkowksi space, the space of unoriented spacelike hyperplanes of the Minkowski space. Affine deformations of cocompact lattices of hyperbolic isometries act on it, in a way similar to…
In this paper, we propose a topology optimization (TO) framework where the design is parameterized by a set of convex polygons. Extending feature mapping methods in TO, the representation allows for direct extraction of the geometry. In…
The lattice diameter of a bounded set $S \subset \mathbb{R}^d$ measures the maximal number of lattice points in a segment whose endpoints are lattice points in $S$. Such a segment is called a lattice diameter segment of $S$. This simple…
In this paper, we deal with the successive inner and outer radii with respect to Orlicz Minkowski sum. The upper and lower bounds for the radii of the Orlicz Minkowski sum of two convex bodies are established.
This paper addresses the issue of design of low-rate sparse-graph codes with linear minimum distance in the blocklength. First, we define a necessary condition which needs to be satisfied when the linear minimum distance is to be ensured.…
Dihedral codes, particular cases of quasi-cyclic codes, have a nice algebraic structure which allows to store them efficiently. In this paper, we investigate it and prove some lower bounds on their dimension and minimum distance, in analogy…
We consider a special family of SC-LDPC codes, that is, time-invariant LDPCC codes, which are known in the literature for a long time. Codes of this kind are usually designed by starting from QC block codes, and applying suitable unwrapping…
We adapt work of Kirby-Thompson and Zupan to define an integer invariant $\mathcal{L}(\mathcal{T})$ of a bridge trisection $\mathcal{T}$ of a smooth surface $\mathcal{K}$ in $S^4$ or $B^4$. We show that when $\mathcal{L}(\mathcal{T})=0$,…
While there is extensive literature on approximation of convex bodies by inscribed or circumscribed polytopes, much less is known in the case of generally positioned polytopes. Here we give upper and lower bounds for approximation of convex…
We rigorously state the connection between the EHZ-capacity of convex Lagrangian products $K\times T\subset\mathbb{R}^n\times\mathbb{R}^n$ and the minimal length of closed $(K,T)$-Minkowski billiard trajectories. This connection was made…