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.
2019
2019
Edit channels are a class of communication channels where the output of the channel is an edited version of the input. The edits… 
2008
2008
Distributed space-time block coding schemes based on quadrature amplitude modulation (QAM) symbols are introduced that enable… 
2002
2002
In this correspondence, in an extension of Piret's bound for codes over phase-shift keying (PSK) signal sets, we investigate the… 
2002
2002
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… 
2000
2000
We derive bounds for optimal rate allocation between source and channel coding for linear channel codes that meet the Gilbert… 
1997
1997
The generalization of the Gilbert-Varshamov bound due to Gu and Fuja is a direct consequence of Turtheorem on the existence of a… 
1990
1990
This note presents a generalization of the fact that most of the classical Goppa codes lie arbitrarily close to the Gilbert… 
1971
1971
Gilbert Baumslag has shown that the standard wreath product of A by B is nilpotent if and only if A and B are /»-groups for the… 
1968
1968
Auteur : Andre Balland, Alix Barbet, Pierre Gros et Gilbert Hallier Titre : Fouilles de l'Ecole Francaise de Rome a Bolsena…