17 citations · 43 across the 11 of their papers we have counts for
17 papers · 1 filter
Optimal Quantization for Matrix Multiplication
Or Ordentlich, Yury Polyanskiy
Recent work in machine learning community proposed multiple methods for performing lossy compression (quantization) of large matrices. This quantization is important for accelerati…
Finite-Blocklength Results for the A-channel: Applications to Unsourced Random Access and Group Testing
Alejandro Lancho, Alexander Fengler, Yury Polyanskiy
We present finite-blocklength achievability bounds for the unsourced A-channel. In this multiple-access channel, users noiselessly transmit codewords picked from a common codebook…
Broadcasting on trees near criticality
Yuzhou Gu, Hajir Roozbehani, Yury Polyanskiy
We revisit the problem of broadcasting on -ary trees: starting from a Bernoulli random variable at a root vertex, each vertex forwards its value across binary symme…
Low density majority codes and the problem of graceful degradation
Hajir Roozbehani, Yury Polyanskiy
We study a problem of constructing codes that transform a channel with high bit error rate (BER) into one with low BER (at the expense of rate). Our focus is on obtaining codes wit…
Massive Access for Future Wireless Communication Systems
Yongpeng Wu, Xiqi Gao, Shidong Zhou +3
Multiple access technology played an important role in wireless communication in the last decades: it increases the capacity of the channel and allows different users to access the…
A Note on the Probability of Rectangles for Correlated Binary Strings
Or Ordentlich, Yury Polyanskiy, Ofer Shayevitz
Consider two sequences of independent and identically distributed fair coin tosses, and , which are -correlated for each , i.e. $…