On the number of binary signed digit representations of a given weight.

DOI10.14712/1213-7243.2015.129zbMATH Open1349.11010OpenAlexW2339292265MaRDI QIDQ2948015FDOQ2948015

Authors: Jiři Tůma, Jiří Vábek 

Publication date: 29 September 2015

Published in: Commentationes Mathematicae Universitatis Carolinae (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.14712/1213-7243.2015.129

File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

Recommendations

• Binary signed-digit integers and the Stern diatomic sequence
• On binary signed digit representations of integers
• Analysis of alternative digit sets for nonadjacent representations
• On optimal binary signed digit representations of integers
• Selected Areas in Cryptography

zbMATH Keywords

stringminimal weightnon-adjacent formNAFbinary signed digit representation

Mathematics Subject Classification ID

General topics of discrete mathematics in relation to computer science (68R01) Radix representation; digital problems (11A63)

Cited In (6)

• On optimal binary signed digit representations of integers
• Binary signed-digit representations in paperfolding
• Binary signed-digit integers and the Stern diatomic sequence
• On binary signed digit representations of integers
• Optimal binary signed-digit representations of integers and the Stern polynomial
• The Hamming weight of the non-adjacent-form under various input statistics

This page was built for publication: On the number of binary signed digit representations of a given weight.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2948015)