2021
DOI: 10.1109/lcomm.2021.3104152
|View full text |Cite
|
Sign up to set email alerts
|

An Enhanced Belief Propagation Decoder for Polar Codes

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
1
0

Year Published

2022
2022
2024
2024

Publication Types

Select...
4
2
1

Relationship

1
6

Authors

Journals

citations
Cited by 9 publications
(6 citation statements)
references
References 15 publications
0
1
0
Order By: Relevance
“…The comparison has been done based on various parameters such as type of code, code length, key size, information rate, and attacks on that scheme. It is noted that with the use of the intrinsic property [46] of polar codes [47], the key length of existing algorithms is reduced to a larger extent and the increased information rate shows secured and reliable communication. Thus, we find that public key cryptosystems based on non-systematic polar codes [48] are more efficient than traditional public key cryptosystems in terms of key length and implementation timings.…”
Section: Resultsmentioning
confidence: 99%
“…The comparison has been done based on various parameters such as type of code, code length, key size, information rate, and attacks on that scheme. It is noted that with the use of the intrinsic property [46] of polar codes [47], the key length of existing algorithms is reduced to a larger extent and the increased information rate shows secured and reliable communication. Thus, we find that public key cryptosystems based on non-systematic polar codes [48] are more efficient than traditional public key cryptosystems in terms of key length and implementation timings.…”
Section: Resultsmentioning
confidence: 99%
“…The BPC decoder, proposed in [22], considers the perturbation on code bits located at the rightmost stage of the factor graph, which are corrupted by channel noise. When a decoding failure occurs in the original BP decoder, the decoding attempts after correction are performed to generate a valid estimate.…”
Section: Belief Propagation Correction Decodermentioning
confidence: 99%
“…The decoder selects T indices with the lowest magnitude of L n+1,j , i.e., S ← j ∈ {1, 2, ..., N} of T smallest |L n+1,j |. The stopping tree [22] is utilized to reduce the sorting range. The CRC is selected as the EDTC.…”
Section: Belief Propagation Correction Decodermentioning
confidence: 99%
See 2 more Smart Citations