By Topic

A generalized Gilbert-Varshamov bound derived via analysis of a code-search algorithm

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Gu, J. ; Dept. of Electr. Eng., Maryland Univ., College Park, MD, USA ; Fuja, T.

A generalization of the Gilbert-Varshamov bound that is applicable to block codes whose codewords must be drawn from irregular sets is derived. The bound improves by a factor of four a similar result derived by V.D. Kolesnik and V.Y. Krachkovsky (1991). This generalization is derived by analysing a code search algorithm referred to as the altruistic algorithm. This algorithm iteratively deletes potential codewords so that at each iteration the candidate is removed. The bound is derived by demonstrating that, as the algorithm proceeds, the average volume of a sphere of a given radius approaches the maximum such volume and so a bound previously expressed in terms of the maximum volume can in fact be expressed in terms of the average volume. Examples of applications where the bound is relevant include error-correcting (d ,k) codes and binary codes for code division multiple access

Published in:

Information Theory, IEEE Transactions on  (Volume:39 ,  Issue: 3 )