Masked Neural Detection for Run-Length-Limited Channel Coding in Molecular Communication
cs.IT, cs.LG, math.IT
Submitted: 2026-06-10
Updated: 2026-09-06
Comments: 5 pages, 2 figures, 3 tables
License: http://creativecommons.org/licenses/by-nc-nd/4.0/
The gist: Molecular communication (MC) suffers from severe diffusion memory because molecules released for one symbol may arrive during later symbol intervals.
Terminology
Abstract
Molecular communication (MC) suffers from severe diffusion memory because molecules released for one symbol may arrive during later symbol intervals. Neural sequence detectors, especially sliding bidirectional recurrent neural networks (SBRNNs), substantially outperform threshold detection in such channels. This raises a central question for MC channel coding: does a code whose superiority was established under threshold detection retain it when both coded and uncoded transmission are evaluated with neural detection? This letter answers this question for run-length-limited ISI-mitigation (RLIM) codes by proposing a decoder-aware training mask that removes the positions the RLIM decoder has a high probability of deterministically overwriting, steering compact-SBRNN capacity toward the information-bearing positions. The masked RLIM 2-SBRNN beats the best uncoded receiver (threshold or SBRNN) at 40 of 57 operating points; gains peak at 43 times under favorable channels, while losses, confined to the most adverse, never exceed 2.7 times. Masking improves the unmasked RLIM 2-SBRNN in 56 of 57 matched comparisons. Finally, with storage counted equally in SBRNN weights and MLSE table entries, the masked RLIM 2-SBRNN is the more accurate receiver up to a few thousand stored values despite using no channel knowledge; channel-state-aware uncoded MLSE moves ahead only beyond tens of thousands.
Sources
- Low-Complexity Run-Length-Limited ISI-Mitigation (RLIM) Codes for Molecular Communication
- Local Differential Privacy for Molecular Communication Networks
Related papers
- Clipped Affine Policy: Low-Complexity Near-Optimal Online Power Control for Energy Harvesting Communications over Fading Channels
- Discrepancy for Random Linear Codes
- A New Approach to Code Smoothing Bounds
- Contextual Memory-Enhanced Source Coding for Low-SNR Communications
- Symmetry-Enforced Quadratic Approximate-Degradability Bounds for Noisy Landau-Streater Channels
- Anonymous Shamir's Secret Sharing via Reed-Solomon Codes Against Permutations, Insertions, and Deletions