Asymptotic Elias bound for Euclidean space codes over uniform signal sets

Sundar Rajan, B. ; Viswanath, G. (1999) Asymptotic Elias bound for Euclidean space codes over uniform signal sets In: Proceedings of the 1999 IEEE Information Theory and Communications Workshop, 1999, 25-25 June 1999, Kruger National Park, South Africa.

Full text not available from this repository.

Official URL: http://ieeexplore.ieee.org/document/781440/

Related URL: http://dx.doi.org/10.1109/ITCOM.1999.781440

Abstract

We extend Piret's (1986) upper bound to codes over uniform signal sets (a signal set is referred to be uniform if the Euclidean distance distribution is same from any point in the signal set) which include as a special case codes over symmetric PSK signal sets and all signal sets matched to groups (Loeliger 1991). The probability distribution that gives optimum bound is obtained for codes over simplex, biorthogonal signal sets and Hamming spaces.

Item Type:Conference or Workshop Item (Paper)
Source:Copyright of this article belongs to Institute of Electrical and Electronics Engineers.
ID Code:111266
Deposited On:08 Dec 2017 10:36
Last Modified:08 Dec 2017 10:36

Repository Staff Only: item control page