A Generalized Gilbert-Varshamov Bound Derived via Analysis of a Code-Search Algorithm

Simple item page
dc.contributor.authorGu, Junfengen_US
dc.contributor.authorFuja, Tom E.en_US
dc.contributor.departmentISRen_US
dc.date.accessioned2007-05-23T09:51:24Z
dc.date.available2007-05-23T09:51:24Z
dc.date.issued1992en_US
dc.description.abstractThis 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.extent587256 bytes
dc.format.mimetypeapplication/pdf
dc.identifier.urihttp://hdl.handle.net/1903/5268
dc.language.isoen_USen_US
dc.relation.ispartofseriesISR; TR 1992-87en_US
dc.subjectdigital communicationsen_US
dc.subjecterror correction codesen_US
dc.subjectinformation theoryen_US
dc.subjectoptical communicationsen_US
dc.subjectsignal processingen_US
dc.subjectCommunication en_US
dc.subjectSignal Processing Systemsen_US
dc.titleA Generalized Gilbert-Varshamov Bound Derived via Analysis of a Code-Search Algorithmen_US
dc.typeTechnical Reporten_US

Files

Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
TR_92-87.pdf
Size:
573.49 KB
Format:
Adobe Portable Document Format
Download

Collections

Institute for Systems Research Technical Reports