Arbitrary Rate Permutation Modulation for the Gaussian Channel

Simple item page
dc.creatorHenkel, Oliver
dc.date2007-04-23
dc.date.accessioned2026-07-07T08:15:58Z
dc.date.available2026-07-07T08:15:58Z
dc.descriptionIn this paper non-group permutation modulated sequences for the Gaussian channel are considered. Without the restriction to group codes rather than subsets of group codes, arbitrary rates are achievable. The code construction utilizes the known optimal group constellations to ensure at least the same performance but exploit the Gray code ordering structure of multiset permutations as a selection criterion at the decoder. The decoder achieves near maximum likelihood performance at low computational cost and low additional memory requirements at the receiver.
dc.descriptionto appear in the Proceedings of the International Symposium of Information Theory (ISIT 2007)
dc.identifierhttps://arxiv.org/abs/0704.3019
dc.identifierhttp://arxiv.org/abs/0704.3019
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/133623
dc.subjectInformation Theory
dc.titleArbitrary Rate Permutation Modulation for the Gaussian Channel
dc.typetext

Files

Collections

arXiv