Decoding of Polar Codes
No Thumbnail Available
Date
2019
Authors
Journal Title
Journal ISSN
Volume Title
Publisher
Springer Science and Business Media B.V.
Open Access Color
OpenAIRE Downloads
OpenAIRE Views
Abstract
As we explained in Chap. 1, polar encoder structures can be constructed in a recursive manner. This leads to recursive decoding structures. In [1], Arıkan proposed successive cancellation decoding algorithm for the decoding of polar codes and derived recursive expression for the decoding operations. © Springer Nature Singapore Pte Ltd. 2019.
Description
Keywords
Turkish CoHE Thesis Center URL
Fields of Science
Citation
Alia Ahmed Eletri Andi (2019). Efficient decoding of polar codes / Kutup kodlarının verimli çözümlenmesi. Yayımlanmış yüksek lisans tezi. Ankara: Çankaya Üniversitesi Fen bilimleri Enstitüsü.
WoS Q
Scopus Q
Q4
OpenCitations Citation Count
N/A
Source
Springer Topics in Signal Processing
Volume
15
Issue
Start Page
27
End Page
74
PlumX Metrics
Citations
Scopus : 0
Captures
Mendeley Readers : 20
Google Scholar™
OpenAlex FWCI
1.1589563
Sustainable Development Goals
7
AFFORDABLE AND CLEAN ENERGY
8
DECENT WORK AND ECONOMIC GROWTH
13
CLIMATE ACTION
