The binary digits of n+t

DOI10.2422/2036-2145.202105_069zbMath1521.11008arXiv2005.07167OpenAlexW3205828963MaRDI QIDQ6098863

Michael Wallner, Lukas Spiegelhofer

Publication date: 19 June 2023

Published in: ANNALI SCUOLA NORMALE SUPERIORE - CLASSE DI SCIENZE (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2005.07167

zbMATH Keywords

Hamming weightsum of binary digitsCusick conjectureTu and Deng conjecture

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Combinatorial inequalities (05A20) Asymptotic enumeration (05A16) Radix representation; digital problems (11A63)

Cites Work

• Unnamed Item
• Unnamed Item
• Boolean functions optimizing most of the cryptographic criteria
• A conjecture about binary strings and its applications on constructing Boolean functions with optimal algebraic immunity
• The Tu-Deng conjecture holds almost surely
• The ring of \(k\)-regular sequences
• The ring of \(k\)-regular sequences. II.
• Precise distribution properties of the van der Corput sequence and related sequences
• On a Conjecture of Cusick Concerning the Sum of Digits of $n$ and $n+t$
• On a Combinatorial Conjecture
• On a Conjecture about Binary Strings Distribution
• Automatic Sequences
• A lower bound for Cusick’s conjecture on the digits of n + t
• Central limit theorem for probability measures defined by sum-of-digits function in base 2
• Discrepancy Results for The Van Der Corput Sequence
• Approaching Cusick's conjecture on the sum-of-digits function
• On the asymptotic behaviour of the correlation measure of sum-of-digits function in base 2
• Indépendance statistique d'ensembles liés à la fonction "somme des chiffres"
• Sendov's conjecture for sufficiently-high-degree polynomials

This page was built for publication: The binary digits of n+t