Write
262
edits
Weak String Erasure: Difference between revisions
→Pseudocode
| Line 61: | Line 61: | ||
# Alice sends <math>\Theta_1^n</math> to Bob. | # Alice sends <math>\Theta_1^n</math> to Bob. | ||
# Bob computes <math>\mathcal{I}:=\{i \in [n] : \Theta_i = \hat \Theta_i\}</math>. | # Bob computes <math>\mathcal{I}:=\{i \in [n] : \Theta_i = \hat \Theta_i\}</math>. | ||
# Bob erases all bits from <math>\hat X_1^n<math> with index <math>i\notin \mathcal{I}</math>. Bob holds string <math>\hat X_{\mathcal{I}}</math>, and we should have <math> X_{\mathcal{I}} = \hat{X}_{\mathcal{I}} < | # Bob erases all bits from <math>\hat X_1^n</math> with index <math>i\notin \mathcal{I}</math>. Bob holds string <math>\hat X_{\mathcal{I}}</math>, and we should have <math> X_{\mathcal{I}} = \hat{X}_{\mathcal{I}} </math> | ||
==Further Information== | ==Further Information== | ||