Viswanath, G and Rajan, Sundar B (2003) On Asymptotic Elias Bound for Euclidean Space Codes over Distance-Uniform Signal Sets. In: IEEE International Symposium on Information Theory, 2003, 29 June-4 July, Yokohama,Japan, 466 -466.
The asymptotic Elias upper bound of codes designed for Hamming distance is well known. Piret  and Ericsson  have extended this bound for codes over symmetric PSK signal sets with Euclidean distance and for codes over signal sets that form a group, with a general distance function respectively. The tightness of these bounds depend on a choice of a probability distribution, and finding the distribution (called optimum distribution henceforth) that leads to the tightest bound is difficult in general. In  these bounds were extended for codes over the wider class of distance-uniform signal sets. In this paper we obtain optimum distributions for codes over signal sets matched  to (i) dihedral group, (ii) dicyclic group, (iii) binary tetrahedral group, (iv) binary octahedral group, (v) binary icosahedral group and (vi) n-dimensional cube. Further we compare the bounds of codes over these signal sets based on the spectral rate.
|Item Type:||Conference Paper|
|Additional Information:||©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.|
|Department/Centre:||Division of Electrical Sciences > Electrical Communication Engineering|
|Date Deposited:||21 Dec 2005|
|Last Modified:||19 Sep 2010 04:22|
Actions (login required)