On the maximum of the weighted binomial sum 2−r∑i=0r(mi)2^{-r}\sum_{i=0}^r\binom{m}{i}

preprint2022arXivOpen access

Abstract

The weighted binomial sum fm(r)=2−r∑i=0r(mi)f_m(r)=2^{-r}\sum_{i=0}^r\binom{m}{i} arises in coding theory and information theory. We prove that,for m∉{0,3,6,9,12}m\not \in\{0,3,6,9,12\}, the maximum value of fm(r)f_m(r) with 0⩽r⩽m0\leqslant r\leqslant m occurs when r=⌊m/3⌋+1r=\lfloor m/3\rfloor+1. We also show this maximum value is asymptotic to 3πm(32)m\frac{3}{\sqrt{πm}}\left(\frac{3}{2}\right)^m as m→∞m\to\infty.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.