Search

The main goal of this article is to understand how the length spectrum of a random surface depends on its genus. Here a random surface means a surface obtained by randomly gluing together an even number of triangles carrying a fixed metric. Given suitable restrictions on the genus of the surface, we consider the number of appearances of fixed finite sets of combinatorial types of curves. Of any such set we determine the asymptotics of the probability distribution. It turns out that these distributions are independent of the genus in an appropriate sense. As an application of our results we study the probability distribution of the systole of random surfaces in a hyperbolic and a more general Riemannian setting. In the hyperbolic setting we are able to determine the limit of the probability distribution for the number of triangles tending to infinity and in the Riemannian setting we derive bounds., Comment: 30 pages, 6 figures

In this paper, we give an overview of spatially coupled turbo codes (SC-TCs), the spatial coupling of parallel and serially concatenated convolutional codes, recently introduced by the authors. For presentation purposes, we focus on spatially coupled serially concatenated codes (SC-SCCs). We review the main principles of SC-TCs and discuss their exact density evolution (DE) analysis on the binary erasure channel. We also consider the construction of a family of rate-compatible SC-SCCs with simple 4-state component encoders. For all considered code rates, threshold saturation of the belief propagation (BP) to the maximum a posteriori threshold of the uncoupled ensemble is demonstrated, and it is shown that the BP threshold approaches the Shannon limit as the coupling memory increases. Finally we give some simulation results for finite lengths., Comment: Invited paper, IEEE Int. Symp. Wireless Communications Systems (ISWCS), Aug. 2014

We study the correlations in wave vector space of photon pairs generated by type I spontaneous parametric down conversion using a Gaussian pump beam. We analyze both moderate focused and highly focused regimes taking special attention to the angular spectrum and the conditional angular spectrum. Simple analytic expressions are derived that allow us to study in detail the dependence of these spectra on the waist of the source and the length of the nonlinear crystal. These expressions are in good agreement with numerical expectations and reported experimental results. They are used to make a systematic search of optimization parameters that improve the feasibility of using highly focused Gaussian beams to generate idler and signal photons with predetermined mean values and spread of their transverse wave vectors., Comment: accepted for publication in Journal of Optics (jopt). 8 pages 6 figures

In order to enable simulations of developing wind turbine array boundary layers with highly realistic inflow conditions a concurrent precursor method for Large Eddy Simulations is proposed. In this method we consider two domains simultaneously, i.e. in one domain a turbulent Atmospheric Boundary Layer (ABL) without wind turbines is simulated in order to generate the turbulent inflow conditions for a second domain in which the wind turbines are placed. The benefit of this approach is that a) it avoids the need for large databases in which the turbulent inflow conditions are stored and the correspondingly slow I/O operations and b) we are sure that the simulations are not negatively affected by statically swept fixed inflow fields or synthetic fields lacking the proper ABL coherent structures. Sample applications are presented, in which, in agreement with field data a strong decrease of the power output of downstream wind-turbines with respect to the first row of wind-turbines is observed for perfectly aligned inflow., Comment: 13 pages, 5 figures

In practice, LDPC codes are decoded using message passing methods. These methods offer good performance but tend to converge slowly and sometimes fail to converge and to decode the desired codewords correctly. Recently, tree-reweighted message passing methods have been modified to improve the convergence speed at little or no additional complexity cost. This paper extends this line of work and proposes a new class of locally optimized reweighting strategies, which are suitable for both regular and irregular LDPC codes. The proposed decoding algorithm first splits the factor graph into subgraphs and subsequently performs a local optimization of reweighting parameters. Simulations show that the proposed decoding algorithm significantly outperforms the standard message passing and existing reweighting techniques., Comment: 5 figures, 5 pages

We apply the theory of Groebner bases to the computation of free resolutions over a polynomial ring, the defining equations of a canonically embedded curve, and the unirationality of the moduli space of curves of a fixed genus., Comment: 31 pages, This article consists of extended notes from lectures by the second author at the Joint Introductory Workshop: Cluster Algebras and Commutative Algebra at the Mathematical Science Research Institute (MSRI) in Berkeley, California, in Fall 2012

We extend the notion of effective resistance to metric spaces that are similar to graphs but can also be similar to fractals. Combined with other basic facts proved in the paper, this lays the ground for a construction of Brownian Motion on such spaces completed in [10].

We explore the relationship between polar and RM codes and we describe a coding scheme which improves upon the performance of the standard polar code at practical block lengths. Our starting point is the experimental observation that RM codes have a smaller error probability than polar codes under MAP decoding. This motivates us to introduce a family of codes that "interpolates" between RM and polar codes, call this family ${\mathcal C}_{\rm inter} = \{C_{\alpha} : \alpha \in [0, 1]\}$, where $C_{\alpha} \big |_{\alpha = 1}$ is the original polar code, and $C_{\alpha} \big |_{\alpha = 0}$ is an RM code. Based on numerical observations, we remark that the error probability under MAP decoding is an increasing function of $\alpha$. MAP decoding has in general exponential complexity, but empirically the performance of polar codes at finite block lengths is boosted by moving along the family ${\mathcal C}_{\rm inter}$ even under low-complexity decoding schemes such as, for instance, belief propagation or successive cancellation list decoder. We demonstrate the performance gain via numerical simulations for transmission over the erasure channel as well as the Gaussian channel., Comment: 8 pages, 7 figures, in IEEE Transactions on Communications, 2014 and in ISIT'14

This paper investigates properties of polar codes that can be potentially useful in real-world applications. We start with analyzing the performance of finite-length polar codes over the binary erasure channel (BEC), while assuming belief propagation as the decoding method. We provide a stopping set analysis for the factor graph of polar codes, where we find the size of the minimum stopping set. We also find the girth of the graph for polar codes. Our analysis along with bit error rate (BER) simulations demonstrate that finite-length polar codes show superior error floor performance compared to the conventional capacity-approaching coding techniques. In order to take advantage from this property while avoiding the shortcomings of polar codes, we consider the idea of combining polar codes with other coding schemes. We propose a polar code-based concatenated scheme to be used in Optical Transport Networks (OTNs) as a potential real-world application. Comparing against conventional concatenation techniques for OTNs, we show that the proposed scheme outperforms the existing methods by closing the gap to the capacity while avoiding error floor, and maintaining a low complexity at the same time.

In this paper, we investigate the redundancy of universal coding schemes on smooth parametric sources in the finite-length regime. We derive an upper bound on the probability of the event that a sequence of length $n$, chosen using Jeffreys' prior from the family of parametric sources with $d$ unknown parameters, is compressed with a redundancy smaller than $(1-\epsilon)\frac{d}{2}\log n$ for any $\epsilon>0$. Our results also confirm that for large enough $n$ and $d$, the average minimax redundancy provides a good estimate for the redundancy of most sources. Our result may be used to evaluate the performance of universal source coding schemes on finite-length sequences. Additionally, we precisely characterize the minimax redundancy for two--stage codes. We demonstrate that the two--stage assumption incurs a negligible redundancy especially when the number of source parameters is large. Finally, we show that the redundancy is significant in the compression of small sequences., Comment: accepted in the 2011 IEEE International Symposium on Information Theory (ISIT 2011)

We consider the one-loop quantum corrections to the Nielsen-Olesen flux tube of finite length $L$, by imposing periodic boundary conditions. The calculations are based on a recent evaluation of these quantum corrections to the string tension of an infinite vortex. The finite length corrections are finite from the outset. If the computation is restricted to the zero modes we obtain the standard L\"uscher term $\pi/3L$ for a closed string. The inclusion of the other fluctuation modes of Higgs and gauge fields, using the numerically computed trace of the Euclidian Green's function, leads to corrections that decrease exponentially with $L$. We present numerical results for these corrections, discuss their possible relevance, and the limitations of the approach., Comment: 15 pages, 5 figures

The Poisson-Nernst-Planck (PNP) diffusional model for the immittance or impedance spectroscopy response of an electrolytic cell in a finite-length situation is extended to a general framework. In this new formalism, the bulk behavior of the mobile charges is governed by a fractional diffusion equation in the presence of a reaction term. The solutions have to satisfy a general boundary condition embodying, in a single expression, most of the surface effects commonly encountered in experimental situations. Among these effects, we specifically consider the charge transfer process from an electrolytic cell to the external circuit and the adsorption-desorption phenomenon at the interfaces. The equations are exactly solved in the small AC signal approximation and are used to obtain an exact expression for the electrical impedance as a funcion of the frequency. The predictions of the model are compared to and found to be in good agreement with the experimental data obtained for an electrolytic solution of CdCl2H20., Comment: 5 figures

We predict and study theoretically a new nonlinear electromagnetic phenomenon in a sample of layered superconductor of finite length placed in a waveguide with ideal walls. Two geometries are considered here: when the superconducting layers are parallel or perpendicular to the waveguide axis. We show that the transmittance of the superconductor slab can vary over a wide range, from nearly zero to one, when changing the amplitude of the incident wave. Thus, one can induce the total transmission or reflection of the incident wave by just changing its amplitude. Moreover, the dependence of the superconductor transmittance on the incident wave amplitude has a hysteretic behavior with jumps. The considered phenomenon of self-induced transparency can be observed even at small amplitudes, if the wave frequency $\omega$ is close to the cutoff frequency for linear Josephson plasma waves., Comment: 27 pages, 11 figures, submitted to PRB

The Invertible Bloom Lookup Tables (IBLT) is a data structure which supports insertion, deletion, retrieval and listing operations of the key-value pair. The IBLT can be used to realize efficient set reconciliation for database synchronization. The most notable feature of the IBLT is the complete listing operation of the key-value pairs based on the algorithm similar to the peeling algorithm for low-density generator-matrix (LDGM) codes. In this paper, we will present a stopping set (SS) analysis for the IBLT which reveals finite length behaviors of the listing failure probability. The key of the analysis is enumeration of the number of stopping matrices of given size. We derived a novel recursive formula useful for computationally efficient enumeration. An upper bound on the listing failure probability based on the union bound accurately captures the error floor behaviors. It will be shown that, in the error floor region, the dominant SS have size 2. We propose a simple modification on hash functions, which are called SS avoiding hash functions, for preventing occurrences of the SS of size 2., Comment: 5pages, Submitted to ISIT 2013

Theoretical analysis has long indicated that feedback improves the error exponent but not the capacity of single-user memoryless channels. Recently Polyanskiy et al. studied the benefit of variable-length feedback with termination (VLFT) codes in the non-asymptotic regime. In that work, achievability is based on an infinite length random code and decoding is attempted at every symbol. The coding rate backoff from capacity due to channel dispersion is greatly reduced with feedback, allowing capacity to be approached with surprisingly small expected latency. This paper is mainly concerned with VLFT codes based on finite-length codes and decoding attempts only at certain specified decoding times. The penalties of using a finite block-length $N$ and a sequence of specified decoding times are studied. This paper shows that properly scaling $N$ with the expected latency can achieve the same performance up to constant terms as with $N = \infty$. The penalty introduced by periodic decoding times is a linear term of the interval between decoding times and hence the performance approaches capacity as the expected latency grows if the interval between decoding times grows sub-linearly with the expected latency., Comment: 8 pages. A shorten version is submitted to ISIT 2013

We consider pairs of finite-length individual sequences that are realizations of unknown, finite alphabet, stationary sources in a clas M of sources with vanishing memory (e.g. stationary Markov sources). The task of a universal classifier is to decide whether the two sequences are emerging from the same source or are emerging from two distinct sources in M, and it has to carry this task without any prior knowledge of the two underlying probability measures. Given a fidelity function and a fidelity criterion, the probability of classification error for a given universal classifier is defined. Two universal classifiers are defined for pairs of $N$ -sequence: A "classical" fixed-length (FL) universal classifier and an alternative variable-length (VL) universal classifier. Following Wyner and Ziv (1996) it is demonstrated that if the length of the individual sequences N is smaller than a cut-off value that is determined by the properties of the class M, any universal classifier will fail with high probability . It is demonstrated that for values of N larger than the cut-off rate, the classification error relative to either one of the two classifiers tends to zero as the length of the sequences tends to infinity. However, the probability of classification error that is associated with the variable-length universal classifier is uniformly smaller (or equal) to the one that is associated with the "classical" fixed-length universal classifier, for any finite length.

We study transport properties in a Tomonaga-Luttinger liquid in the presence of two time-dependent point like weak impurities, taking into account finite-length effects. By employing analytical methods and performing a perturbation theory, we compute the backscattering pumping current (I_bs) in different regimes which can be established in relation to the oscillatory frequency of the impurities and to the frequency related to the length and the renormalized velocity (by the electron-electron interactions) of the charge density modes. We investigate the role played by the spatial position of the impurity potentials. We also show how the previous infinite length results for I_bs are modified by the finite size of the system., Comment: 9 pages, 7 figures

Deep inelastic scattering of $\mathcal{R}$-currents and the scattering of a small dipole on finite length hot $\mathcal{N}=4$ SYM matter are discussed. In each case we find the scale when scattering becomes strong is determined by a saturation momentum $Q^2_s \sim LT^3/x$ where $L$ is the length of the matter. For $\mathcal{R}$-currents we analyze the operator product expansion. For infinite length matter the series generated by the OPE is not Borel summable but we are able to determine the exponential part of the tunneling amplitude determining $F_2$ when $\frac{Q^2}{Q^2_s}\gg 1$ from the position of the singularity closest to the origin on the real axis of the Borel plane. In finite length matter the OPE series is not convergent but it is Borel summable. When a small dipole, and the string connecting the ends of the dipole, pass through hot matter there is an induced motion of the string in the $5^{th}$ dimension. When $T^4 L \cosh \eta$, with the $\eta$ the rapidity of the string, is large enough the string would normally break into several parts after leaving the medium, however, this cannot happen in the classical approximation in which we work., Comment: 26 pages

We study one dimensional (1D) carbon ribbons with the armchair edges and the zigzag carbon nanotubes and their counterparts with finite length (0D) in the framework of the H\"{u}ckel model. We prove that a 1D carbon ribbon is metallic if its width (the number of carbon rings) is equal to $2+3n$. We show that the dispersion law (electron band energy) of a 1D metallic ribbon or a 1D metallic carbon nanotube has a universal {\it sin-}like dependence at the Fermi energy which is independent of its width. We find that in case of metallic graphene ribbons of finite length (rectangular graphene macromolecules) or nanotubes of finite length the discrete energy spectrum in the vicinity of $\varepsilon=0$ (Fermi energy) can be obtained exactly by selecting levels from the same dispersion law. In case of a semiconducting graphene macromolecule or a semiconducting nanotube of finite length the positions of energy levels around the energy gap can be approximated with a good accuracy. The electron spectrum of 0D carbon structures often include additional states at energy $\varepsilon=0$, which are localized on zigzag edges and do not contribute to the volume conductivity., Comment: 6 pages, 5 figures

In this work, we study several equivalence relations induced from the partitions of the sets of words of finite length. We have results on words over finite fields extending the work of Bacher (2002, Europ. J. Combinatorics, {\bf 23}, 141-147). Cardinalities of its equivalence classes and explicit relationships between two words are determined. Moreover, we deal with words of finite length over the ring $\mathbb{Z}/N\mathbb{Z}$ where $N$ is a positive integer. We have arithmetic results parallel to Bacher's., Comment: 16 pages