Projects per year
Abstract
The weighted binomial sum f_{m}(r) = 2^{−r!}r "_{m} # i=0 i arises in coding theory and information theory. We prove that, for m ∕∈ {0, 3, 6, 9, 12}, the maximum value of f_{m}(r) with 0 ! r ! m occurs " when r = ⌊m/3⌋ + 1. We also show this maximum 3 value is asymptotic to √_{3m} πm 2# as m → ∞.
Original language  English 

Article number  P2.5 
Number of pages  11 
Journal  Electronic Journal of Combinatorics 
Volume  29 
Issue number  2 
DOIs  
Publication status  Published  2022 
Fingerprint
Dive into the research topics of 'On the maximum of the weighted r! " #_{m} binomial sum 2^{−r} i i=0'. Together they form a unique fingerprint.Projects
 1 Active

Complexity of group algorithms and statistical fingerprints of groups
Praeger, C. & Niemeyer, A.
21/02/19 → 31/12/22
Project: Research