In Paper, A Mathematical Theory of Danksharding, how to understand rbo

[cliff0412]

Refer to paper A Mathematical Theory of Danksharding.

in this definition u_{\mu} \equiv u^{rbo(\mu)}

how to understand rbo?

for example, what would the output of rbo(11) be?

[yuvalingo]

rob is reversed-bit-order 'd11 = 'b1011 so rob('b1011) = 'b(1101) = 'd13

[cliff0412]

thanks for the explanation. for example, if it is 4 bits number, then it will access {0,8,4,12,2,10,6,14} and then {1,9,5,13,3,11,7,15}. the even and odd cosets alright? and the order does not matter?

[yuvalingo]

exactly. also, if you want cosets of order 4 you'll have {0,8,4,12}, {2,10,6,14}, etc