Skip navigation
Please use this identifier to cite or link to this item: https://libeldoc.bsuir.by/handle/123456789/35694
Full metadata record
DC FieldValueLanguage
dc.contributor.authorRen Xunhuan-
dc.contributor.authorAl-Furaiji, O. J.-
dc.contributor.authorKonopelko, V. K.-
dc.contributor.authorКонопелько, В. К.-
dc.date.accessioned2019-07-11T07:01:23Z-
dc.date.available2019-07-11T07:01:23Z-
dc.date.issued2019-
dc.identifier.citationRen Xunhuan. Interleaving based on linear block code / Ren Xunhuan, O. J. Al-Furaiji, V. K. Konopelko // Кодирование и цифровая обработка сигналов в инфокоммуникациях: материалы международной научно-практической конференции, Минск, 4 апреля 2019 г. / Белорусский государственный университет информатики и радиоэлектроники; редкол.: В. К. Конопелько, В. Ю. Цветков, Л. А. Шичко. – Минск, 2019. – С. 5 – 9.ru_RU
dc.identifier.urihttps://libeldoc.bsuir.by/handle/123456789/35694-
dc.description.abstractIn this paper the methods of transforming one-dimensional linear code into two- dimensional symmetric and asymmetric recursive scattering information code are analyzed. The method has transformed the encoded information sequence into a discrete sequence to combat the burst noisy environment. Channel coding is effective when detecting and correcting single errors are not too long strings and is ineffective for long burst errors caused by interference and fading of the mobile communication channel. However, the interleaving technique can solve the above problem without adding extra redundancy.ru_RU
dc.language.isoenru_RU
dc.publisherБГУИРru_RU
dc.subjectматериалы конференцийru_RU
dc.subjectsymmetric and asymmetric methodru_RU
dc.subjectinterleaving technologyru_RU
dc.subjectchannel codingru_RU
dc.subjectburst interferenceru_RU
dc.titleInterleaving based on linear block coderu_RU
dc.typeСтатьяru_RU
Appears in Collections:Кодирование и цифровая обработка сигналов в инфокоммуникациях (2019)

Files in This Item:
File Description SizeFormat 
Ren_Interleaving.pdf655.42 kBAdobe PDFView/Open
Show simple item record Google Scholar

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