English
Related papers

Related papers: Evaluation of the Gilbert-Varshamov Bound using Mu…

200 papers

Analytic combinatorics in several variables refers to a suite of tools that provide sharp asymptotic estimates for certain combinatorial quantities. In this paper, we apply these tools to determine the Gilbert--Varshamov lower bound on the…

Information Theory · Computer Science 2024-12-30 Keshav Goyal , Duc Tu Dao , Mladen Kovačević , Han Mao Kiah

We revisit the well-known Gilbert-Varshamov (GV) bound for constrained systems. In 1991, Kolesnik and Krachkovsky showed that GV bound can be determined via the solution of some optimization problem. Later, Marcus and Roth (1992) modified…

Information Theory · Computer Science 2024-03-01 Keshav Goyal , Han Mao Kiah

Analytic combinatorics in several variables is a branch of mathematics that deals with deriving the asymptotic behavior of combinatorial quantities by analyzing multivariate generating functions. We study information-theoretic questions…

Information Theory · Computer Science 2025-07-16 Andreas Lenz , Stephen Melczer , Cyrus Rashtchian , Paul H. Siegel

The Gilbert--Varshamov (GV) bound is a central benchmark in coding theory, establishing existential guarantees for error-correcting codes and serving as a baseline for both Hamming and quantum fault-tolerant information processing. Despite…

Information Theory · Computer Science 2026-01-27 Chen Yuan , Ruiqi Zhu

The field of analytic combinatorics is dedicated to the creation of effective techniques to study the large-scale behaviour of combinatorial objects. Although classical results in analytic combinatorics are mainly concerned with univariate…

Combinatorics · Mathematics 2024-04-25 Stephen Melczer , Tiadora Ruza

Mixed level orthogonal arrays are basic structures in experimental design. We develop three algorithms that compute Rao and Gilbert-Varshamov type bounds for mixed level orthogonal arrays. The computational complexity of the terms involved…

Statistics Theory · Mathematics 2009-05-03 Ferruh Ozbudak , Ali Devin Sezer

We improve Gilbert-Varshamov bound by graph spectral method. Gilbert graph $G_{q,n,d}$ is a graph with all vectors in $\mathbb{F}_q^n$ as vertices where two vertices are adjacent if their Hamming distance is less than $d$. In this paper, we…

Information Theory · Computer Science 2023-04-27 Zicheng Ye , Huazi Zhang , Rong Li , Jun Wang , Guiying Yan , Zhiming Ma

The field of analytic combinatorics in several variables (ACSV) develops techniques to compute the asymptotic behaviour of multivariate sequences from analytic properties of their generating functions. When the generating function under…

Combinatorics · Mathematics 2025-04-15 Benjamin Hackl , Andrew Luo , Stephen Melczer , Éric Schost

We introduce the Variational Holder (VH) bound as an alternative to Variational Bayes (VB) for approximate Bayesian inference. Unlike VB which typically involves maximization of a non-convex lower bound with respect to the variational…

Machine Learning · Statistics 2015-06-22 Guillaume Bouchard , Balaji Lakshminarayanan

The field of analytic combinatorics, which studies the asymptotic behaviour of sequences through analytic properties of their generating functions, has led to the development of deep and powerful tools with applications across mathematics…

Combinatorics · Mathematics 2017-09-18 Stephen Melczer

A family of quantum codes of increasing block length with positive rate is asymptotically good if the ratio of its distance to its block length approaches a positive constant. The asymptotic quantum Gilbert-Varshamov (GV) bound states that…

Quantum Physics · Physics 2014-05-02 Yingkai Ouyang

A geometric setup for constrained variational calculus is presented. The analysis deals with the study of the extremals of an action functional defined on piecewise differentiable curves, subject to differentiable, non-holonomic…

Mathematical Physics · Physics 2015-05-08 Enrico Massa , Danilo Bruno , Gianvittorio Luria , Enrico Pagani

We propose a random coding technique for joint source-channel coding of discrete memoryless sources and channels. The approach builds on the random Gilbert-Varshamov code construction of Somekh-Baruch et al. and extends it to the joint…

Information Theory · Computer Science 2026-01-22 AmirPouya Moeini , Albert Guillén i Fàbregas

I present an analytic method for estimating the errors in fitting a distribution. A well-known theorem from statistics gives the minimum variance bound (MVB) for the uncertainty in estimating a set of parameters $\l_i$, when a distribution…

Astrophysics · Physics 2009-10-22 Andrew Gould

The Granular Instrumental Variables (GIV) methodology exploits panels with factor error structures to construct instruments to estimate structural time series models with endogeneity even after controlling for latent factors. We extend the…

Econometrics · Economics 2023-09-26 Saman Banafti , Tae-Hwy Lee

Instrumental variable analysis is a powerful tool for estimating causal effects when randomization or full control of confounders is not possible. The application of standard methods such as 2SLS, GMM, and more recent variants are…

Machine Learning · Statistics 2020-06-08 Andrew Bennett , Nathan Kallus , Tobias Schnabel

This paper studies quantitative deviation bounds for statistical ensembles evolving under the one-parameter flow of a nearly integrable Hamiltonian system. Combining Nekhoroshev-type stability estimates with phase-mixing arguments, we…

Dynamical Systems · Mathematics 2026-02-23 Xinyu Liu , Yong Li

Gromov-Witten invariants of a symplectic manifold are a count of holomorphic curves. We describe a formula expressing the GW invariants of a symplectic sum $X# Y$ in terms of the relative GW invariants of $X$ and $Y$. This formula has…

Geometric Topology · Mathematics 2007-05-23 Eleny-Nicoleta Ionel

This paper analyzes the approximate control variate (ACV) approach to multifidelity uncertainty quantification in the case where weighted estimators are combined to form the components of the ACV. The weighted estimators enable one to…

Computation · Statistics 2024-02-23 Alex A. Gorodetsky , John D. Jakeman , Michael S. Eldred

The asymptotic mutual information (MI) analysis for multiple-input multiple-output (MIMO) systems over double-scattering channels has achieved engaging results, but the convergence rates of the mean, variance, and the distribution of the MI…

Information Theory · Computer Science 2023-01-18 Xin Zhang , Shenghui Song
‹ Prev 1 2 3 10 Next ›