The following pages link to Negar Kiyavash (Q393364):
Displayed 17 items.
- On the Varshamov-Tenengolts construction on binary strings (Q393366) (← links)
- Restricted Composition Deletion Correcting Codes (Q2976605) (← links)
- Generalized Sphere-Packing Bounds on the Size of Codes for Combinatorial Channels (Q2976660) (← links)
- Directed Information Graphs (Q2977194) (← links)
- Delay-Privacy Tradeoff in the Design of Scheduling Policies (Q2978626) (← links)
- An Improvement to Levenshtein's Upper Bound on the Cardinality of Deletion Correcting Codes (Q2986258) (← links)
- Fingerprinting With Equiangular Tight Frames (Q2989386) (← links)
- (Q3413070) (← links)
- Designing Router Scheduling Policies: A Privacy Perspective (Q4573642) (← links)
- (Q4969079) (← links)
- Asymptotic analysis for multi-objective sequential stochastic assignment problems (Q5086480) (← links)
- (Q5134628) (← links)
- Nonasymptotic Upper Bounds for Deletion Correcting Codes (Q5346436) (← links)
- Learning Minimal Latent Directed Information Polytrees (Q5380561) (← links)
- Two Approaches to the Construction of Deletion Correcting Codes: Weight Partitioning and Optimal Colorings (Q6237234) (← links)
- Counting and Sampling from Markov Equivalent DAGs Using Clique Trees (Q6297317) (← links)
- Sharp Analysis of Stochastic Optimization under Global Kurdyka-{\L}ojasiewicz Inequality (Q6412902) (← links)