The following pages link to Muriel Médard (Q259275):
Displaying 50 items.
- The one-out-of-\(k\) retrieval problem and linear network coding (Q259276) (← links)
- (Q518681) (redirect page) (← links)
- A coded shared atomic memory algorithm for message passing architectures (Q518683) (← links)
- Bounded-contention coding for the additive network model (Q748114) (← links)
- Coding for locality in reconstructing permutations (Q1696052) (← links)
- Coding and control for communication networks (Q2269497) (← links)
- Capacity Scaling Laws for Underwater Networks (Q2809573) (← links)
- Alignment-Based Network Coding for Two-Unicast-Z Networks (Q2976768) (← links)
- Scalable Capacity Bounding Models for Wireless Networks (Q2977048) (← links)
- Multi-User Guesswork and Brute Force Security (Q2977192) (← links)
- On Network Functional Compression (Q2986155) (← links)
- Deterministic Network Model Revisited: An Algebraic Network Coding Approach (Q2986228) (← links)
- A Theory of Network Equivalence – Part II: Multiterminal Channels (Q2986243) (← links)
- The One-Out-of-k Retrieval Problem and Linear Network Coding (Q3460449) (← links)
- (Q3546631) (← links)
- (Q3546780) (← links)
- An Information-Theoretic View of Network Management (Q3547016) (← links)
- Minimum-Cost Multicast over Coded Packet Networks (Q3547302) (← links)
- Capacity of nearly decomposable Markovian fading channels under asymmetric receiver-sender side information (Q3547365) (← links)
- Low-Complexity Approaches to Slepian–Wolf Near-Lossless Distributed Data Compression (Q3547975) (← links)
- On Noncoherent MIMO Channels in the Wideband Regime: Capacity and Reliability (Q3548831) (← links)
- Channel Coherence in the Low-SNR Regime (Q3548839) (← links)
- Resilient Network Coding in the Presence of Byzantine Adversaries (Q3604533) (← links)
- Byzantine Modification Detection in Multicast Networks With Random Network Coding (Q3604604) (← links)
- On the Delay and Throughput Gains of Coding in Unreliable Networks (Q3604946) (← links)
- The effect upon channel capacity in wireless communications of perfect and imperfect knowledge of the channel (Q4545765) (← links)
- Feedback-Based Online Network Coding (Q4566517) (← links)
- Time-Stampless Adaptive Nonuniform Sampling for Stochastic Signals (Q4574070) (← links)
- Backward Adaptation for Power Efficient Sampling (Q4579399) (← links)
- (Q4650826) (← links)
- Bandwidth scaling for fading multipath channels (Q4674462) (← links)
- Bounded-Contention Coding for Wireless Networks in the High SNR Regime (Q4909404) (← links)
- Repeat-Free Codes (Q4958262) (← links)
- Boolean Functions: Noise Stability, Non-Interactive Correlation Distillation, and Mutual Information (Q4963929) (← links)
- Joint Base-Calling of Two DNA Sequences With Factor Graphs (Q4976008) (← links)
- Serial Quantization for Sparse Time Sequences (Q5103620) (← links)
- Privacy With Estimation Guarantees (Q5211556) (← links)
- A Characterization of Guesswork on Swiftly Tilting Curves (Q5223975) (← links)
- Capacity-Achieving Guessing Random Additive Noise Decoding (Q5224052) (← links)
- Gaussian Intersymbol Interference Channels With Mismatch (Q5224088) (← links)
- Blind Group Testing (Q5224130) (← links)
- On Coding for Delay—Network Coding for Time-Division Duplexing (Q5272017) (← links)
- Multihop Analog Network Coding via Amplify-and-Forward: The High SNR Regime (Q5272106) (← links)
- The Scientific Legacy of Ralf Koetter (Q5281062) (← links)
- A Theory of Network Equivalence— Part I: Point-to-Point Channels (Q5281088) (← links)
- Minimum Cost Mirror Sites Using Network Coding: Replication versus Coding at the Source Nodes (Q5281097) (← links)
- Network Coding in a Multicast Switch (Q5281139) (← links)
- On Resource Allocation in Fading Multiple-Access Channels–An Efficient Approximate Projection Approach (Q5281302) (← links)
- Functional Compression Through Graph Coloring (Q5281350) (← links)
- Convergence Study of Decentralized Min-Cost Subgraph Algorithms for Multicast in Coded Networks (Q5346170) (← links)
