Proceedings of the XVI International Symposium "Problems of Redundancy in Information and Control Systems", Moscow, Russia
XVI International Symposium "Problems of Redundancy in Information and Control Systems" is the conference that covers a wide area of aspects of information and communication systems. The main goal of the Symposium foundation is the reinforcement of cooperation between the representatives of various scientific schools, a possibility for the participants to get awareness of the latest scientific and technical achievements and sharing their experience with colleagues.
A new class of Q-ary codes that correct errors in the Lee metric is described. For the received codes there is no restriction on the number of correctable errors associated with the size of the code alphabet. In addition, the resulting codes have less redundancy compared to known codes.
In this paper we consider a problem of secured data transmission for low-power devices such as RFID (Radio Frequency IDentification) tags or some other devices for Internet of Things (IoT) for which low power consumption plays significant role. In fact, the privacy aspect involved with technology of RFID and IoT could become a major issue in the perspective of a global adoption. We considered well-known McEliece cryptosystems both in classical case (based on Goppa Codes) and based on Quasi-Cyclic Moderate-Density Parity-Check Codes (QC-MDPC) as a major security element of small and low-power devices. We also estimate a trade-off between complexity and security level of suggested system.
In what follows a modified version of a coded DHA FH OFDMA communication system that combines multi-tone transmission, reception based on order statistics and concatenated coding is proposed. It is demonstrated that the proposed approach outperforms conventional (single-tone) coded DHA FH OFDMA while having lower decoding complexity.
We consider a vector-disjunctive channel where users transmit some vector of bits of length L. We estimate the capacity of this channel and derive the lower bound on this value in the case of channel noise. We present some numerical results for the bound we obtained in the case of different number of active users and different parameters of channel.
This article is dedicated to an alternative method of solving of the Chinese Remainder Theorem for polynomials. To construct the solution, a system of linear equations is constructed (using the method of undetermined coefficients) and then solved. The complexity of the proposed method is also calculated.