?
Generalized concatenated codes with soft decoding of inner and outer codes
P. 290–294.
Zhilin I., Kreshchuk A., Zyablov V.
In press
In this paper we propose a generalized concatenated code (GC code) construction based on shortened Reed-Solomon inner codes and nonbinary LDPC outer codes. We also propose a soft-input decoder for this construction that makes use of soft-input soft-output decoding of both inner and outer codes. We show that this construction gives significant coding gain. We also compared it to generalized error-location codes with Reed-Solomon component codes and hard-decision decoding. We believe that the proposed code could be used in modern and future radio communication systems.
In book
Monterey: IEEE, 2016.
Kuvshinov A., Fominykh A., Ivanov F., IEEE Access 2026 Vol. 14 P. 50549–50557
The recursive (U|U+V) construction, a generalization of which includes polar codes, provides a powerful framework for building complex codes from simpler components. However, existing approaches predominantly rely on fixed or symmetric tree architectures, overlooking the critical impact of decomposition choice on code performance. This paper addresses the challenge of optimal tree decomposition selection by presenting a framework ...
Added: April 7, 2026
Kuvshinov A., Timokhin I., Ivanov F., , in: 2024 IEEE International Multi-Conference on Engineering, Computer and Information Sciences (SIBIRCON).: Novosibirsk: IEEE, 2024. P. 52–57.
Concatenated codes are currently being actively investigated for the next-generation wireless communication sys tems due to their flexibility and ability to be used in various scenarios. The serial type of concatenation provides good error correcting properties with a potential reduction in complexity when an iterative concatenated decoder is used at the receiver side. One of ...
Added: November 16, 2024
Ivanov F., Kuvshinov A., Facta Universitatis. Series Electronics and Energetics 2024 Vol. 37 No. 3 P. 483–496
Nowadays concatenated codes are actively developed for different applications of error-correcting theory. In this paper we propose a new method for constructing concatenated codes consisting of some outer error-correcting code and a particular designed inner low-density parity-check (LDPC) code. We consider polarization-adjusted convolutional (PAC) code and LDPC code as outer code of suggested construction. Special ...
Added: November 16, 2024
Ivanov F., Kuvshinov A., , in: 2023 16th International Conference on Advanced Technologies, Systems and Services in Telecommunications (TELSIKS).: Niš: IEEE, 2023. P. 228–231.
Concatenated codes are effectively used in different approaches of error-correcting theory. We suggest new concatenated code construction that is composed of outer LDPC code and a particular designed inner LDPC code. Special optimization procedure was developed to obtain inner code with specific error-correcting characteristics. We apply the decoder of woven codes to this construction, while ...
Added: June 21, 2024
Ivanov F., Kuvshinov A., , in: 2022 IEEE International Multi-Conference on Engineering, Computer and Information Sciences (SIBIRCON).: Ekaterinburg: IEEE, 2022. P. 190–194.
In this paper we consider the special construction of concatenated codes. Our scheme consists of outer LDPC code and a specially designed class of inner LDPC code with interleaver between inner and outer codes. An inner code in the proposed construction is obtained using a specific optimization algorithm that allows to minimize SNR for a ...
Added: June 21, 2024
Osipov D., , in: 2021 XVII International Symposium "Problems of Redundancy in Information and Control Systems" (REDUNDANCY).: IEEE, 2021. P. 11–16.
Coded DHA FH OFDMA communication systems that use order statistics-based detectors are promising candidates for applications such as IoT and M2M. For the majority of order statistics-based reception techniques the high throughput coded modulation schemes development remains an open problem. In what follows a novel order-statistics based detector that outperforms the classical Maximum Rank Sum ...
Added: February 9, 2022
Zhilin I., Kreshchuk A., Zyablov V., , in: 2017 IEEE International Symposium on Information Theory (ISIT).: IEEE, 2017. P. 16–20.
In this paper we propose a woven block code construction based on two convolutional outer codes and a single inner code. We proved lower and upper bounds on this construction's code distance. The lower bound is shown to be higher than the product of the free distances of inner and outer constituent codes. Since this ...
Added: January 9, 2019
Kreshchuk A., Zhilin I., Zyablov V., Lecture Notes in Computer Science 2017 Vol. 10495 P. 217–227
In this paper we propose a woven block code construction based on two convolutional codes. We also propose a soft-input decoder that allows this construction to have better error correction performance than the turbo codes with a conventional decoder. Computer simulation has showed a 0.1 dB energy gain relative to the LTE turbo code. Asymptotically ...
Added: January 9, 2019
Stukach O., Romanyuk A. N., Ivanov Y. Y., , in: 2017 International Siberian Conference on Control and Communications (SIBCON).: IEEE, 2017. Ch. 1 P. 1–6.
In the paper, we will discuss the powerfull class of channel codes referred to as turbo codes. We commence with a brief discussion for MAP and log-MAP decoding algorithms. Then we work with proposed turbo decoding method, which is called as PL-log-MAP. Some numerical results and research experiments, such as simulation for bit error rate ...
Added: January 8, 2019
Zhilin, I., Zigangirov D., Zyablov V., Electronic Notes in Discrete Mathematics 2017 Vol. 57 P. 219–224
We propose a concatenated code construction based on convolutional codes. We prove that minimum distance of this construction equals product of free distances of component codes. ...
Added: February 1, 2018
Zhilin I., Zyablov V., Проблемы передачи информации 2017 Т. 53 № 2 С. 16–39
The paper discusses generalized error locating (GEL) codes over the same alpha- bet for both component codes. The algorithm for computing upper bound on decoding error probability under known input symbol error rate and code parameters. Is is used for construct- ing the algorithm of code parameters selection that maximizes code rate for given construction ...
Added: February 1, 2018
Ivanov F., Zhilin I., Zyablov V., European Wireless 2015; 21th European Wireless Conference; Proceedings of 2015 P. 1–5
n this paper we propose to consider a generalized error-locating code (GEL-code) as a possible candidate for data transmission systems that require high code rates along with strict requirements on wrong decoding probability. The paper describes the construction of the GEL-code and the algorithms for encoding and decoding. The main idea is to implement a ...
Added: February 1, 2018
Kreshchuk A., Zyablov V. V., Journal of Communications Technology and Electronics 2014 Vol. 59 No. 12 P. 1489–1500
Multiple-input multiple-output systems are communication systems employing multiple transmitting and receiving antennas. In the present study, a new generalized concatenated signal-code construction is proposed. Its inner codes are embedded Golden codes, and its outer codes are products of Reed-Solomon codes. New algorithms for decoding inner codes, outer codes, and the generalized signal-code construction itself are ...
Added: January 30, 2018
Osipov D., , in: Proceedings XIV International Symposium on Problems of Redundancy in Information and Control Systems (June 1-5 2014).: IEEE, 2014. P. 74 –77.
In what follows signal-code constructions employing block and convolutional nonbinary inner codes that can perform under severe jamming are proposed. Robustness of the proposed signal-code constructions to jamming is verified by means of simulation. ...
Added: July 17, 2015
Moreira J., Fernández M., Kabatiansky G. A., , in: Information Forensics and Security (WIFS), 2011 IEEE International Workshop on.: IEEE, 2011. P. 1–6.
Separating codes have been used in many areas as diverse as automata synthesis, technical diagnosis and traitor tracing schemes. In this paper, we study a weak version of separating codes called almost separating codes. More precisely, we derive lower bounds on the rate of almost separating codes. From the main result it is seen that ...
Added: May 6, 2014