448 results on '"Michelle Effros"'
Search Results
2. Characterizing positive-rate secure multicast network coding with eavesdropping nodes.
3. Asynchronous Random Access Data Compression.
4. Almost Lossless Onion Peeling Data Compression.
5. Third-Order Analysis of Channel Coding in the Small-to-Moderate Deviations Regime.
6. Variable-Length Sparse Feedback Codes for Point-to-Point, Multiple Access, and Random Access Channels.
7. Perfect vs. Independent Feedback in the Multiple-Access Channel.
8. Characterizing positive-rate key-cast (and multicast network coding) with eavesdropping nodes.
9. Third-order Analysis of Channel Coding in the Moderate Deviations Regime.
10. Source Coding with Unreliable Side Information in the Finite Blocklength Regime.
11. On the Benefit of Cooperation in Relay Networks.
12. Network Coding Multicast Key-Capacity.
13. Multiple Key-cast over Networks.
14. Nested LDPC Codes for Random Access Communication.
15. Every Bit Counts: Second-Order Analysis of Cooperation in the Multiple-Access Channel.
16. Variable-length Feedback Codes with Several Decoding Times for the Gaussian Channel.
17. Edge removal in undirected networks.
18. Nested Sparse Feedback Codes for Point-to-Point, Multiple Access, and Random Access Channels.
19. Gaussian Multiple and Random Access in the Finite Blocklength Regime.
20. Finite-Blocklength and Error-Exponent Analyses for LDPC Codes in Point-to-Point and Multiple Access Communication.
21. Negligible Cooperation: Contrasting the Maximal- and Average-Error Cases.
22. The Birthday Problem and Zero-Error List Codes.
23. Gaussian Multiple and Random Access Channels: Finite-Blocklength Analysis.
24. Random Access Channel Coding in the Finite Blocklength Regime.
25. OUTformation: Distributed Data-Gathering with Feedback under Unknown Environment and Communication Delay Constraints.
26. Lossless Source Coding in the Point-to-Point, Multiple Access, and Random Access Scenarios.
27. Universal Privacy Guarantees for Smart Meters.
28. Secure Network Coding in the Setting in Which a Non-Source Node May Generate Random Keys.
29. A Local Perspective on the Edge Removal Problem.
30. The Edge-Removal Problem's Connections to the Zero-Error and $\delta$ -Dependence Problems in Network Coding.
31. Lossless Source Coding in the Point-to-Point, Multiple Access, and Random Access Scenarios.
32. Can Negligihle Cooperation Increase Capacity? The Average-Error Case.
33. Random Access Channel Coding in the Finite Blocklength Regime.
34. Beyond Capacity: The Joint Time-Rate Region.
35. A code equivalence between streaming network coding and streaming index coding.
36. The benefit of encoder cooperation in the presence of state information.
37. The birthday problem and zero-error list codes.
38. Can Negligible Rate Increase Network Reliability?
39. The Unbounded Benefit of Encoder Cooperation for the $k$ -User MAC.
40. Towards an Operational Definition of Group Network Codes.
41. Edge removal in undirected networks.
42. On the Capacity Advantage of a Single Bit.
43. A characterization of the capacity region for network coding with dependent sources.
44. The unbounded benefit of encoder cooperation for the k-user MAC.
45. On tightness of an entropic region outer bound for network coding and the edge removal property.
46. Can negligible cooperation increase network reliability?
47. On the fundamental limits of caching in combination networks.
48. On the cost and benefit of cooperation.
49. On an equivalence of the reduction of k-unicast to 2-unicast capacity and the edge removal property.
50. Negligible Cooperation: Contrasting the Maximal- and Average-Error Cases.
Catalog
Books, media, physical & digital resources
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.