Fractal digital sums and codes

DOI10.1007/S002000050050MaRDI QIDQ1352418zbMATH OpenOpenAlexFDO

Authors 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 sumsfractal digital sumsstrongly error correcting codessum-of-digits functionsThue-Morse sequence

Mathematics Subject Classification ID

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

Review text

The aim of this paper is to study digital sums of the type \[ S_p(N)= \sum_{n<N}(- 1)^{\nu(pn)}, \] where \(\nu(k)\) denotes the sum of the binary digits of \(k\) and \(p\) is a given odd number. After a recent account of the subject, the case \(p=17\) is studied in detail: the function \(S_{17}\) is shown to be always positive and its fractal nature is discussed. Then the authors use these sum-of-digits functions to generate a special code: the analysis of this code shows that it is exponential, extremely redundant and thus strongly error correcting with a linear decoding procedure.

Recommendations

• Digital Sum Problems for the Gray Code Representation of Natural Numbers
• Applications of binomial measures to power sums of digital sums
• The fractal structure of rarefied sums of the Thue-Morse sequence
• scientific article; zbMATH DE number 4110775
• scientific article; zbMATH DE number 510630

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

(12)

• On the spectrum of the Thue-Morse quasicrystal and the rarefaction phenomenon
• Fractal properties of the singular function \(s(u)\)
• ``Viral Turing machines, computation from noise and combinatorial hierarchies
• Coquet-type formulas for the rarefied weighted Thue-Morse sequence
• Newman's phenomenon for generalized Thue-Morse sequences
• On simultaneous binary expansions of \(n\) and \(n^2\)
• scientific article; zbMATH DE number 1990802 (Why is no real title available?)
• Rarified sums of the Thue-Morse sequence
• 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
• Regularity of patterns in the factorization of n!

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)