Cover Image

The q-ary Gilbert-Varshamov bound can be improved for all but finitely many positive integers q

Fuente: arXiv

Saved in:

Bibliographic Details
Main Author:	Liang, Xue-Bin
Format:	Preprint
Published:	2024
Subjects:	Combinatorics Discrete Mathematics Information Theory Number Theory
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Evaluating the Gilbert-Varshamov Bound for Constrained Systems
by: Goyal, Keshav, et al.
Published: (2024)

Gilbert-Varshamov Bound for Codes in $L_1$ Metric using Multivariate Analytic Combinatorics
by: Goyal, Keshav, et al.
Published: (2024)

Improving the Gilbert-Varshamov bound for permutation Codes in the Cayley metric and Kendall $τ$-Metric
by: Nguyen, The
Published: (2024)

Constructing $k$-ary Orientable Sequences with Asymptotically Optimal Length
by: Gabrić, Daniel, et al.
Published: (2024)

Some permutation pentanomials over finite fields of even characteristic
by: Kousar, Farhana, et al.
Published: (2024)

Decoding universal cycles for t-subsets and t-multisets by decoding bounded-weight de Bruijn sequences
by: Gabric, Daniel, et al.
Published: (2026)

Christoffel Matrices and Sturmian Determinants
by: Reutenauer, Christophe, et al.
Published: (2024)

The lonely runner conjecture holds for eight runners
by: Rosenfeld, Matthieu
Published: (2025)

A Proof of Bala's General-$m$ Representation of the Harmonic Numbers
by: Niu, Tong
Published: (2026)

The lonely runner conjecture holds for nine runners
by: Rosenfeld, Matthieu
Published: (2025)

Local obstructions in sequences revisited
by: Rosenfeld, Matthieu, et al.
Published: (2025)

On Graham's rearrangement conjecture
by: Pham, Huy Tuan, et al.
Published: (2026)

AG codes have no list-decoding friends: Approaching the generalized Singleton bound requires exponential alphabets
by: Alrabiah, Omar, et al.
Published: (2023)

On the clique number of random Cayley graphs and related topics
by: Conlon, David, et al.
Published: (2024)

Efficient Algorithm for Sparse Fourier Transform of Generalized $q$-ary Functions
by: Tsui, Darin, et al.
Published: (2025)

Permutation and Multi-permutation Codes Correcting Multiple Deletions
by: Wang, Shuche, et al.
Published: (2024)

Improved Upper Bound for the Size of a Trifferent Code
by: Bhandari, Siddharth, et al.
Published: (2024)

Universal cycle constructions for k-subsets and k-multisets
by: Campbell, Colin, et al.
Published: (2026)

Optimal Erasure Codes and Codes on Graphs
by: Chen, Yeyuan, et al.
Published: (2025)

Generalized Three and Four Person Hat Game
by: van Uem, Theo
Published: (2017)

Threshold rates for properties of random codes
by: Guruswami, Venkatesan, et al.
Published: (2020)

Asymptotic Rate Bounds and Constructions for the Inclusive Variant of Disjunct Matrices
by: Mizunuma, Yuto, et al.
Published: (2026)

The Labeled Coupon Collector Problem
by: Tan, Andrew, et al.
Published: (2025)

Reconstructing graphs with subgraph compositions
by: Dailly, Antoine, et al.
Published: (2025)

On Average Distance, Level-1 Fourier Weight, and Chang's Lemma
by: Yu, Lei
Published: (2025)

On the Codebook Design for NOMA Schemes from Bent Functions
by: Li, Chunlei, et al.
Published: (2025)

Optimal Repair Bandwidth and Repair I/O of $(n,n-2,2)$ MDS Array Codes
by: Wu, Huawei
Published: (2026)

On partitions into squares of distinct integers whose reciprocals sum to 1
by: Alekseyev, Max A.
Published: (2018)

Consecutive Power Occurrences in Sturmian Words
by: Bell, Jason, et al.
Published: (2024)

Brik's sequence: a strange recursion
by: Shallit, Jeffrey
Published: (2026)

Complexity of Linear Subsequences of $k$-Automatic Sequences
by: Moradi, Delaram, et al.
Published: (2025)

Balanced Fibonacci word rectangles, and beyond
by: Shallit, Jeffrey, et al.
Published: (2025)

The Hurt-Sada Array and Zeckendorf Representations
by: Shallit, Jeffrey
Published: (2025)

Cloitre's Self-Generating Sequence
by: Shallit, Jeffrey
Published: (2025)

The Narayana Morphism and Related Words
by: Shallit, Jeffrey
Published: (2025)

Convolutive sequences, I: Through the lens of integer partition functions
by: Chern, Shane, et al.
Published: (2025)

The capacity of a finite field matrix channel
by: Blackburn, Simon R., et al.
Published: (2022)

Smoothed Analysis of the Komlós Conjecture: Rademacher Noise
by: Aigner-Horev, Elad, et al.
Published: (2023)

The maximal hard-core model as a recoverable system: Gibbs measures and phase coexistence
by: Wang, Geyang, et al.
Published: (2025)

Recoverable systems and the maximal hard-core model on the triangular lattice
by: Wang, Geyang, et al.
Published: (2026)