14 papers
Improved Torn Paper Coding via Local Alignment
Junsheng Liu, Netanel Raviv
In the torn paper channel, a transmitted codeword is broken at random locations into fragments that arrive at the decoder in an unordered manner. A central theoretical challenge wi…
Closed-Form Gaussian Estimators for Multi-Source Partial Information Decomposition
Aobo Lyu, Andrew Clark, Netanel Raviv
Computing multi-source partial information decomposition (PID) for continuous data is hard: existing closed-form Gaussian estimators are restricted to two source variables, while c…
Efficient Vector Symbolic Architectures from Histogram Recovery
Zirui Deng, Netanel Raviv
Vector symbolic architectures (VSAs) are a family of information representation techniques which enable composition, i.e., creating complex information structures from atomic vecto…
Structural Impossibility of Antichain-Lattice Partial Information Decomposition
Aobo Lyu, Andrew Clark, Netanel Raviv
Partial Information Decomposition (PID) represents multivariate mutual information via antichain-lattice that aims to specify which source groups can recover which informational co…
Multivariate Partial Information Decomposition: Constructions, Inconsistencies, and Alternative Measures
Aobo Lyu, Andrew Clark, Netanel Raviv
While mutual information effectively quantifies dependence between two variables, it does not by itself reveal the complex, fine-grained interactions among variables, i.e., how mul…
Break-Resilient Codes with Loss Tolerance
Canran Wang, Minghui Liwang, Netanel Raviv
Emerging applications in manufacturing, wireless communication, and molecular data storage require robust coding schemes that remain effective under physical distortions where code…