2018 IEEE 87th Vehicular Technology Conference (VTC Spring) 2018
DOI: 10.1109/vtcspring.2018.8417697
|View full text |Cite
|
Sign up to set email alerts
|

Secure Throughput Optimization of Selective Decode-and-Forward with Finite Blocklength

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
7
0

Year Published

2020
2020
2023
2023

Publication Types

Select...
4
1

Relationship

0
5

Authors

Journals

citations
Cited by 6 publications
(7 citation statements)
references
References 19 publications
0
7
0
Order By: Relevance
“…Theorem 6: n * = N is optimal for maximizing T A in (26). Proof 11: The proof is similar to that of Theorem 1.…”
Section: A Adaptive Optimization Schemementioning
confidence: 93%
See 4 more Smart Citations
“…Theorem 6: n * = N is optimal for maximizing T A in (26). Proof 11: The proof is similar to that of Theorem 1.…”
Section: A Adaptive Optimization Schemementioning
confidence: 93%
“…• Numerous useful insights into the design of secure transmissions are provided with finite blocklength. For example, 1) increasing the blocklength can improve both reliability and secrecy, with properly exploiting the instantaneous CSI of the main channel and the statistical CSI of the wiretap channel, which has not been revealed by existing literature, e.g., [16]- [20]; 2) using the maximal blocklength is profitable for boosting the secrecy throughput, which is distinguished from the observation in [26]; 3) due to the finite blocklength penalty, there is a critical secrecy rate that can maximize the secrecy throughput even for the adaptive scheme, rather than always employing the maximal available secrecy rate, which is fundamentally different from the phenomenon with infinite blocklength, e.g., [21], [22].…”
Section: B Contributionsmentioning
confidence: 97%
See 3 more Smart Citations