A remark on Penney's algorithm
Horst Brunotte
TL;DR
This paper analyzes Penney's algorithm to identify the possible lengths of canonical representations of integers for a specific trinomial, enhancing understanding of its structure and properties.
Contribution
It determines the set of lengths of canonical representations of integers with respect to the trinomial X^{2m} + 2X^m + 2, based on Penney's algorithm.
Findings
Identifies the set of possible lengths of canonical representations.
Provides a characterization of representations for the specific trinomial.
Enhances understanding of Penney's algorithm's application to this polynomial.
Abstract
Based on the well-known algorithm of W. Penney we determine the set of lengths of the canonical representation of integers with respect to the trinomial X^2m + 2X^m + 2.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsBenford’s Law and Fraud Detection · Coding theory and cryptography · graph theory and CDMA systems