Run-Length-Limited ISI-Mitigation (RLIM) Coding for Molecular Communication

TL;DR

This paper introduces RLIM, a novel coding scheme for molecular communication that reduces inter-symbol interference and improves reliability by optimizing run-length-limited codes with an efficient decoding algorithm.

Contribution

The paper presents RLIM, a new RLL coding scheme with a linear-time optimal decoder that outperforms existing methods in molecular communication channels.

Findings

RLIM achieves lower BER than classical RLL codes.

The decoder outperforms first-wins and random Viterbi variants.

Simulations confirm improved reliability across scenarios.

Abstract

Inter-symbol interference (ISI) limits reliability in diffusion-based molecular communication (MC) channels. We propose RLIM, a family of run-length-limited (RLL) codes that form fixed-size codebooks by minimizing the total number of 1-bits, increasing the per-symbol molecule budget under standard power normalizations and thus improving reliability. We develop a provably optimal linear-time greedy decoder that is equivalent to Viterbi decoding under a deterministic last-wins tie-break and has lower computational complexity; empirically, it outperforms first-wins and random Viterbi variants on RLL baselines. Extensive binomial and particle-tracking simulations show that RLIM achieves lower bit error rate (BER) than classical RLL and other prominent coding schemes across a broad range of scenarios.