On the maximum of the weighted binomial sum 2^-r_i=0rᵐⁱ

DOI10.37236/10751zbMATH Open1491.05010arXiv2109.11396OpenAlexW3199823354MaRDI QIDQ2138559FDOQ2138559

Authors: S. P. Glasby, G. R. Paseman 

Publication date: 12 May 2022

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

Abstract: The weighted binomial sum $$ arises in coding theory and information theory. We prove that,for $motin0,3,6,9,12$, the maximum value of $f_m(r)$ with $0leqslantrleqslantm$ occurs when $r=lfloorm/3floor+1$. We also show this maximum value is asymptotic to $frac3sqrtpimleft(frac32ight{)}^m$ as $moinfty$.

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

File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

Recommendations

• Extremal properties of sums of binomial coefficients
• Partial sums of binomial coefficients
• Formulas for weighted binomial sums using the powers of terms of binary recurrences
• On asymptotics of certain sums arising in coding theory
• An inequality for the binary entropy function and an application to binomial coefficients

zbMATH Keywords

binomial coefficientsStirling number

Mathematics Subject Classification ID

Factorials, binomial coefficients, combinatorial functions (05A10) Binomial coefficients; factorials; (q)-identities (11B65)

Cites Work

• A class of linear codes with good parameters
• Title not available (Why is that?)

Cited In (2)

• Title not available (Why is that?)
• On the maximum of the weighted binomial sum \((1 + a)^{- r} \sum_{i = 0}^r \binom{m}{i} a^i\)

This page was built for publication: On the maximum of the weighted binomial sum \(2^{-r}\sum_{i=0}^r\binom{m}{i}\)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2138559)