Gilbert-Varshamov-type bound for relative dimension length profile
نویسندگان
چکیده
منابع مشابه
Strengthening the Gilbert–Varshamov bound
The paper discusses some ways to strengthen (nonasymptotically) the Gilbert–Varshamov bound for linear codes. The unifying idea is to study a certain graph constructed on vectors of low weight in the cosets of the code, which we call the Varshamov graph. Various simple estimates of the number of its connected components account for better lower bounds on the minimum distance of codes, some of t...
متن کاملImproved Gilbert-Varshamov bound for constrained systems
Nonconstructive existence results are obtained for block error-correcting codes whose codewords lie in a given constrained system. Each such system is defined as a set of words obtained by reading the labels of a finite directed labelled graph. For a prescribed constrained system and relative minimum distance δ, the new lower bounds on the rate of such codes improve on those derived recently by...
متن کاملNotes 2 : Gilbert - Varshamov bound
There is a natural greedy approach to construct a code of distance at least d: start with any codeword, and keep on adding codewords which have distance at least d from all previously chosen codewords, until we can proceed no longer. Suppose this procedure halts after picking a code C. Then Hamming balls in {0, 1, . . . , q−1}n of radius d−1 centered at the codewords of C must cover the whole s...
متن کاملA Gilbert-Varshamov type bound for Euclidean packings
This paper develops a method to obtain a Gilbert-Varshamov 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 Minkowski-Hlawka bound, but not as good as the lower bound given by Keith Ball in 1992.
متن کاملLengthening and the Gilbert-Varshamov bound
We use lengthening and an enhanced version of the Gilbert-Varshamov lower bound for linear codes to construct a large number of record-breaking codes. Our main theorem may be seen as a closure operation on data bases.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEICE Communications Express
سال: 2013
ISSN: 2187-0136
DOI: 10.1587/comex.2.343