Fractal digital sums and codes
From MaRDI portal
Recommendations
Cites work
- A Note on Gray Code and Odd-Even Merge
- A note on the parity of the sum-of-digits function
- A summation formula related to the binary digits
- Character sum constructions of constrained error-correcting codes
- Completely q-multiplicative functions: the Mellin transform approach
- Mellin transforms and asymptotics: Digital sums
- On the Number of Binary Digits in a Multiple of Three
- Sign-changes of the Thue-Morse fractal function and Dirichlet L-series
- The fractal structure of rarefied sums of the Thue-Morse sequence
- The number of registers required for evaluating arithmetic expressions
Cited in
(11)- Coquet-type formulas for the rarefied weighted Thue-Morse sequence
- Regularity of patterns in the factorization of n!
- On simultaneous binary expansions of \(n\) and \(n^2\)
- scientific article; zbMATH DE number 1990802 (Why is no real title available?)
- Digital Sum Problems for the Gray Code Representation of Natural Numbers
- A remark of \(P_{i,k}\) on elliptic curves and application for Manchester coding
- Rarefied Thue-Morse sums via automata theory and logic
- On the spectrum of the Thue-Morse quasicrystal and the rarefaction phenomenon
- Rarified sums of the Thue-Morse sequence
- ``Viral Turing machines, computation from noise and combinatorial hierarchies
- Newman's phenomenon for generalized Thue-Morse sequences
This page was built for publication: Fractal digital sums and codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1352418)