Title:	Genetic optimization of LDPC codes to improve the correction of burst errors
Authors:	Broulím, Jan Ayriyan, Alexander Grigorian, Hovik
Citation:	BROULÍM, J. AYRIYAN, A. GRIGORIAN, H. Genetic optimization of LDPC codes to improve the correction of burst errors. In: Mathematical Modeling and Computational Physics 2019 (MMCP 2019) : /proceedings/. Les Ulis: EDP Sciences, 2020. s. 1-4. ISBN 978-2-7598-9095-8.
Issue Date:	2020
Publisher:	EDP Sciences
Document type:	konferenční příspěvek conferenceObject
URI:	http://hdl.handle.net/11025/42794
ISBN:	978-2-7598-9095-8
Keywords in different language:	LDPC;genetic optimization;error correction
Abstract in different language:	Error correction plays a crucial role when transmitting data from the source to the destination through a noisy channel. It has found many applications in television broadcasting services, data transmission in radiation harsh environment (e. g. space probes or physical experiments) or memory storages influenced by Single Event Effects (SEE). Low Density Parity Check (LDPC) codes provide an important technique to correct these errors. The parameters of error correction depend both on the decoding algorithm and on the LDPC code given by the parity-check matrix. Therefore, a particular design of the paritycheck matrix is necessary. Moreover, with the development of high performance computing, the application of genetic optimization algorithms to design the parity-check matrices has been enabled. In this article, we present the application of the genetic optimization algorithm to produce error correcting codes with special properties, especially the burst types of errors. The results show the bounds of correction capabilities for various code lengths and various redundancies of LDPC codes. This is particularly useful when designing systems under the influence of noise combined with the application of the error correction codes.
Rights:	© EDP Sciences
Appears in Collections:	Konferenční příspěvky / Conference papers (RICE) OBD

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.