?
On Performance of Multilevel Coding Schemes Based on Non-Binary LDPC Codes
P. 221–224.
Kruglik Stanislav, Potapova V., Frolov A.
We address the problem of constructing coding schemes for the channels with high-order modulations. It is known, that non-binary LDPC codes are especially good for such channels and significantly outperform their binary counterparts. Unfortunately, their decoding complexity is still large. In order to reduce the decoding complexity, we consider multilevel coding schemes based on non-binary LDPC codes (NB-LDPC-MLC schemes) over smaller fields. The use of such schemes gives us a reasonable gain in complexity. At the same time, the performance of NB-LDPC-MLC schemes is practically the same as the performance of LDPC codes over the field matching the modulation order. In particular, by means of simulations, we showed that the performance of NB-LDPC-MLC schemes over GF(16) is the same as the performance of non-binary LDPC codes over GF(64) and GF(256) in AWGN channel with QAM 64 and QAM 256 accordingly. We also perform a comparison with bit-interleaved coded modulation based on binary LDPC codes.
Language:
English
Keywords: information theory
Los A., Nesterenko A., Rogacheva O., В кн.: Алгебра, теория чисел, дискретная математика и многомасштабное моделирование: современные проблемы, приложения и проблемы истории. Материалы XXII Международной конференции, посвящённой 120-летию со дня рождения академика Андрея Николаевича Колмогорова и 60-летию со дня открытия школы-интерната № 18 при Московском университете.: [б.и.], 2023. С. 151–157.
One of the requirements for the quality of cryptographic algorithms is the equiprobable distribution of the characters of the sequence obtained after applying the cryptographic transformation. This requirement is due to the fact that in the presence of unequal probability of signs of the output sequence, it becomes possible to construct an effective method for ...
Added: April 24, 2024
Kirill Andreev, Ustinova D., Alexey Frolov, IEEE Wireless Communications Letters 2024 Vol. 13 No. 1 P. 69–73
We consider unsourced random access with MIMO receiver – a crucial communication scenario for future 5G/6G wireless networks. We perform a projection-based decoder analysis and derive energy efficiency achievability bounds when channel state information is unknown at transmitters and the receiver (no-CSI scenario). A comparison to the maximum-likelihood (ML) achievability bounds by Gao et al. ...
Added: January 22, 2024
Gromov V., Dang Q. N., , in: 10th International Conference, PReMI 2023, Kolkata, India, December 12–15, 2023, Proceedings. Pattern Recognition and Machine Intelligence. LNCS, volume 14301.: Cham: Springer, 2023. Ch. 3 P. 20–27.
Added: November 29, 2023
Kowshik S., Kirill Andreev, Frolov A. et al., IEEE Transactions on Communications 2020 Vol. 68 No. 8 P. 4694–4708
We discuss the problem of designing channel access architectures for enabling fast, low-latency, grant-free, and uncoordinated uplink for densely packed wireless nodes. Specifically, we study random-access codes, previously introduced for the AWGN MAC, in the practically more relevant case of Rayleigh fading, when channel gains are unknown to the decoder. We propose a random coding ...
Added: September 9, 2023
Glebov A., Rybin P., Kirill Andreev et al., IEEE Communications Letters 2023 Vol. 27 No. 9 P. 2313–2317
We investigate the fundamental limits of the unsourced random access over the binary-input Gaussian channel. By fundamental limits, we mean the minimal energy per bit required to achieve the target per-user probability of error. The original method proposed by Y. Polyanskiy (2017) and based on Gallager’s trick does not work well for binary signaling. We ...
Added: September 9, 2023
Kirill Andreev, Rybin P., Alexey Frolov, IEEE Transactions on Communications 2022 Vol. 70 No. 12 P. 7886–7898
We consider a coded compressed sensing approach for the unsourced random access and replace the outer tree code proposed by Amalladinne et al. (2020) with the list recoverable code capable of correcting t errors. A finite-length random coding bound for such codes is derived. The numerical experiments in the single-antenna quasi-static Rayleigh fading channel show that transition ...
Added: September 9, 2023
IEEE, 2023.
Processing and transmission of information and telecommunication systems
It is supposed to consider the results of current and promising scientific research on:
processing and transmission of information in infocommunication systems;
solving problems of error-correcting coding, assessing the limiting characteristics of communication systems;
methods of machine learning and decision making;
solving urgent problems that are formed at the junction of information ...
Added: July 18, 2023
IEEE, 2020.
Processing and transmission of information and telecommunication systems
It is supposed to consider the results of current and promising scientific research on:
processing and transmission of information in infocommunication systems;
solving problems of error-correcting coding, assessing the limiting characteristics of communication systems;
methods of machine learning and decision making;
solving urgent problems that are formed at the junction of information theory, ...
Added: October 30, 2022
IEEE, 2021.
Processing and transmission of information and telecommunication systems
It is supposed to consider the results of current and promising scientific research on:
processing and transmission of information in infocommunication systems;
solving problems of error-correcting coding, assessing the limiting characteristics of communication systems;
methods of machine learning and decision making;
solving urgent problems that are formed at the junction of information theory, ...
Added: October 27, 2022
IEEE, 2022.
Processing and transmission of information and telecommunication systems
It is supposed to consider the results of current and promising scientific research on:
processing and transmission of information in infocommunication systems;
solving problems of error-correcting coding, assessing the limiting characteristics of communication systems;
methods of machine learning and decision making;
solving urgent problems that are formed at the junction of information ...
Added: September 27, 2022
Kelbert E., World Literature Studies 2021 Vol. 13 No. 4 P. 55–70
This study considers the dialogue in the USSR between semiotics, cybernetics, and information theory, as a case study of the complexities of conceptual transfer between disciplines. Yuri Lotman’s use of the concept of entropy in literary criticism is especially telling. Information theory defines entropy in terms of a system’s complexity and predictability, while its metaphoric ...
Added: January 25, 2022
IEEE, 2020.
Proceedings of 2020 International Symposium on Information Theory and its Applications. ...
Added: November 2, 2021
Maron A., Maron M., , in: Abstracts: 32nd IPMA Word Congress "Project Management in the Digital Transformation Era".: M.: Ассоциация Совнет; Новые печатные технологии, 2021. P. 127–128.
In the modern quickly changing business environment the role of the project management continuously increases in activity of the companies. Since 2014 methodical recommendations about introduction of project management in executive authorities were developed. It is established that mistakes at implementation of projects lead to multimillion losses. It doesn't remain unaddressed.
When performing any work of ...
Added: September 26, 2021
Ivanova I., Quality and Quantity 2022 No. 56 P. 195–215
The effectiveness of the Triple Helix model of innovations can be evaluated in bits of information using the TH indicator of synergy based on information theory. However synergy, measured in bits of information can’t be straightforwardly interpreted in economic terms. The present paper is an attempt to establish a connection between synergy and other growth ...
Added: April 2, 2021
Leydesdorff L., Ivanova I., Journal of the Association for Information Science and Technology 2021 Vol. 72 No. 4 P. 387–402
Problem solving often requires crossing boundaries, such as those between disciplines. When policy‐makers call for “interdisciplinarity,” however, they often mean “synergy.” Synergy is generated when the whole offers more possibilities than the sum of its parts. An increase in the number of options above the sum of the options in subsets can be measured as ...
Added: October 30, 2020
MDPI AG, 2020.
Proceedings (ISSN 2504-3900) publishes publications resulting from conferences, workshops and similar events. ...
Added: March 13, 2020
Kuralenok I., Starikova N., Khvorov A. et al., , in: Proceedings of the 27th ACM International Conference on Information and Knowledge Management.: Association for Computing Machinery (ACM), 2018. P. 1343–1352.
This paper presents a new method for constructing an optimal feature set from sequential data. It creates a dictionary of n-grams of variable length (we call them v-grams), based on the minimum description length principle. The proposed method is a dictionary coder and works simultaneously as both a compression algorithm and as unsupervised feature extraction. ...
Added: December 27, 2019
IEEE, 2019.
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 ...
Added: October 27, 2019
Catania: VDE Verlag GmbH, 2018.
Added: October 28, 2018
Kruglik Stanislav, Dudina Marina, Potapova V. et al., , in: 2017 IEEE Information Theory Workshop (ITW).: IEEE, 2018. P. 26–30.
We investigate one possible generalization of locally recoverable codes (LRC) with all-symbol locality and availability when recovering sets can intersect in a small number of coordinates. This feature allows us to increase the achievable code rate and still meet load balancing requirements. In this paper we derive an upper bound for the rate of such ...
Added: October 26, 2018
Kruglik Stanislav, Frolov A., , in: 2017 IEEE International Symposium on Information Theory (ISIT).: IEEE, 2017. P. 1023–1027.
We investigate the distance properties of linear locally recoverable codes (LRC codes) with all-symbol locality and availability. New upper and lower bounds on the minimum distance of such codes are derived. The upper bound is based on the shortening method and improves existing shortening bounds. To reduce the gap in between upper and lower bounds ...
Added: October 26, 2018