Update efficient codes for error correction
暂无分享,去创建一个
[1] Michael Langberg,et al. Private codes or succinct random codes that are (almost) perfect , 2004, 45th Annual IEEE Symposium on Foundations of Computer Science.
[2] John B. Shoven,et al. I , Edinburgh Medical and Surgical Journal.
[3] Noga Alon,et al. The Probabilistic Method , 2015, Fundamentals of Ramsey Theory.
[4] Alexander Barg,et al. Random codes: Minimum distances and error exponents , 2002, IEEE Trans. Inf. Theory.
[5] Iryna Andriyanova,et al. Some Results on Update Complexity of a Linear Code Ensemble , 2011, 2011 International Symposium on Networking Coding.
[6] Juriaan Simonis,et al. On Generator Matrices of Codes , 1992, IEEE Transactions on Information Theory.
[8] Pedram Pad,et al. Capacity achieving linear codes with random binary sparse generating matrices over the Binary Symmetric Channel , 2011, 2012 IEEE International Symposium on Information Theory Proceedings.
[9] Noga Alon,et al. The Probabilistic Method, Second Edition , 2004 .
[10] Sriram Vishwanath,et al. Update-efficient codes for erasure correction , 2010, 2010 48th Annual Allerton Conference on Communication, Control, and Computing (Allerton).
[11] Nikolai L. Manev,et al. An improvement of the Griesmer bound for some small minimum distances , 1985, Discret. Appl. Math..
[12] Sriram Vishwanath,et al. Update efficient codes for distributed storage , 2011, 2011 IEEE International Symposium on Information Theory Proceedings.
[13] Neil J. Calkin. Dependent Sets of Constant Weight Binary Vectors , 1997, Comb. Probab. Comput..
[14] W. Cary Huffman,et al. Fundamentals of Error-Correcting Codes , 1975 .
[15] F. MacWilliams,et al. The Theory of Error-Correcting Codes , 1977 .
[16] Tor Helleseth. New constructions of codes meeting the Griesmer bound , 1983, IEEE Trans. Inf. Theory.