English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Zendy Plus

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Zendy Tools

Zendy Open

A signed binary representation (SBR) of an integer $N$ is a string $a_b\cdots a_2a_1a_0$ over the alphabet $\{-1,0,1\}$ such that $N = \sum_{i=0}^b a_i2^i$. An SBR of an integer $N$ is said to be minimal if the number of nonzero digits is minimum. In this paper, we describe a simple 3-close Gray code for listing all minimal SBRs of an integer $N$. The algorithm is implemented to run in constant amortized time. In addition, we identify the values for $N$ that have the maximum number of minimal SBRs given the length of the binary representation of $N$.

A Simple Gray Code to List All Minimal Signed Binary Representations