What is the proof of lemma 4.3 in this paper?http://u.cs.biu.ac.il/~porately/papers/submission_24.pdfThat is, how does it follow from 4.1 and 4.2?Also, why is the constant 8 necessary? How is it used in a way that 1 wouldn't be enough?There's an LNCS version too, but it also doesn't spell out the proof. There are slides, but they don't seem to be stand-alone:www.cs.ucr.edu/~stelo/cpm/cpm07/improved_shetcking_porat.ppt
Questions on Improved Sketching of Hamming Distance with Error Correcting by Porat and Lipsky
ds.algorithms;data streams