Proceedings of the 1999 IEEE Information Theory and Communications Workshop (Cat. No. 99EX253)
DOI: 10.1109/itcom.1999.781440
View full text |Buy / Rent full text
Sign up to set email alerts

Abstract: We extend Piret's u p p e r bound [l] to codes over uniform signal sets ( a signal set is referred t o be uniform if the Euclidean distance distribution is same from a n y point i n the signal s e t ) which include as a special case codes over symmetric P S K signal sets and all signal sets matched to groups [2]. The probability distribution that gives optimum bound is obtained for codes over simplex, biorthogonal signal sets and hamming spaces.

Help me understand this report

This publication either has no citations yet, or we are still processing them

Set email alert for when this publication receives citations?

See others like this or search for similar articles