Search papers, labs, and topics across Lattice.
Corresponding author
2
0
1
0
Equal Hamming weight is not just necessary but also sufficient for making binary sequences indistinguishable through 0-insertion, reshaping our understanding of cyclic equalizability.
Cyclic equalizability, a concept relevant to card-based cryptography, boils down to having identical Parikh vectors.
