Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

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… Expand
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2014
2014
  • Yingkai Ouyang
  • IEEE Transactions on Information Theory
  • 2014
  • Corpus ID: 17494642
A family of quantum codes of increasing block length with positive rate is asymptotically good if the ratio of its distance to… Expand
  • figure 1
  • figure 2
Is this relevant?
Highly Cited
2007
Highly Cited
2007
Reflections on the Transition from Elite to Mass to Universal Access: Forms and Phases of Higher Education in Modern Societies… Expand
Is this relevant?
Highly Cited
2004
Highly Cited
2004
  • N. Sendrier
  • International Symposium onInformation Theory…
  • 2004
  • Corpus ID: 2279823
Using the hull dimension spectra of linear codes, we show that linear codes with complementary dual meet the asymptotic Gilbert… Expand
Is this relevant?
Highly Cited
2004
Highly Cited
2004
  • K. Feng, Z. Ma
  • IEEE Transactions on Information Theory
  • 2004
  • Corpus ID: 7100004
A finite Gilbert-Varshamov (GV) bound for pure stabilizer (binary and nonbinary) quantum error correcting codes is presented in… Expand
  • table I
Is this relevant?
2004
2004
Given positive integers n and d, let A/sub 2/(n,d) denote the maximum size of a binary code of length n and minimum distance d… Expand
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
Highly Cited
2003
Highly Cited
2003
Transmit beamforming and receive combining are simple methods for exploiting the significant diversity that is available in… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2000
2000
Abstract The paper discusses some ways to strengthen (nonasymptotically) the Gilbert–Varshamov bound for linear codes. The… Expand
Is this relevant?
1997
1997
Abstract. We obtain some improved net parameters via use of the Gilbert-Varshamov coding theory bound. 
  • table 1
  • table 2
Is this relevant?
Highly Cited
1980
Highly Cited
1980
Let A(n,2\delta,w) denote the maximum number of codewords in any binary code of length n , constant weight w , and Hamming… Expand
Is this relevant?
Highly Cited
1974
Highly Cited
1974
  • T. Kasami
  • IEEE Trans. Inf. Theory
  • 1974
  • Corpus ID: 43049916
It is shown that there exist arbitrarily long quasi-cyclic (2k,k) binary codes that meet a bound slightly weaker than the Gilbert… Expand
Is this relevant?