Low-Complexity Run-Length-Limited ISI-Mitigation (RLIM) Codes for Molecular Communication
Fuente:
arXiv
Gespeichert in:
| Hauptverfasser: | , |
|---|---|
| Format: | Preprint |
| Veröffentlicht: |
2026
|
| Schlagworte: | |
| Online-Zugang: | |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| _version_ | 1866914517864153088 |
|---|---|
| author | Şahin, Melih Akan, Ozgur B. |
| author_facet | Şahin, Melih Akan, Ozgur B. |
| contents | 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. This paper removes that realization bottleneck by replacing full codebook storage with an enumerative realization based on Cover's ranking framework, constant-weight run-length-limited counting, and cumulative weight-layer offsets. The resulting encoder and decoder preserve the selected RLIM codebooks and the original projection-based decoding behavior while storing only polynomial-size counting tables. Storage and runtime measurements confirm the resulting exponential-to-polynomial reduction, and diffusion-based molecular-communication simulations show that the newly accessible larger-dimensional RLIM regimes can improve the best attainable bit-error-rate performance in the tested settings. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2604_27104 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | Low-Complexity Run-Length-Limited ISI-Mitigation (RLIM) Codes for Molecular Communication Şahin, Melih Akan, Ozgur B. Information Theory 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. This paper removes that realization bottleneck by replacing full codebook storage with an enumerative realization based on Cover's ranking framework, constant-weight run-length-limited counting, and cumulative weight-layer offsets. The resulting encoder and decoder preserve the selected RLIM codebooks and the original projection-based decoding behavior while storing only polynomial-size counting tables. Storage and runtime measurements confirm the resulting exponential-to-polynomial reduction, and diffusion-based molecular-communication simulations show that the newly accessible larger-dimensional RLIM regimes can improve the best attainable bit-error-rate performance in the tested settings. |
| title | Low-Complexity Run-Length-Limited ISI-Mitigation (RLIM) Codes for Molecular Communication |
| topic | Information Theory |
| url | https://arxiv.org/abs/2604.27104 |