On enumerating the DNA sequences
Proceedings of the ACM Conference on Bioinformatics, Computational Biology and Biomedicine
Towards one cycle per bit asymmetric encryption: code-based cryptography on reconfigurable hardware
CHES'12 Proceedings of the 14th international conference on Cryptographic Hardware and Embedded Systems
Proof of plaintext knowledge for code-based public-key encryption revisited
Proceedings of the 8th ACM SIGSAC symposium on Information, computer and communications security
Practical nonvolatile multilevel-cell phase change memory
SC '13 Proceedings of the International Conference on High Performance Computing, Networking, Storage and Analysis
| Hi-index | 754.84 |
LetSbe a given subset of binary n-sequences. We provide an explicit scheme for calculating the index of any sequence inSaccording to its position in the lexicographic ordering ofS. A simple inverse algorithm is also given. Particularly nice formulas arise whenSis the set of alln-sequences of weightkand also whenSis the set of all sequences having a given empirical Markov property. Schalkwijk and Lynch have investigated the former case. The envisioned use of this indexing scheme is to transmit or store the index rather than the sequence, thus resulting in a data compression of(logmidSmid)/n.