A Generalized Gilbert-Varshamov Bound Derived via Analysis of a Code-Search Algorithm
dc.contributor.author | Gu, Junfeng | en_US |
dc.contributor.author | Fuja, Tom E. | en_US |
dc.contributor.department | ISR | en_US |
dc.date.accessioned | 2007-05-23T09:51:24Z | |
dc.date.available | 2007-05-23T09:51:24Z | |
dc.date.issued | 1992 | en_US |
dc.description.abstract | This correspondence derives a generalization of the Gilbert- Varshamov bound that is applicable to block codes whose codewords must be drawn from irregular sets; the bound improves by a factor of four a similar result recently published by Kolesnik and Krachkovsky. It is derived by analyzing a code search algorithm we refer to as the "Altruistic Algorithm". This algorithm iteratively deletes potential codewords so that at each iteration the "worst" 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)- constrained codes and binary codes for code division multiple access. | en_US |
dc.format.extent | 587256 bytes | |
dc.format.mimetype | application/pdf | |
dc.identifier.uri | http://hdl.handle.net/1903/5268 | |
dc.language.iso | en_US | en_US |
dc.relation.ispartofseries | ISR; TR 1992-87 | en_US |
dc.subject | digital communications | en_US |
dc.subject | error correction codes | en_US |
dc.subject | information theory | en_US |
dc.subject | optical communications | en_US |
dc.subject | signal processing | en_US |
dc.subject | Communication | en_US |
dc.subject | Signal Processing Systems | en_US |
dc.title | A Generalized Gilbert-Varshamov Bound Derived via Analysis of a Code-Search Algorithm | en_US |
dc.type | Technical Report | en_US |
Files
Original bundle
1 - 1 of 1