Results 1  10
of
298,929
A GILBERTVARSHAMOV TYPE BOUND FOR EUCLIDEAN PACKINGS.
"... Abstract. The present paper develops a method to obtain a GilbertVarshamov type bound for dense packings in the Euclidean spaces using suitable lattices. For the Leech lattice the obtained bounds are quite reasonable for large dimensions, better than the MinkowskiHlawka bound but not as good as th ..."
Abstract
 Add to MetaCart
Abstract. The present paper develops a method to obtain a GilbertVarshamov type bound for dense packings in the Euclidean spaces using suitable lattices. For the Leech lattice the obtained bounds are quite reasonable for large dimensions, better than the MinkowskiHlawka bound but not as good
On GilbertVarshamov type bounds for
"... In this paper we derive a GilbertVarshamov type bound for linear codes over Galois rings GR(p l ; j): However, this bound does not guarantee existence of better linear codes over GR(p l ; j) than the usual GilbertVarshamov bound for linear codes over the residue class field GR(p j ): Next ..."
Abstract
 Add to MetaCart
In this paper we derive a GilbertVarshamov type bound for linear codes over Galois rings GR(p l ; j): However, this bound does not guarantee existence of better linear codes over GR(p l ; j) than the usual GilbertVarshamov bound for linear codes over the residue class field GR(p j
Asymptotic improvement of the GilbertVarshamov bound for linear codes
 ISIT 2006
, 2006
"... The GilbertVarshamov bound states that the maximum size A2(n, d) of a binary code of length n and minimum distance d satisfies A2(n, d) ≥ 2n /V (n, d −1) where V (n, d) = ∑d n i=0 i stands for the volume of a Hamming ball of radius d. Recently Jiang and Vardy showed that for binary nonlinear code ..."
Abstract

Cited by 13 (2 self)
 Add to MetaCart
The GilbertVarshamov bound states that the maximum size A2(n, d) of a binary code of length n and minimum distance d satisfies A2(n, d) ≥ 2n /V (n, d −1) where V (n, d) = ∑d n i=0 i stands for the volume of a Hamming ball of radius d. Recently Jiang and Vardy showed that for binary non
On the GilbertVarshamov distance of Abelian group codes
"... Abstract — The problem of the minimum Bhattacharyya distance of group codes over symmetric channels is addressed. Ensembles of Zmlinear codes are introduced and their typical minimum distance characterized in terms of the GilbertVarshamov distances associated to the subgroups of Zm. For the AWGN ..."
Abstract
 Add to MetaCart
. For the AWGN channel with 8PSK as input it is shown that the typical Z8linear code achieves the GilbertVarshamov bound. I.
Source and Channel Rate Allocation for Channel Codes Satisfying the GilbertVarshamov or TsfasmanVladutZink Bounds
, 1999
"... We derive bounds for optimal rate allocation between source and channel coding for linear channel codes that meet the GilbertVarshamov or TsfasmanVladutZink bounds. Formulas giving the high resolution vector quantizer distortion of these systems are also derived. In addition, we give bounds on ho ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
on how far below channel capacity the transmission rate should be for a given delay constraint. The bounds obtained depend on the relationship between channel code rate and relative minimum distance guaranteed by the GilbertVarshamov bound, and do not require sophisticated decoding beyond the error
Beating the GilbertVarshamov Bound for Online Channels
"... In the online channel coding model, a sender wishes to communicate a message to a receiver by transmitting a codeword x = (x1,..., xn) ∈ {0, 1} n bit by bit via a channel limited to at most pn corruptions. The channel is online in the sense that at the ith step the channel decides whether to flip t ..."
Abstract

Cited by 5 (1 self)
 Add to MetaCart
the online channel and the classical adversarial channel is the wellknown GilbertVarshamov bound. In this paper we prove a lower bound on the capacity of the online channel which beats the GilbertVarshamov bound for any positive p such that H(2p) < 1 2 (where H is the binary entropy function). To do so
GilbertVarshamov bound for Euclidean space codes over distance uniform signal sets
 IEEE TRANS. ON INFORMATION THEORY
, 2002
"... In this correspondence, in extension of Piret’s bound for codes over phaseshift keying (PSK) signal sets, we investigate the application of the Gilbert–Varshamov (GV) bound to a variety of distanceuniform (DU) signal sets in Euclidean space. It is shown that fourdimensional signal sets matched t ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
In this correspondence, in extension of Piret’s bound for codes over phaseshift keying (PSK) signal sets, we investigate the application of the Gilbert–Varshamov (GV) bound to a variety of distanceuniform (DU) signal sets in Euclidean space. It is shown that fourdimensional signal sets matched
A GilbertVarshamov type bound for linear codes over Galois rings
"... In this paper we derive a GilbertVarshamov type bound for linear codes over Galois rings. For linear codes over the Galois ring GR(p l ; j) the result can be stated as follows. Given r; ffi such that 0 ! r ! 1 and 0 ffi ! H \Gamma1 p j (1 \Gamma r): Then for all n N; where N is a sufficiently ..."
Abstract
 Add to MetaCart
In this paper we derive a GilbertVarshamov type bound for linear codes over Galois rings. For linear codes over the Galois ring GR(p l ; j) the result can be stated as follows. Given r; ffi such that 0 ! r ! 1 and 0 ffi ! H \Gamma1 p j (1 \Gamma r): Then for all n N; where N is a
From System F to Typed Assembly Language
 ACM TRANSACTIONS ON PROGRAMMING LANGUAGES AND SYSTEMS
, 1998
"... ..."
Results 1  10
of
298,929