Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 228,554,958 papers from all fields of science
Search
Sign In
Create Free Account
Gilbert–Varshamov bound
Known as:
Gilbert-Varshamov bound
, Gilbert-Shannon-Varshamov bound
, GV bound
Expand
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
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
13 relations
Binary Goppa code
Coding theory
Concatenated error correction code
Elias Bassalygo bound
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2020
2020
$\mathbb {Z}_{p}\mathbb {Z}_{p^{s}}$-additive cyclic codes are asymptotically good
Ting Yao
,
Shixin Zhu
Cryptography and Communications
2020
Corpus ID: 202149853
We construct a class of $\mathbb {Z}_{p}\mathbb {Z}_{p^{s}}$-additive cyclic codes generated by pairs of polynomials, where p is…
Expand
2017
2017
Binary subblock energy-constrained codes: Bounds on code size and asymptotic rate
Anshoo Tandon
,
Han Mao Kiah
,
M. Motani
International Symposium on Information Theory
2017
Corpus ID: 33899399
The subblock energy-constrained codes (SECCs) have recently been shown to be suitable candidates for simultaneous energy and…
Expand
2007
2007
Nonbinary Quantum Goppa Codes Exceeding the Quantum Gilbert-Varshamov Bound
A. Niehage
Quantum Information Processing
2007
Corpus ID: 11026348
An explicit construction for nonbinary quantum Goppa codes exceeding the quantum Gilbert-Varshamov bound is given. First, we…
Expand
2006
2006
Asymptotic improvement of the Gilbert-Varshamov bound for binary linear codes
P. Gaborit
,
G. Zémor
IEEE International Symposium on Information…
2006
Corpus ID: 15604005
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…
Expand
2001
2001
On Gilbert-Varshamov type bounds for Z2k-linear codes
B. Hove
,
C. Thommesen
2001
Corpus ID: 18297780
In this paper we derive a Gilbert-Varshamov type bound for linear codes over Galois rings GR(pl; j): However, this bound does not…
Expand
1997
1997
Improved (T, M, S)-net Parameters from the Gilbert-Varshamov Bound
Andrew T. Clayman
,
G. Mullen
Applicable Algebra in Engineering, Communication…
1997
Corpus ID: 11583858
Abstract. We obtain some improved net parameters via use of the Gilbert-Varshamov coding theory bound.
1991
1991
New approaches to reduced-complexity decoding
J. Coffey
,
R. Goodman
,
P. Farrell
Discrete Applied Mathematics
1991
Corpus ID: 37426703
1991
1991
A simple action treshold for timing applications of a granulosis virus to controlPieris rapae [Lep.: Pieridae]
S. Webb
,
A. Shelton
Entomophaga
1991
Corpus ID: 3125258
Pieris rapae (L.) an important pest of cole crops in the northeastern United States, is susceptible to a granulosis virus,Pieris…
Expand
1990
1990
Asymptotically good families of geometric Goppa codes and the Gilbert-Varshamov bound
C. Voss
International Symposium on Coding Theory and…
1990
Corpus ID: 6045754
This note presents a generalization of the fact that most of the classical Goppa codes lie arbitrarily close to the Gilbert…
Expand
1968
1968
Fouilles de l'École Française de Rome à Bolsena (Poggio Moscini). II. Les architectures (1962-1967)
A. Balland
,
A. Barbet
,
P. Gros
,
G. Hallier
1968
Corpus ID: 193258832
Auteur : Andre Balland, Alix Barbet, Pierre Gros et Gilbert Hallier Titre : Fouilles de l'Ecole Francaise de Rome a Bolsena…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE