Subspace synchronization: A network-coding approach to object reconciliation
暂无分享,去创建一个
[1] George Varghese,et al. Biff (Bloom filter) codes: Fast error correction for large data sets , 2012, 2012 IEEE International Symposium on Information Theory Proceedings.
[2] Frank R. Kschischang,et al. Coding for Errors and Erasures in Random Network Coding , 2008, IEEE Trans. Inf. Theory.
[3] Michael T. Goodrich,et al. Invertible bloom lookup tables , 2011, 2011 49th Annual Allerton Conference on Communication, Control, and Computing (Allerton).
[4] R. Koetter,et al. An algebraic approach to network coding , 2001, Proceedings. 2001 IEEE International Symposium on Information Theory (IEEE Cat. No.01CH37252).
[5] George Varghese,et al. The complexity of object reconciliation, and open problems related to set difference and coding , 2012, 2012 50th Annual Allerton Conference on Communication, Control, and Computing (Allerton).
[6] Rudolf Ahlswede,et al. Network information flow , 2000, IEEE Trans. Inf. Theory.
[7] What's the difference?: efficient set reconciliation without prior context , 2011, SIGCOMM.
[8] Yaron Minsky,et al. Set reconciliation with nearly optimal communication complexity , 2003, IEEE Trans. Inf. Theory.