相关论文: On the Asymptotic Order of Circuit Codes

Let $\Gamma$ denote a distance-regular graph. The maximum size of codewords with minimum distance at least $d$ is denoted by $A(\Gamma,d)$. Let $\square_n$ denote the folded $n$-cube $H(n,2)$. We give an upper bound on $A(\square_n,d)$…

For an oriented link diagram D, the warping degree d(D) is the smallest number of crossing changes which are needed to obtain a monotone diagram from D. We show that d(D)+d(-D)+sr(D) is less than or equal to the crossing number of D, where…

We present an $O(\log d + \log\log_{m/n} n)$-time randomized PRAM algorithm for computing the connected components of an $n$-vertex, $m$-edge undirected graph with maximum component diameter $d$. The algorithm runs on an ARBITRARY CRCW…

We apply the central limit theorem for deriving approximations to the auto-correlation function and power density function (spectrum) of second-order spectral null (dc2-balanced) codes.We show that the auto-correlation function of…

Let $\operatorname{r_{max}}(n,d)$ be the maximum Waring rank for the set of all homogeneous polynomials of degree $d>0$ in $n$ indeterminates with coefficients in an algebraically closed field of characteristic zero. To our knowledge, when…

Let $G$ be a large-girth $d$-regular graph and $\mu$ be a random process on the vertices of $G$ produced by a randomized local algorithm. We prove the upper bound $(k+1-2k/d)\Bigl(\frac{1}{\sqrt{d-1}}\Bigr)^k$ for the (absolute value of…

Using a new general approach to limits in optical structures that counts orthogonal waves generated by scattering, we derive an upper limit to the number of bits of delay possible in one-dimensional slow light structures that are based on…

We consider the degree-diameter problem for Cayley graphs of dihedral groups. We find upper and lower bounds on the maximum number of vertices of such a graph with diameter 2 and degree $d$. We completely determine the asymptotic behaviour…

We study the secure decentralized Pliable Index CODing (PICOD) problem with circular side information sets at the users. The security constraint forbids every user to decode more than one message while a decentralized setting means there is…

Let $d \geq 3$ be a fixed integer. We give an asympotic formula for the expected number of spanning trees in a uniformly random $d$-regular graph with $n$ vertices. (The asymptotics are as $n\to\infty$, restricted to even $n$ if $d$ is…

We prove that for each $k\ge0$, the probability that a root vertex in a random planar graph has degree $k$ tends to a computable constant $d_k$, so that the expected number of vertices of degree $k$ is asymptotically $d_k n$, and moreover…

Improved bounds on the blocklength required to communicate over binary-input channels using polar codes, below some given error probability, are derived. For that purpose, an improved bound on the number of non-polarizing channels is…

In this paper, we present an efficiently encodable and decodable code construction that is capable of correction a burst of deletions of length at most $k$. The redundancy of this code is $\log n + k(k+1)/2\log \log n+c_k$ for some constant…

We compute the limit distribution for (centered and scaled) length of the longest increasing subsequence of random colored permutations. The limit distribution function is a power of that for usual random permutations computed recently by…

We investigate the maximal degree in a Poisson-Delaunay graph in $\mathbf{R}^d$, $d\geq 2$, over all nodes in the window $\mathbf{W}_\rho:= \rho^{1/d}[0,1]^d$ as $\rho$ goes to infinity. The exact order of this maximum is provided in any…

Motivated by the problem of computing the distribution of the largest distance $d_{\max}$ between $n$ random points on a circle we derive an explicit formula for the moments of the maximal component of a random vector following a Dirichlet…

We prove the first $\chi$-bounding function for circle graphs that is optimal up to a constant factor. To be more precise, we prove that every circle graph with clique number at most $\omega$ has chromatic number at most $2\omega \log_2…

Exploiting an iterative formula already introduced in a previous manuscript to count the number $O_d$ of finite $O$-sequences of multiplicity $d$, we obtain some new information about $O_d$. Letting $A_d$ be the number of the finite…

We propose two types of universal codes that are suited to two asymptotic regimes when the output alphabet is possibly continuous. The first class has the property that the error probability decays exponentially fast and we identify an…

Let $\mathcal{\scriptstyle{O}}_K$ be the ring of integers of an imaginary quadratic number field $K$. In this paper we give a new description of the maximal discrete extension of the group $SL_2(\mathcal{\scriptstyle{O}}_K)$ inside…