The Tu-Deng conjecture holds almost surely

zbMath1439.11030arXiv1707.07945MaRDI QIDQ668088

Michael Wallner, Lukas Spiegelhofer

Publication date: 5 March 2019

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

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

zbMATH Keywords

Tu-Deng conjecture

Mathematics Subject Classification ID

Combinatorics in computer science (68R05) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Radix representation; digital problems (11A63)

Related Items (4)

Approaching Cusick's conjecture on the sum-of-digits function ⋮ The binary digits of n+t ⋮ Recent results on constructing Boolean functions with (potentially) optimal algebraic immunity based on decompositions of finite fields ⋮ A lower bound for Cusick’s conjecture on the digits of n + t

Uses Software

• gfun

Cites Work

• Unnamed Item
• Unnamed Item
• 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
• 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
• GFUN
• An explicit generating function arising in counting binomial coefficients divisible by powers of primes
• Advances in Cryptology - EUROCRYPT 2004
• Advances in Cryptology - CRYPTO 2003
• Indépendance statistique d'ensembles liés à la fonction "somme des chiffres"
• Fast Software Encryption

This page was built for publication: The Tu-Deng conjecture holds almost surely