Counting optimal joint digit expansions
From MaRDI portal
Publication:3377531
zbMATH Open1087.11004MaRDI QIDQ3377531FDOQ3377531
Authors: Clemens Heuberger, Helmut Prodinger, Peter J. Grabner
Publication date: 23 March 2006
Full work available at URL: https://eudml.org/doc/125962
File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)
Recommendations
Cryptography (94A60) Radix representation; digital problems (11A63) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71)
Cited In (11)
- Asymptotic expansions for linear homogeneous divide-and-conquer recurrences: algebraic and analytic approaches collated
- Graphs, digits and cryptography
- Optimal number representations in negative base
- Effective Erdős-Wintner theorems for digital expansions
- On optimal binary signed digit representations of integers
- Enumeration of cryptarithms using deterministic finite automata
- On the number of optimal base 2 representations of integers
- Representation by an automaton of continuous functions of the torus
- Analysis of summatory functions of regular sequences: transducer and Pascal's rhombus
- Purity results for some arithmetically defined measures
- Asymptotic analysis of regular sequences
This page was built for publication: Counting optimal joint digit expansions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3377531)