# Gilbert–Varshamov bound

## Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

2014

2014

- IEEE Transactions on Information Theory
- 2014

A family of quantum codes of increasing block length with positive rate is asymptotically good if the ratio of its distance to… (More)

Is this relevant?

2011

2011

- IEEE International Symposium on Information…
- 2011

In the online channel coding model, a sender wishes to communicate a message to a receiver by transmitting a codeword x = (x1… (More)

Is this relevant?

2011

2011

- IEEE International Symposium on Information…
- 2011

It is well known that quantum codes can be constructed through classical symplectic self-orthogonal codes. In this paper, we give… (More)

Is this relevant?

2008

2008

- IEEE Transactions on Information Theory
- 2008

The Gilbert-Varshamov (GV) bound states that the maximum size A<sub>2</sub>(n, d) of a binary code of length n and minimum… (More)

Is this relevant?

Highly Cited

2004

Highly Cited

2004

- International Symposium onInformation Theory…
- 2004

Using the hull dimension spectra of linear codes, we show that linear codes with complementary dual meet the asymptotic Gilbert… (More)

Is this relevant?

2004

2004

- SODA
- 2004

We demonstrate a probabilistic construction of binary linear codes meeting the GV bound (with overwhelming probability) for rates… (More)

Is this relevant?

2004

2004

- IEEE Transactions on Information Theory
- 2004

A finite Gilbert-Varshamov (GV) bound for pure stabilizer (binary and nonbinary) quantum error correcting codes is presented in… (More)

Is this relevant?

1998

1998

- 1998

The paper discusses some ways to strengthen (nonasymptotically) the Gilbert–Varshamov bound for linear codes. The unifying idea… (More)

Is this relevant?

1997

1997

- IEEE Trans. Information Theory
- 1997

We use lengthening and an enhanced version of the Gilbert-Varshamov lower bound for linear codes to construct a large number of… (More)

Is this relevant?

1992

1992

- IEEE Trans. Information Theory
- 1992

Nonconstructive existence results are obtained for block error-correcting codes whose codewords lie in a given constrained system… (More)

Is this relevant?