Fractal digital sums and codes

DOI10.1007/s002000050050zbMath0874.11012OpenAlexW1983631013MaRDI QIDQ1352418

Tamás Herendi, Robert F. Tichy, Peter J. Grabner

Publication date: 13 November 1997

Published in: Applicable Algebra in Engineering, Communication and Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s002000050050

zbMATH Keywords

exponential sumsThue-Morse sequencefractal digital sumsstrongly error correcting codessum-of-digits functions

Mathematics Subject Classification ID

Estimates on exponential sums (11L07) Radix representation; digital problems (11A63) Automata sequences (11B85) Decoding (94B35) Calculation of integer sequences (11Y55)

Related Items (8)

Regularity of patterns in the factorization of n! ⋮ ``Viral Turing machines, computation from noise and combinatorial hierarchies ⋮ Rarefied Thue-Morse sums via automata theory and logic ⋮ Newman's phenomenon for generalized Thue-Morse sequences ⋮ Coquet-type formulas for the rarefied weighted Thue-Morse sequence ⋮ Rarified sums of the Thue-Morse sequence ⋮ On the spectrum of the Thue-Morse quasicrystal and the rarefaction phenomenon ⋮ On simultaneous binary expansions of \(n\) and \(n^2\)

Cites Work

• A summation formula related to the binary digits
• The fractal structure of rarefied sums of the Thue-Morse sequence
• The number of registers required for evaluating arithmetic expressions
• Character sum constructions of constrained error-correcting codes
• Mellin transforms and asymptotics: Digital sums
• Sign-changes of the Thue-Morse fractal function and Dirichlet \(L\)-series
• A Note on Gray Code and Odd-Even Merge
• Completely q-multiplicative functions: the Mellin transform approach
• On the Number of Binary Digits in a Multiple of Three
• A note on the parity of the sum-of-digits function

This page was built for publication: Fractal digital sums and codes