Masked Neural Detection for Constrained Channel Coding in Molecular Communication
2026-06-12T08:51:40Z•24d978fc181fe6e2e0ebb5a502f05dfd4281128ed9a3f5e76edd5cca6353294d
E8 latticeJSCGCMarton's boundRLIM codesSBRNNbroadcast channel capacityconstrained codingflexible-antennagenerative communicationsinformation theoryjoint source-channel-generationlattice codeslattice-based cryptography applicability to coding theory and q-maskingmaximum toroidal distance (MTD) codesmolecular communicationmulti-cell optimizationneural detectionparticle swarm optimizationperceptual metricspinching antennaprecodingsum-broadcast channelstoroidal distancewireless communications
What happened
This feed aggregates recent arXiv submissions (12 Jun 2026) across information theory, communications, coding theory, and related applied math. Highlights include: (1) Molecular communication: RLIM constrained codes retain advantages under neural sequence detection (SBRNN); a masking strategy for compact SBRNNs yields large BER gains and competitiveness with MLSE without channel knowledge. (2) Sum-broadcast channels: capacity region characterized for sums of several classes (degraded, less-noisy, more-capable, deterministic, semi-deterministic, and primary channels) matching auxiliary-receiver
Why it matters
A reviewed impact interpretation has not been published for this record.
Evidence and limitations
- Source ID
- arxiv_math_it
- Record identifier
- 24d978fc181fe6e2e0ebb5a502f05dfd4281128ed9a3f5e76edd5cca6353294d
- Enrichment time
- 2026-06-12T08:51:40Z
- 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.