2024 · paper
An Upper Bound on the Reliability Function of Discrete Memoryless Channels
Derives an upper bound for the reliability function of discrete memoryless channels.[87]
Information theory and channel coding
Anelia Somekh-Baruch
ענליה סומך ברוך
Identity: verifiedThe BIU research portal uses Anelia Somekh-Baruch and matches the Hebrew roster. [87]
Documented foundation
Research & experience
Somekh-Baruch studies information and communication theory, including coding limits, reliability, and mismatched decoding.[87]
channel codingmismatched decodingreliability functionscommunication theory
CV and official profile
The BIU profile and its career/output record were inspected; no standalone current CV was verified.[87]
Selected work
Representative records, not a complete publication list. Metadata confirms attribution; it does not independently replicate a result.
Patent evidence
0 catalogued patent records
Coverage: No attributable record found in this search
Hyphenated and unhyphenated name searches and BIU career profile inspected; no attributable inventor entry established. Technion, Tel-Aviv and Princeton history was considered. Research-output labels and search outcomes do not prove no patents.
No publication records verified in this search; this does not establish absence of patents.
Original report snapshot
Original evidence: not verified
No attributable patent record was verified in the bounded search.
Records are counted separately from identified families. Author-reported entries are labelled and may still need publication verification. Inventorship, publication-time applicant and current ownership are different facts. No legal-status, patentability or freedom-to-operate conclusion is made.
Scores prioritize research fit from 1–10; they are not probabilities.
Review: Reviewed with limitations
Proposed capability matches, not confirmed relationships. Scores are analyst judgments with low forecast confidence; researcher interests, capacity and feasibility need confirmation.
Internal connections
11 candidates
Connection 1
Ran Gelles
Original proposal
Proposal hypothesis: Gelles's interactive protocols and Somekh-Baruch's reliability and mismatched-decoding theory meet on guarantees that survive imperfect channel knowledge.[57][58][87]
First test and score details
First test
Proposed first test: For one finite-alphabet channel, compare a simulated interactive protocol with a stated coding bound as decoder mismatch increases.
Score components
- complementarity
- 3
- feasible first test
- 3
- topic overlap
- 4
Why this rank
Rank 1/11; fit 10/10 (4 topic overlap + 3 complementarity + 3 feasible first test). Preserved original co-membership proposal in o08. No strictly higher-scoring candidate displaces this original. Bounds and simulation answer different questions; agreement in a small example is not a general proof. No automatic score boost for original membership. Equal scores use existing-first, then stable researcher ID.
Conditions
Analyst proposal hypothesis, not an established collaboration, commitment, evidence-confidence rating or assessment of researcher quality; confirm participation and access before work.
Connection 2
Ephraim Zehavi
Original proposal
Proposal hypothesis: Zehavi's coded-modulation practice and Somekh-Baruch's channel-coding theory directly meet on implementation penalties under decoder mismatch.[19][20][87]
First test and score details
First test
Proposed first test: Compare two coded-modulation decoders on a fixed synthetic channel, plotting achieved error rates against the relevant theoretical bound.
Score components
- complementarity
- 2
- feasible first test
- 3
- topic overlap
- 4
Why this rank
Rank 2/11; fit 9/10 (4 topic overlap + 2 complementarity + 3 feasible first test). Preserved original co-membership proposal in o08. Higher-scoring Ran Gelles (10/10) precedes this original; its own rank reflects the following limitation: Strong topic overlap but overlapping coding roles reduce complementarity; no measured-channel dataset is presumed. No automatic score boost for original membership. Equal scores use existing-first, then stable researcher ID.
Conditions
Analyst proposal hypothesis, not an established collaboration, commitment, evidence-confidence rating or assessment of researcher quality; confirm participation and access before work.
Connection 3
Moti Medina
Original proposal
Proposal hypothesis: Somekh-Baruch can formalize channel reliability limits while Medina models how network and hardware recovery amplify or contain decoder errors.[87][100]
First test and score details
First test
Proposed first test: Combine a finite-state faulty-node model with a mismatched decoder and compare end-to-end task failure against link-error rate alone.
Score components
- complementarity
- 3
- feasible first test
- 3
- topic overlap
- 3
Why this rank
Rank 3/11; fit 9/10 (3 topic overlap + 3 complementarity + 3 feasible first test). Preserved original co-membership proposal in o08. Higher-scoring Ran Gelles (10/10) precedes this original; its own rank reflects the following limitation: The proposed bridge depends on explicitly bounded fault dependence and cannot promise arbitrary-fault tolerance. No automatic score boost for original membership. Equal scores use existing-first, then stable researcher ID.
Conditions
Analyst proposal hypothesis, not an established collaboration, commitment, evidence-confidence rating or assessment of researcher quality; confirm participation and access before work.
Show 8 moreShow fewer internal connections
Connection 4
Benjamin M. Zaidel
Proposal hypothesis: Somekh-Baruch's reliability and decoding theory and Zaidel's multiuser information theory directly meet on mismatched multiuser reception.[87][102]
First test and score details
First test
Proposed first test: Compare two decoders in a fixed sparse multiuser channel and report achievable rate and error under model mismatch.
Score components
- complementarity
- 2
- feasible first test
- 3
- topic overlap
- 4
Why this rank
Rank 4/11; fit 9/10 (4 topic overlap + 2 complementarity + 3 feasible first test). New pairing outside the frozen portfolio co-member graph. Strong topic overlap but partly redundant theoretical roles reduce complementarity. Equal scores use existing-first, then stable researcher ID.
Conditions
Analyst proposal hypothesis, not an established collaboration, commitment, evidence-confidence rating or assessment of researcher quality; confirm participation and access before work.
Connection 5
Amir Weiss
Proposal hypothesis: Somekh-Baruch's information-theoretic coding limits can constrain Amir Weiss's task-oriented compressed sensing messages.[87][108][109]
First test and score details
First test
Proposed first test: Compare two quantized delay-estimation encodings on rate and estimation loss across a finite-alphabet noisy channel.
Score components
- complementarity
- 3
- feasible first test
- 3
- topic overlap
- 3
Why this rank
Rank 5/11; fit 9/10 (3 topic overlap + 3 complementarity + 3 feasible first test). New pairing outside the frozen portfolio co-member graph. A communication reliability bound is not directly a bound on sensing-task quality. Equal scores use existing-first, then stable researcher ID.
Conditions
Analyst proposal hypothesis, not an established collaboration, commitment, evidence-confidence rating or assessment of researcher quality; confirm participation and access before work.
Connection 6
Amir Leshem
Proposal hypothesis: Somekh-Baruch can bound coding reliability while Leshem adapts wireless resources under uncertain and congested conditions.[87][111][112]
First test and score details
First test
Proposed first test: Simulate an adaptive link policy with a mismatched decoder and compare empirical reliability to an explicitly applicable bound.
Score components
- complementarity
- 3
- feasible first test
- 3
- topic overlap
- 3
Why this rank
Rank 6/11; fit 9/10 (3 topic overlap + 3 complementarity + 3 feasible first test). New pairing outside the frozen portfolio co-member graph. A policy cannot inherit a bound outside its channel assumptions. Equal scores use existing-first, then stable researcher ID.
Conditions
Analyst proposal hypothesis, not an established collaboration, commitment, evidence-confidence rating or assessment of researcher quality; confirm participation and access before work.
Connection 7
Yair Noam
Proposal hypothesis: Somekh-Baruch's mismatched-decoding analysis can quantify penalties from Noam's imperfect interference estimates.[87][130][131]
First test and score details
First test
Proposed first test: Sweep interference-estimation error in a synthetic channel and compare decoder error rates with matched-decoder and bound references.
Score components
- complementarity
- 3
- feasible first test
- 3
- topic overlap
- 3
Why this rank
Rank 7/11; fit 9/10 (3 topic overlap + 3 complementarity + 3 feasible first test). New pairing outside the frozen portfolio co-member graph. Estimation error distribution must be specified; satellite conditions are not automatically covered. Equal scores use existing-first, then stable researcher ID.
Conditions
Analyst proposal hypothesis, not an established collaboration, commitment, evidence-confidence rating or assessment of researcher quality; confirm participation and access before work.
Connection 8
Shimrit Shtern
Identity check needed: Conditional proposal: confirm the researcher identity and research interests before assessing this match.
Proposal hypothesis: Conditional on confirmation, Shtern's optimization methods could explore finite-dimensional bounds motivated by Somekh-Baruch's mismatched-decoding questions.[83][84][85][87]
First test and score details
First test
Conditional proposed first test: After identity confirmation, solve a small stated channel-bound optimization under parameter uncertainty and compare to exhaustive enumeration.
Score components
- complementarity
- 3
- feasible first test
- 2
- topic overlap
- 2
Why this rank
Rank 8/11; fit 7/10 (2 topic overlap + 3 complementarity + 2 feasible first test). New pairing outside the frozen portfolio co-member graph. Robust optimization is not itself information-theoretic expertise; the channel formulation belongs to Somekh-Baruch. Equal scores use existing-first, then stable researcher ID.
Conditions
Analyst proposal hypothesis, not an established collaboration, commitment, evidence-confidence rating or assessment of researcher quality; confirm participation and access before work. Conditional: confirm Shimrit Shtern identity mapping and current institutional affiliation before any internal team assignment. The BIU directory and current Technion appointment leave affiliation unresolved. Documented optimization expertise is conditional on that mapping; excluded from confirmed-team claims.
Connection 9
Alex Fish
Proposal hypothesis: Fish's memory readout circuits and Somekh-Baruch's decoding theory could test tolerance to an uncertain sensing threshold.[87][89][90]
First test and score details
First test
Proposed first test: Model a bounded readout channel with threshold drift and compare fixed and mismatch-aware decoding on error and extra operations.
Score components
- complementarity
- 3
- feasible first test
- 2
- topic overlap
- 2
Why this rank
Rank 9/11; fit 7/10 (2 topic overlap + 3 complementarity + 2 feasible first test). New pairing outside the frozen portfolio co-member graph. No physical-memory reliability guarantee follows without measured error statistics. Equal scores use existing-first, then stable researcher ID.
Conditions
Analyst proposal hypothesis, not an established collaboration, commitment, evidence-confidence rating or assessment of researcher quality; confirm participation and access before work.
Connection 10
Adam Teman
Proposal hypothesis: Teman can expose memory read-error statistics while Somekh-Baruch asks whether a mismatched-decoding model captures their effect.[1][87]
First test and score details
First test
Proposed first test: Treat a small memory-read channel as a stated finite-alphabet model and compare two decoders under drift in error probabilities.
Score components
- complementarity
- 3
- feasible first test
- 2
- topic overlap
- 1
Why this rank
Rank 10/11; fit 6/10 (1 topic overlap + 3 complementarity + 2 feasible first test). New pairing outside the frozen portfolio co-member graph. Classical channel models may omit correlated circuit faults, making this an exploratory abstraction. Equal scores use existing-first, then stable researcher ID.
Conditions
Analyst proposal hypothesis, not an established collaboration, commitment, evidence-confidence rating or assessment of researcher quality; confirm participation and access before work.
Connection 11
Eliahu Cohen
Proposal hypothesis: Somekh-Baruch's coding limits could help distinguish communication reliability from Eliahu Cohen's quantum-measurement information claims.[87][113][114]
First test and score details
First test
Proposed first test: For a small measurement-induced classical channel, compare two decoders and the relevant classical reliability bound.
Score components
- complementarity
- 3
- feasible first test
- 2
- topic overlap
- 1
Why this rank
Rank 11/11; fit 6/10 (1 topic overlap + 3 complementarity + 2 feasible first test). New pairing outside the frozen portfolio co-member graph. Somekh-Baruch's cited expertise is classical coding; quantum-channel expertise is not inferred. Equal scores use existing-first, then stable researcher ID.
Conditions
Analyst proposal hypothesis, not an established collaboration, commitment, evidence-confidence rating or assessment of researcher quality; confirm participation and access before work.
External connections
10 candidates
Connection 1
Robert Calderbank
Duke University
Proposed capability match: Anelia Somekh-Baruch's channel coding, mismatched decoding can be paired with Robert Calderbank's documented space-time coding, quantum error correction for adaptive reliability bounds for heterogeneous links. The specific contribution is structured redundancy and error correction; this transfer is an analyst hypothesis.[87][444]
First test and score details
First test
Compare structured coding with a repetition baseline under a fixed corruption/noise model using a finite-block-length channel simulation with decoder mismatch and changing error regimes. Compare error rate, decoding cost and redundancy budget with a matched-channel decoder and standard retransmission baseline.
Score components
- complementarity
- 3
- feasible first test
- 3
- topic overlap
- 4
Why this rank
Rank 1/10 after semantic revision; analyst score 10 = max(1, 4+3+3): topic overlap 4/4, complementarity 3/3, feasible first test 3/3. A bounded offline comparison is specified; required datasets and domain assumptions must still be checked.
Conditions
Proposed fit, not an assertion of a new or active relationship. Independent review pending; forecast confidence low. Partner interest, capacity, data access and any required experimental approvals/resources are unverified.
Connection 2
Elza Erkip
New York University
Proposed capability match: Anelia Somekh-Baruch's channel coding, mismatched decoding can be paired with Elza Erkip's documented information theory, communication theory for adaptive reliability bounds for heterogeneous links. The specific contribution is wireless channel and reliability analysis; this transfer is an analyst hypothesis.[87][451]
First test and score details
First test
Compare two cooperative or non-cooperative link models with matched rate and power constraints using a finite-block-length channel simulation with decoder mismatch and changing error regimes. Compare outage probability, achievable rate and power sensitivity with a matched-channel decoder and standard retransmission baseline.
Score components
- complementarity
- 3
- feasible first test
- 3
- topic overlap
- 4
Why this rank
Rank 2/10 after semantic revision; analyst score 10 = max(1, 4+3+3): topic overlap 4/4, complementarity 3/3, feasible first test 3/3. A bounded offline comparison is specified; required datasets and domain assumptions must still be checked.
Conditions
Proposed fit, not an assertion of a new or active relationship. Independent review pending; forecast confidence low. Partner interest, capacity, data access and any required experimental approvals/resources are unverified.
Connection 3
Muriel Medard
Massachusetts Institute of Technology
Original proposal
Her network-coding and reliable optical/wireless communication work could complement end-to-end coding architecture and implementation; no willingness is asserted.[87][88][474]
First test and score details
First test
Use a reproducible two-state burst-error channel with declared transition probabilities and finite block length. Compare fixed-rate and adaptive coding on identical seeded channel realizations at matched redundancy and latency budgets; report block-error rate and recovery after a state change. Measured traces are a later validation stage after their provenance and suitability are confirmed.
Score components
- complementarity
- 3
- feasible first test
- 2
- topic overlap
- 4
Why this rank
Rank 3/10 after semantic revision; analyst score 9 = max(1, 4+3+2): topic overlap 4/4, complementarity 3/3, feasible first test 2/3. Channel coding is a direct fit, but a synthetic channel is the bounded first test until usable measured traces are identified. A bounded offline comparison is specified; required datasets and domain assumptions must still be checked. Original retained exactly at rank 3; preceding alternatives are Robert Calderbank (10; 4+3+3), Elza Erkip (10; 4+3+3). Its first stage now has explicit unconfirmed platform, protocol or interface prerequisites; higher totals reflect the other scoped tests, not comparative researcher quality.
Conditions
Proposed fit, not an assertion of a new or active relationship. Independent review pending; forecast confidence low. Partner interest, capacity, data access and any required experimental approvals/resources are unverified. Post-review scope: Channel coding is a direct fit, but a synthetic channel is the bounded first test until usable measured traces are identified. This revised proposal awaits independent targeted re-review; simulated outcomes would establish model behavior only, not biological, clinical or deployed benefit.
Show 7 moreShow fewer external connections
Connection 4
Andrea Goldsmith
Stony Brook University
Proposed capability match: Anelia Somekh-Baruch's channel coding, mismatched decoding can be paired with Andrea Goldsmith's documented wireless communications, information theory for adaptive reliability bounds for heterogeneous links. The specific contribution is wireless-system models and information limits; this transfer is an analyst hypothesis.[21][87][103][456]
First test and score details
First test
Compare resource or interference policies against a non-adaptive communication baseline at fixed channel assumptions using a finite-block-length channel simulation with decoder mismatch and changing error regimes. Compare throughput, latency, energy and fairness across users with a matched-channel decoder and standard retransmission baseline.
Score components
- complementarity
- 3
- feasible first test
- 3
- topic overlap
- 3
Why this rank
Rank 4/10 after semantic revision; analyst score 9 = max(1, 3+3+3): topic overlap 3/4, complementarity 3/3, feasible first test 3/3. A bounded offline comparison is specified; required datasets and domain assumptions must still be checked.
Conditions
Proposed fit, not an assertion of a new or active relationship. Independent review pending; forecast confidence low. Partner interest, capacity, data access and any required experimental approvals/resources are unverified.
Connection 5
Bernhard Haeupler
ETH Zurich and INSAIT
Proposed capability match: Anelia Somekh-Baruch's channel coding, mismatched decoding can be paired with Bernhard Haeupler's documented interactive coding, distributed algorithms for adaptive reliability bounds for heterogeneous links. The specific contribution is noise-resilient distributed protocols; this transfer is an analyst hypothesis.[59][87][459]
First test and score details
First test
Simulate message corruption and dropped participants with a fixed communication budget using a finite-block-length channel simulation with decoder mismatch and changing error regimes. Compare correct-completion rate and communication overhead with a matched-channel decoder and standard retransmission baseline.
Score components
- complementarity
- 3
- feasible first test
- 3
- topic overlap
- 3
Why this rank
Rank 5/10 after semantic revision; analyst score 9 = max(1, 3+3+3): topic overlap 3/4, complementarity 3/3, feasible first test 3/3. A bounded offline comparison is specified; required datasets and domain assumptions must still be checked.
Conditions
Proposed fit, not an assertion of a new or active relationship. Independent review pending; forecast confidence low. Partner interest, capacity, data access and any required experimental approvals/resources are unverified.
Connection 6
Gregory Wornell
Massachusetts Institute of Technology
Proposed capability match: Anelia Somekh-Baruch's channel coding, mismatched decoding can be paired with Gregory Wornell's documented signal processing, statistical inference for adaptive reliability bounds for heterogeneous links. The specific contribution is joint statistical inference and information constraints; this transfer is an analyst hypothesis.[87][110][503]
First test and score details
First test
Compare full-data inference with task-specific compressed statistics at fixed communication or storage budget using a finite-block-length channel simulation with decoder mismatch and changing error regimes. Compare estimation error, calibration and bits per valid decision with a matched-channel decoder and standard retransmission baseline.
Score components
- complementarity
- 3
- feasible first test
- 3
- topic overlap
- 3
Why this rank
Rank 6/10 after semantic revision; analyst score 9 = max(1, 3+3+3): topic overlap 3/4, complementarity 3/3, feasible first test 3/3. A bounded offline comparison is specified; required datasets and domain assumptions must still be checked.
Conditions
Proposed fit, not an assertion of a new or active relationship. Independent review pending; forecast confidence low. Partner interest, capacity, data access and any required experimental approvals/resources are unverified.
Connection 7
Michael Mitzenmacher
Harvard University
Proposed capability match: Anelia Somekh-Baruch's channel coding, mismatched decoding can be paired with Michael Mitzenmacher's documented algorithms and theory, systems and networks for adaptive reliability bounds for heterogeneous links. The specific contribution is algorithmic and systems baselines; this transfer is an analyst hypothesis.[87][101][478]
First test and score details
First test
Compare two explicit sampling, load-balancing or scheduling algorithms under the same adversarial event trace using a finite-block-length channel simulation with decoder mismatch and changing error regimes. Compare tail latency, failure rate and sensitivity to the event distribution with a matched-channel decoder and standard retransmission baseline.
Score components
- complementarity
- 3
- feasible first test
- 3
- topic overlap
- 2
Why this rank
Rank 7/10 after semantic revision; analyst score 8 = max(1, 2+3+3): topic overlap 2/4, complementarity 3/3, feasible first test 3/3. A bounded offline comparison is specified; required datasets and domain assumptions must still be checked.
Conditions
Proposed fit, not an assertion of a new or active relationship. Independent review pending; forecast confidence low. Partner interest, capacity, data access and any required experimental approvals/resources are unverified.
Connection 8
David Tse
Stanford University
Proposed capability match: Anelia Somekh-Baruch's channel coding, mismatched decoding can be paired with David Tse's documented information-theoretic methods, decentralized systems for adaptive reliability bounds for heterogeneous links. The specific contribution is first-principles data and decentralized-system modelling; this transfer is an analyst hypothesis.[87][496]
First test and score details
First test
Compare a decentralized or information-constrained algorithm with a centralized reference on a small reproducible workload using a finite-block-length channel simulation with decoder mismatch and changing error regimes. Compare communication cost, correctness and sensitivity to missing participants with a matched-channel decoder and standard retransmission baseline.
Score components
- complementarity
- 2
- feasible first test
- 3
- topic overlap
- 3
Why this rank
Rank 8/10 after semantic revision; analyst score 8 = max(1, 3+2+3): topic overlap 3/4, complementarity 2/3, feasible first test 3/3. A bounded offline comparison is specified; required datasets and domain assumptions must still be checked.
Conditions
Proposed fit, not an assertion of a new or active relationship. Independent review pending; forecast confidence low. Partner interest, capacity, data access and any required experimental approvals/resources are unverified. His refreshed lab page describes wireless as a previous application and current work on decentralized systems; no active wireless project is assumed.
Connection 9
Andrea Montanari
Stanford University
Proposed capability match for Anelia Somekh-Baruch with Andrea Montanari: High-dimensional estimation complements mismatched decoding through an explicit channel target and downstream error metric; estimation and coding controls must share a channel.[87][479]
First test and score details
First test
Generate finite-length transmissions through a channel with unknown gain and a declared burst-noise state. Estimate gain/state from pilots using regularized and unregularized estimators, then use the same mismatched decoder for both. Compare parameter error and decoded block-error rate with a known-channel reference on identical transmissions.
Score components
- complementarity
- 3
- feasible first test
- 2
- topic overlap
- 2
Why this rank
Rank 9/10 after semantic revision; analyst score 7 = max(1, 2+3+2): topic overlap 2/4, complementarity 3/3, feasible first test 2/3. High-dimensional estimation complements mismatched decoding through an explicit channel target and downstream error metric; estimation and coding controls must share a channel. A bounded offline comparison is specified; required datasets and domain assumptions must still be checked.
Conditions
Proposed fit, not an assertion of a new or active relationship. Independent review pending; forecast confidence low. Partner interest, capacity, data access and any required experimental approvals/resources are unverified. Post-review scope: High-dimensional estimation complements mismatched decoding through an explicit channel target and downstream error metric; estimation and coding controls must share a channel. This revised proposal awaits independent targeted re-review; simulated outcomes would establish model behavior only, not biological, clinical or deployed benefit.
Connection 10
Jan M. Rabaey
University of California, Berkeley
Proposed capability match: Anelia Somekh-Baruch's channel coding, mismatched decoding can be paired with Jan M. Rabaey's documented low-power integrated circuits, wireless sensor systems for adaptive reliability bounds for heterogeneous links. The specific contribution is acquisition, computation and radio power budgeting; this transfer is an analyst hypothesis.[4][87][488]
First test and score details
First test
Replay two duty-cycle policies across the acquisition, compute and radio stages using a finite-block-length channel simulation with decoder mismatch and changing error regimes. Compare energy per valid result and recovery latency with a matched-channel decoder and standard retransmission baseline.
Score components
- complementarity
- 3
- feasible first test
- 2
- topic overlap
- 2
Why this rank
Rank 10/10 after semantic revision; analyst score 7 = max(1, 2+3+2): topic overlap 2/4, complementarity 3/3, feasible first test 2/3. The experiment, numerical inputs or identity/scope needs confirmation before execution.
Conditions
Proposed fit, not an assertion of a new or active relationship. Independent review pending; forecast confidence low. Partner interest, capacity, data access and any required experimental approvals/resources are unverified.
Evidence & open questions
- No standalone CV or attributable patent record was verified.
Inspect claim ratings and independent review
Anelia Somekh-Baruch has source-grounded capabilities in information theory and channel coding, represented here by channel coding, mismatched decoding, reliability functions. [87]
Moderate confidenceReview: reviewedThe sources establish public professional activity, not comparative quality, future performance, or willingness to participate.
Review record
- profiles_a: supports. The BIU CRIS profile directly identifies Somekh-Baruch's information and communication theory, channel coding, mismatched decoding and reliability-function research.
Hypothesis for 2027–2031: Anelia Somekh-Baruch could explore adaptive reliability bounds for heterogeneous links through the bounded first test described in this profile. [87][88]
Low confidenceReview: reviewedReal channels may violate memoryless or decoder-mismatch assumptions.
Review record
- profiles_a: supports. The proposal is a bounded theoretical extension of source-confirmed reliability and mismatched-decoding work, paired with Medard's documented network-coding and reliable-communications program.