|
Problemy Peredachi Informatsii, 2003, Volume 39, Issue 3, Pages 11–27
(Mi ppi305)
|
|
|
|
This article is cited in 6 scientific papers (total in 6 papers)
Information Theory and Coding Theory
On the Performance of Permutation Codes for Multi-User Communication
V. B. Balakirskii, H. Vinck Institute for Experimental Mathematics, University of Duisburg-Essen
Abstract:
Permutation coding for multi-user communication schemes that originate from the Fast Frequency Hopping/Multiple Frequency Shift Keying modulation is investigated. Each sender is either passive or sends some signal formed as the concatenation of $M$ elementary signals having $M$ different specified frequencies. There is also a jammer, who can introduce disturbances. A single disturbance is either sending the signal that contains all $M$ frequencies at a certain time instant or sending some elementary signal at all time instants. Each receiver receives a vector of $M$ sets, where a set at each time instant contains a fixed frequency if and only if the corresponding elementary signal was sent by either some sender or the jammer. The task of the receiver is to uniquely decode the message of his sender. We present regular constructions of permutation codes for this scheme given the following parameters: the number of frequencies, number of pairs (sender, receiver), number of messages per sender, and maximum number of disturbances of the jammer.
Received: 05.03.2002 Revised: 19.02.2003
Citation:
V. B. Balakirskii, H. Vinck, “On the Performance of Permutation Codes for Multi-User Communication”, Probl. Peredachi Inf., 39:3 (2003), 11–27; Problems Inform. Transmission, 39:3 (2003), 239–254
Linking options:
https://www.mathnet.ru/eng/ppi305 https://www.mathnet.ru/eng/ppi/v39/i3/p11
|
Statistics & downloads: |
Abstract page: | 322 | Full-text PDF : | 101 | References: | 39 |
|