Popovski, Petar and Utkovski, Zoran and Trillingsgaard, Kasper Floe (2013) Communication Schemes with Constrained Reordering of Resources. IEEE Transactions on Communications, 61 (5). pp. 2048-2059. ISSN 0090-6778
Preview |
Text
TCOM-2012-0027.pdf Download (382kB) | Preview |
Abstract
This paper introduces a communication model inspired by two practical scenarios. The first scenario is related to the concept of protocol coding, where information is encoded
in the actions taken by an existing communication protocol.
We investigate strategies for protocol coding via combinatorial reordering of the labelled user resources (packets, channels) in an existing, primary system. However, the degrees of freedom of the reordering are constrained by the operation of the primary system. The second scenario is related to communication systems with energy harvesting, where the transmitted signals are constrained by the energy that is available through the
harvesting process. We have introduced a communication model
that covers both scenarios and elicits their key feature, namely the constraints of the primary system or the harvesting process. We have shown how to compute the capacity of the channels pertaining to the communication model when the resources that can be reordered have binary values. The capacity result is valid under arbitrary error model in which errors in each resource (packet) occur independently. Inspired by the information–theoretic analysis, we have shown how to design practical error–
correcting codes suited for the communication model. It turns out that the information–theoretic insights are instrumental for devising superior design of error–control codes.
| Item Type: | Article |
|---|---|
| Subjects: | Engineering and Technology > Electrical engineering, electronic engineering, information engineering |
| Divisions: | Faculty of Computer Science |
| Depositing User: | Zoran Utkovski |
| Date Deposited: | 20 Feb 2013 12:40 |
| Last Modified: | 24 Sep 2013 12:00 |
| URI: | https://eprints.ugd.edu.mk/id/eprint/5591 |
Actions (login required)
 |
View Item |