Skip navigation
Please use this identifier to cite or link to this item: https://libeldoc.bsuir.by/handle/123456789/51963
Full metadata record
DC FieldValueLanguage
dc.contributor.authorLiu, F. Y.-
dc.coverage.spatialМинскru_RU
dc.date.accessioned2023-06-13T06:24:48Z-
dc.date.available2023-06-13T06:24:48Z-
dc.date.issued2023-
dc.identifier.citationLiu, F. Y. A review of research on the construction and decoding of multiple LDPC codes / F. Y. Liu // Информационная безопасность : сборник материалов 59-й научной конференции аспирантов, магистрантов и студентов БГУИР, Минск, 17–21 апреля 2023 г. / Белорусский государственный университет информатики и радиоэлектроники. – Минск, 2023. – С. 171–172.ru_RU
dc.identifier.urihttps://libeldoc.bsuir.by/handle/123456789/51963-
dc.description.abstractWith the continuous progress of communication technology, LDPC codes have become one of the key technologies in channel coding with their superior error correction performance and efficient decoding algorithms. Among them, multivariate LDPC codes perform better in high-order modulation and burst error channels, especially in short to medium code length conditions, but there are also shortcomings. In order to better reconcile band utilization with BER and reduce decoding complexity, this paper discusses the construction and decoding of multivariate LDPC codes, focusing on their development history and research status.ru_RU
dc.language.isoenru_RU
dc.publisherБГУИРru_RU
dc.subjectматериалы конференцийru_RU
dc.subjectChannel codingru_RU
dc.subjectLDPC codesru_RU
dc.subjectmultiple LDPC codesru_RU
dc.subjectconstructionru_RU
dc.subjectdecodingru_RU
dc.titleA review of research on the construction and decoding of multiple LDPC codesru_RU
dc.typeArticleru_RU
Appears in Collections:Информационная безопасность : материалы 59-й научной конференции аспирантов, магистрантов и студентов (2023)

Files in This Item:
File Description SizeFormat 
Liu_A_review.pdf176.16 kBAdobe PDFView/Open
Show simple item record Google Scholar

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