Articles with public access mandates - Michelle EffrosLearn more
Not available anywhere: 4
On tightness of an entropic region outer bound for network coding and the edge removal property
MF Wong, M Effros, M Langberg
2016 IEEE International Symposium on Information Theory (ISIT), 1769-1773, 2016
Mandates: US National Science Foundation
A characterization of the capacity region for network coding with dependent sources
W Kim, M Langberg, M Effros
2016 IEEE International Symposium on Information Theory (ISIT), 1764-1768, 2016
Mandates: US National Science Foundation
A code equivalence between streaming network coding and streaming index coding
MF Wong, M Effros, M Langberg
2017 IEEE International Symposium on Information Theory (ISIT), 1638-1642, 2017
Mandates: US National Science Foundation
Asynchronous Random Access Data Compression
S Sun, M Effros
2024 Data Compression Conference (DCC), 482-491, 2024
Mandates: US National Science Foundation
Available somewhere: 28
Random access channel coding in the finite blocklength regime
RC Yavas, V Kostina, M Effros
IEEE Transactions on Information Theory 67 (4), 2115-2140, 2020
Mandates: US National Science Foundation
Gaussian multiple and random access channels: Finite-blocklength analysis
RC Yavas, V Kostina, M Effros
IEEE Transactions on Information Theory 67 (11), 6983-7009, 2021
Mandates: US National Science Foundation
Lossless source coding in the point-to-point, multiple access, and random access scenarios
S Chen, M Effros, V Kostina
IEEE Transactions on Information Theory 66 (11), 6688-6722, 2020
Mandates: US National Science Foundation
Random access channel coding in the finite blocklength regime
M Effros, V Kostina, RC Yavas
2018 IEEE International Symposium on Information Theory (ISIT), 1261-1265, 2018
Mandates: US National Science Foundation
The unbounded benefit of encoder cooperation for the k-user MAC
P Noorzad, M Effros, M Langberg
IEEE Transactions on Information Theory 64 (5), 3655-3678, 2017
Mandates: US National Science Foundation
Variable-length feedback codes with several decoding times for the Gaussian channel
RC Yavas, V Kostina, M Effros
2021 IEEE International Symposium on Information Theory (ISIT), 1883-1888, 2021
Mandates: US National Science Foundation
Gaussian multiple and random access in the finite blocklength regime
RC Yavas, V Kostina, M Effros
2020 Information Theory and Applications Workshop (ITA), 1-25, 2020
Mandates: US National Science Foundation
On the capacity advantage of a single bit
M Langberg, M Effros
2016 IEEE Globecom Workshops (GC Wkshps), 1-6, 2016
Mandates: US National Science Foundation
Variable-length sparse feedback codes for point-to-point, multiple access, and random access channels
RC Yavas, V Kostina, M Effros
IEEE Transactions on Information Theory 70 (4), 2367-2394, 2023
Mandates: US National Science Foundation
Third-order analysis of channel coding in the moderate deviations regime
RC Yavas, V Kostina, M Effros
2022 IEEE International Symposium on Information Theory (ISIT), 2309-2314, 2022
Mandates: US National Science Foundation
Finite-blocklength and error-exponent analyses for LDPC codes in point-to-point and multiple access communication
Y Liu, M Effros
2020 IEEE International Symposium on Information Theory (ISIT), 361-366, 2020
Mandates: US National Science Foundation
Secure network coding in the setting in which a non-source node may generate random keys
D Chaudhuri, M Langberg, M Effros
2019 IEEE International Symposium on Information Theory (ISIT), 2309-2313, 2019
Mandates: US National Science Foundation
Can negligible cooperation increase network reliability?
P Noorzad, M Effros, M Langberg
2016 IEEE International Symposium on Information Theory (ISIT), 1784-1788, 2016
Mandates: US National Science Foundation
Can negligible rate increase network reliability?
P Noorzad, M Effros, M Langberg
IEEE Transactions on Information Theory 64 (6), 4282-4293, 2017
Mandates: US National Science Foundation
Network coding multicast key-capacity
M Langberg, M Effros
2022 IEEE Information Theory Workshop (ITW), 422-427, 2022
Mandates: US National Science Foundation
The birthday problem and zero-error list codes
P Noorzad, M Effros, M Langberg, V Kostina
IEEE Transactions on Information Theory 67 (9), 5791-5803, 2021
Mandates: US National Science Foundation
Publication and funding information is determined automatically by a computer program