Low-Complexity Run-Length-Limited ISI-Mitigation (RLIM) Codes for Molecular Communication
Melih \c{S}ahin, Ozgur B. Akan

TL;DR
This paper introduces a polynomial-space encoding and decoding scheme for run-length-limited ISI-mitigation codes in molecular communication, enabling larger codebooks and improved error performance under resource constraints.
Contribution
It replaces full codebook storage with an enumerative approach based on Cover's ranking, reducing storage from exponential to polynomial size.
Findings
The new scheme reduces storage complexity from exponential to polynomial.
Simulations show improved bit-error-rate performance with larger codebooks.
The approach is suitable for nano-scale molecular communication with limited resources.
Abstract
Molecular communication suffers from severe inter-symbol interference, which makes constrained coding essential for reliable transmission. Run-length-limited ISI-mitigation codes are attractive because they select low-weight constrained codebooks, reducing ISI while allowing more molecules to be assigned to each transmitted 1-symbol under the usual molecular-communication normalization. Previous results showed strong bit-error-rate performance for these codes, but their original realization required full codebook generation and storage. This exponential storage growth is unsuitable for resource-constrained molecular communication channels and also limits the exploration of larger information dimensions. This is particularly important for nano-scale molecular communication, where transmitter and receiver nodes are expected to operate under severe memory and computational constraints.…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
