The following pages link to Ari Trachtenberg (Q386045):
Displaying 11 items.
- Deciding unique decodability of bigram counts via finite automata (Q386046) (← links)
- Fair and distributed peer-to-peer allocation of a common, refillable resource (Q897403) (← links)
- Fountain Codes With Nonuniform Selection Distributions Through Feedback (Q2976713) (← links)
- Data verification and reconciliation with generalized error-control codes (Q3547123) (← links)
- Set reconciliation with nearly optimal communication complexity (Q3547377) (← links)
- Identifying Codes and Covering Problems (Q3604840) (← links)
- Full-Rank Tilings of $\mathbbF^8_\!2$ Do Not Exist (Q4443095) (← links)
- Which codes have cycle-free Tanner graphs? (Q4503390) (← links)
- Designing lexicographic codes with a given trellis complexity (Q4544765) (← links)
- Connected Identifying Codes (Q5271843) (← links)
- Channel Sensitivity of LIFO-Backpressure: Quirks and Improvements (Q5358497) (← links)