The Binomial Channel: On Capacity, Optimal Inputs, and Beta-Binomial Approximation
2026-07-07T08:51:43Z•fa93ee157f4f8ab814f06cad7827e14b236dc140a0b53538bc570aa1c3c62bdd
1-bit-adc1-bit-dacbeta-binomialbinomial-channelchannel-capacitychannel-estimationcoding-theorycommunicationscramer-raodfrcdiffusion-modelsdmаfisher-informationinformation-theoryisacmassive-mimoofdmoptimizationpolar-codesquantum-error-correctionreed-solomonsemantic-communicationsignal-processingsum-rank-metrictransformers
What happened
Collection of newly announced arXiv submissions (Jul 07 2026) in information theory, communications, and coding. Key items: (1) "The Binomial Channel": capacity analysis for a binomial channel with continuous inputs; proves discreteness, symmetry, endpoint support of optimal input, tight capacity asymptotics C(n)=1/2 log(nπ/2e)+o(1), beta–binomial reference input and support-size bounds Ω(√(n log log n)). (2) "Cramér–Rao Bound Optimization for Massive MIMO DFRC Systems with 1-Bit DACs and ADCs": DFRC design minimizing 1-bit CRB for azimuth estimation under symbol-level CI constraints; asymptot
Why it matters
A reviewed impact interpretation has not been published for this record.
Evidence and limitations
- Source ID
- arxiv_math_it
- Record identifier
- fa93ee157f4f8ab814f06cad7827e14b236dc140a0b53538bc570aa1c3c62bdd
- Enrichment time
- 2026-07-07T08:51:43Z
- AI-assisted enrichment
- Yes
This record may overlap with other records. Its enrichment can be incomplete or wrong, and machine assistance was used. Validate consequential decisions against the linked source and your own environment.