Gilbert-Varshamov Bound for Euclidean Space Codes Over Distance-Uniform Signal Sets

Rajan, Sundar B and Subramaniam, Venkata L and Bahl, Rajendar (2002) Gilbert-Varshamov Bound for Euclidean Space Codes Over Distance-Uniform Signal Sets. In: IEEE Transactions on Information Theory, 48 (2). pp. 537-546.

Preview

PDF gilbert.pdf Download (672kB)

Abstract

In this correspondence, in an extension of Piret's bound for codes over phase-shift keying (PSK) signal sets, we investigate the application of the Gilbert-Varshamov (GV) bound to a variety of distance-uniform (DU) signal sets in Euclidean space. It is shown that four-dimensional signal sets matched to binary tetrahedral, binary octahedral, and binary icosahedral groups lead to better bounds compared to the bounds for signal sets matched to dicyclic groups with the same number of signal points and comparable symmetric PSK signal sets

Item Type:	Journal Article
Publication:	IEEE Transactions on Information Theory
Publisher:	IEEE
Additional Information:	Copyright 1990 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.
Keywords:	Euclidean space codes;Gilbert-Varshamov (GV) bound; Group codes;Multilevel construction;Signal sets matched to groups;Uniform signal sets
Department/Centre:	Division of Electrical Sciences > Electrical Communication Engineering
Date Deposited:	18 Jan 2006
Last Modified:	19 Sep 2010 04:22
URI:	http://eprints.iisc.ac.in/id/eprint/5023

Actions (login required)

View Item