Multiple access with distance preserving mappings for permutation codes

Thokozani Shongwe, Theo G. Swart, Hendrik C. Ferreira

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

We present results for Distance Preserving Mappings (DPMs) for permutation codes that can be used for multiple access communication even under frequency jamming. We give examples of multiple codebooks that are DPMs such that each DPM can be assigned to a user for communication over a multiple access channel. We only consider one type of DPM called Distance Increasing Mappings (DIMs). The multiple access channel of interest is Time Division Multiple Access (TDMA). We show that it is possible to give a construction for DIMs that can be uniquely decoded even in the presence of frequency jamming. The DPMs are permutation codes found by mapping binary sequences to permutation sequences. The permutation codes have codewords of length M with symbols taken from an alphabet whose cardinality is M, where M is any integer. Each symbol may be seen as representing one out of the M frequencies in an M-ary Frequency Shift keying modulation scheme, for example.

Original languageEnglish
Title of host publicationIEEE AFRICON 2013
PublisherInstitute of Electrical and Electronics Engineers Inc.
ISBN (Print)9781467359405
DOIs
Publication statusPublished - 2013
EventIEEE AFRICON 2013 - Pointe-Aux-Piments, Mauritius
Duration: 9 Sept 201312 Sept 2013

Publication series

NameIEEE AFRICON Conference
ISSN (Print)2153-0025
ISSN (Electronic)2153-0033

Conference

ConferenceIEEE AFRICON 2013
Country/TerritoryMauritius
CityPointe-Aux-Piments
Period9/09/1312/09/13

ASJC Scopus subject areas

  • Computer Science Applications
  • Electrical and Electronic Engineering

Fingerprint

Dive into the research topics of 'Multiple access with distance preserving mappings for permutation codes'. Together they form a unique fingerprint.

Cite this