The mathematical landscape of partial information decomposition: A comprehensive review of properties and measures
2026-03-10T08:51:45Z•2144b7b6cf26ac1b83615a4a7fa0e0fcc23086717743c29cb23d01cfc7cd209b
BCH-codesHadamard-transformM-PSKNOMAOFDMORBGRANDRSMATBManalog-error-correcting-codesbeamformingbistatic-sensingchannel-estimation-phase-offsets-recoveryerror-correcting-codesfinite-blocklengthinformation-theorylambert-w-functionmovable-antennanon-orthogonal-multiple-accessoptimizationpartial-information-decompositionparticle-swarm-optimizationpower-allocationrate-allocationsub-wavelength-sensingtensor-based-modulation
What happened
This feed collects recent arXiv submissions (Mar 10, 2026) spanning information theory, coding, and wireless communications. Key topics include a comprehensive mathematical review of Partial Information Decomposition (PID); closed-form and efficient algorithms for target-rate power allocation over parallel (OFDM) channels; constructions and bounds for analog error-correcting codes and BCH codes; finite-blocklength analysis for ORBGRAND; tensor-based modulation (TBM) and Hadamard-domain spreading for robust NOMA; movable-antenna optimization for two-layer RSMA fairness; sub-wavelength bistatic-
Why it matters
A reviewed impact interpretation has not been published for this record.
Evidence and limitations
- Source ID
- arxiv_math_it
- Record identifier
- 2144b7b6cf26ac1b83615a4a7fa0e0fcc23086717743c29cb23d01cfc7cd209b
- Enrichment time
- 2026-03-10T08:51:45Z
- 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.