Sort by
Refine Your Search
-
Listed
-
Category
-
Field
-
: For applications requiring short packets / low latency, it is important to obtain tight bounds for the optimal secrecy rate in finite blocklength. Building on the theoretical breakthrough by Polyanskiy
Searches related to combinatorial optimization
Enter an email to receive alerts for combinatorial-optimization positions