Minimal weight digit set conversions

@article{Phillips2004MinimalWD,
  title={Minimal weight digit set conversions},
  author={Braden Phillips and Neil Burgess},
  journal={IEEE Transactions on Computers},
  year={2004},
  volume={53},
  pages={666-677}
}
We consider the problem of recoding a number to minimize the number of nonzero digits in its representation, that is, to minimize the weight of the representation. A general sliding window scheme is described that extends minimal binary sliding window conversion to arbitrary radix and to encompass signed digit sets. This new conversion expresses a number of known recoding techniques as special cases. Proof that this scheme achieves minimal weight for a given digit set is provided and results… CONTINUE READING

From This Paper

Figures, tables, and topics from this paper.

Citations

Publications citing this paper.

References

Publications referenced by this paper.
Showing 1-10 of 28 references

Adaptive m-Ary Segmentation and Canonical Recoding Algorithms for Multiplication of Large Binary Integers

  • C. K. Koc, C. Hung
  • Computers and Math. with Applications, vol. 24…
  • 1992
Highly Influential
4 Excerpts

High-Radix and Bbit Recoding Techniques for Modular Exponentiation

  • C. K. Koc
  • Int’l J. Computer Math., vol. 40, nos. 3- 4, pp…
  • 1991
Highly Influential
3 Excerpts

An Optimised Implementation of Public-Key Cryptography for a Smart-Card Processor

  • B. J. Phillips
  • PhD thesis, Univ. of Adelaide, 2000.
  • 2000
2 Excerpts

An Analysis of Exponentiation Based on Formal Languages

  • L. O’Connor
  • Proc. Advances in Cryptology (EUROCRYPT ’99), pp…
  • 1999
1 Excerpt

Similar Papers

Loading similar papers…