## Abstract

In a standard binary search, the binary representation of the index of an element in an ordered linear array is recovered serially bit by bit. For an array of N elements, the index of an element is recovered, in principle, by assigning to each element one value out of log_{2}N possibilities. It is shown in this paper that by arranging 2^{n}—1 elements in a circular array, the bits of the binary representation of the index of an element are all recovered simultaneously based on assigning to each element one value out of two possibilities. The main theoretical result is showing that the parity of an integer X is trivially recovered from of the parity of the Hamming weight of the binary representation of X, X+ 1, X+ 2, and X+ 3, whereas, on the other hand, the parity of the Hamming weight of the binary representation of an integer is consistent with modular arithmetic considerations.

Original language | English |
---|---|

Pages (from-to) | 109-112 |

Number of pages | 4 |

Journal | IEEE Transactions on Computers |

Volume | 41 |

Issue number | 1 |

DOIs | |

State | Published - 1 Jan 1992 |

## Keywords

- Binary search
- circular arrays
- finite fields
- indexing
- modular arithmetic

## ASJC Scopus subject areas

- Software
- Theoretical Computer Science
- Hardware and Architecture
- Computational Theory and Mathematics