Skip to search formSkip to main contentSkip to account menu

Gilbert–Varshamov bound

Known as: Gilbert-Varshamov bound, Gilbert-Shannon-Varshamov bound, GV bound 
In coding theory, the Gilbert–Varshamov bound (due to Edgar Gilbert and independently Rom Varshamov) is a limit on the parameters of a (not… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2020
2020
We construct a class of $\mathbb {Z}_{p}\mathbb {Z}_{p^{s}}$-additive cyclic codes generated by pairs of polynomials, where p is… 
2017
2017
The subblock energy-constrained codes (SECCs) have recently been shown to be suitable candidates for simultaneous energy and… 
2007
2007
An explicit construction for nonbinary quantum Goppa codes exceeding the quantum Gilbert-Varshamov bound is given. First, we… 
2006
2006
The Gilbert-Varshamov bound states that the maximum size A<sub>2 </sub>(n,d) of a binary code of length n and minimum distance d… 
2001
2001
In this paper we derive a Gilbert-Varshamov type bound for linear codes over Galois rings GR(pl; j): However, this bound does not… 
1997
1997
Abstract. We obtain some improved net parameters via use of the Gilbert-Varshamov coding theory bound. 
1991
1991
Pieris rapae (L.) an important pest of cole crops in the northeastern United States, is susceptible to a granulosis virus,Pieris… 
1990
1990
This note presents a generalization of the fact that most of the classical Goppa codes lie arbitrarily close to the Gilbert… 
1968
1968
Auteur : Andre Balland, Alix Barbet, Pierre Gros et Gilbert Hallier Titre : Fouilles de l'Ecole Francaise de Rome a Bolsena…