pith. sign in

arxiv: 2604.27104 · v1 · submitted 2026-04-29 · 💻 cs.IT · math.IT

Low-Complexity Run-Length-Limited ISI-Mitigation (RLIM) Codes for Molecular Communication

Melih \c{S}ahin , Ozgur B. Akan This is my paper

Pith reviewed 2026-05-07 08:37 UTC · model grok-4.3

classification 💻 cs.IT math.IT
keywords molecular communicationrun-length-limited codesISI mitigationenumerative codingconstrained codingbit error ratediffusion channel
0
0 comments X

The pith

Enumerative coding realizes run-length-limited ISI-mitigation codes with only polynomial storage for molecular communication.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

Molecular communication uses constrained codes to limit inter-symbol interference caused by diffusing molecules. Run-length-limited ISI-mitigation codes achieve this by selecting low-weight sequences, but earlier versions required storing the entire codebook, which grows exponentially with dimension and exceeds the memory available in nano-scale nodes. This paper replaces that storage with an enumerative encoder and decoder built from ranking tables, constant-weight run-length-limited counters, and cumulative weight-layer offsets. The construction keeps the exact original codebooks and projection decoder while using only polynomial-size tables. Diffusion simulations then show that the newly reachable higher-dimensional codes improve bit-error-rate performance.

Core claim

The paper shows that an enumerative realization based on Cover's ranking framework, constant-weight run-length-limited counting, and cumulative weight-layer offsets produces encoders and decoders that preserve the selected RLIM codebooks and the original projection-based decoding behavior while storing only polynomial-size counting tables.

What carries the argument

Enumerative realization via Cover's ranking framework combined with constant-weight run-length-limited counting tables and cumulative weight-layer offsets, which together generate and decode codewords without full codebook storage.

If this is right

  • Storage and runtime for RLIM encoders and decoders drop from exponential to polynomial in the code dimension.
  • Higher-dimensional RLIM codes become practical on memory-limited nano-scale transmitters and receivers.
  • Projection-based decoding remains unchanged, so the original error-correction behavior is retained.
  • Diffusion-channel simulations indicate that these larger-dimensional codes can reach lower bit-error rates than previously accessible RLIM regimes.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

  • The same counting-table approach could be applied to other constrained codes used in molecular or similar diffusion-based channels.
  • Polynomial storage removes a key barrier to testing RLIM codes across a wider range of block lengths and weights in future molecular-communication experiments.

Load-bearing premise

The counting tables and cumulative offsets exactly reproduce the original RLIM codebooks and projection decoder with no mismatches.

What would settle it

For any small dimension, generate the full list of codewords with both the original codebook method and the new enumerative encoder, then check whether the two sets are identical.

Figures

Figures reproduced from arXiv: 2604.27104 by Melih \c{S}ahin, Ozgur B. Akan.

Figure 1
Figure 1. Figure 1: MC Channel Model the information dimension that appears in the stored-codebook implementation. The proposed realization also makes larger selected RLIM codebooks directly testable in a simulation setting. This is important because, among the prominent MC coding schemes compared in this paper, moderate-order RLIM codes attain the strongest overall BER performance across the tested operating points, and the … view at source ↗
Figure 2
Figure 2. Figure 2: Storage and runtime comparison between the previous full-codebook RLIM realization and the proposed low-storage view at source ↗
Figure 3
Figure 3. Figure 3: Bit-error-rate values across methods. Unless stated otherwise, view at source ↗
read the original 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. 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.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Referee Report

1 major / 2 minor

Summary. The paper proposes a low-complexity enumerative realization of run-length-limited ISI-mitigation (RLIM) codes for molecular communication. It replaces exponential full-codebook storage with an approach based on Cover's ranking framework, constant-weight run-length-limited counting, and cumulative weight-layer offsets. The resulting encoder/decoder is claimed to exactly preserve the original RLIM codebooks and projection-based decoding while using only polynomial-size tables; storage/runtime measurements and diffusion-based simulations are presented to show complexity reduction and improved BER in larger-dimensional regimes.

Significance. If the exact preservation of codebooks and decoder behavior holds, the work is significant because it removes the primary practical barrier to deploying RLIM codes in memory-constrained nano-scale molecular communication. Enabling higher-dimensional constrained codes without exponential storage directly supports better ISI mitigation and lower bit-error rates under the standard molecular normalization, which prior full-storage realizations could not reach. The polynomial-table construction and reported simulation gains constitute a concrete, usable advance for resource-limited transmitters and receivers.

major comments (1)
  1. [Abstract] Abstract and the enumerative-construction section: the central claim that the method 'preserve[s] the selected RLIM codebooks and the original projection-based decoding behavior' is load-bearing for all subsequent BER comparisons and complexity claims, yet the manuscript supplies neither a formal proof sketch nor a small-parameter verification (e.g., explicit codeword sets for small n, w, d) showing that Cover ranking plus cumulative weight-layer offsets exactly reproduces the original constant-weight RLL sets. Any deviation would invalidate the direct performance comparison to earlier full-storage RLIM results.
minor comments (2)
  1. [Simulation results] The diffusion-channel simulation parameters (diffusion coefficient, symbol duration, receiver volume, number of Monte-Carlo trials) should be tabulated for reproducibility; the current description only states 'diffusion-based' without numerical values.
  2. [Enumerative encoder/decoder] Notation for the cumulative weight-layer offsets and the ranking function should be introduced with a small worked example before the general algorithm; the present description jumps directly to the polynomial-size table claim.

Simulated Author's Rebuttal

1 responses · 0 unresolved

We thank the referee for the careful and constructive comment. We agree that explicit verification of exact codebook preservation is essential to support the BER and complexity claims, and we will strengthen the manuscript accordingly.

read point-by-point responses

  1. Referee: [Abstract] Abstract and the enumerative-construction section: the central claim that the method 'preserve[s] the selected RLIM codebooks and the original projection-based decoding behavior' is load-bearing for all subsequent BER comparisons and complexity claims, yet the manuscript supplies neither a formal proof sketch nor a small-parameter verification (e.g., explicit codeword sets for small n, w, d) showing that Cover ranking plus cumulative weight-layer offsets exactly reproduces the original constant-weight RLL sets. Any deviation would invalidate the direct performance comparison to earlier full-storage RLIM results.

    Authors: We agree that the absence of an explicit small-parameter check and proof sketch is a gap that should be closed. The enumerative encoder is constructed so that the ranking function, using precomputed constant-weight RLL counting tables and cumulative weight-layer offsets, assigns each index a unique valid sequence in lexicographic order; by definition this generates precisely the same set of sequences that the original full-codebook RLIM construction would have selected. In the revised manuscript we will add a new subsection (immediately after the description of the cumulative-offset tables) that contains: (1) a concise proof sketch showing that the ranking procedure is a bijection onto the constrained constant-weight set, and (2) an explicit verification table for small parameters (n=6, w=2, d=3 and n=7, w=3, d=2). For each case we will list every valid codeword, show the index-to-codeword mapping produced by the enumerative encoder, and confirm that the resulting set and the projection-based decoder outputs are identical to those obtained from exhaustive enumeration. These additions will make the preservation claim fully verifiable and will leave the reported BER gains and storage/runtime reductions on a rigorous footing. revision: yes

Circularity Check

0 steps flagged

No significant circularity; enumerative RLIM construction is self-contained

full rationale

The derivation begins from prior RLIM codebooks (cited for context) and applies Cover's external ranking framework together with newly derived constant-weight RLL counting tables and cumulative offsets. Preservation of the original codebooks and projection decoder follows directly from the bijective property of the ranking function over the constrained set, which is the standard mechanics of enumerative coding rather than a redefinition or fit. Storage/runtime measurements and diffusion simulations are independent empirical checks. No equation or claim reduces to a fitted input, self-citation chain, or ansatz smuggled from the authors' prior work; the central low-complexity realization stands on its own mathematical construction.

Axiom & Free-Parameter Ledger

0 free parameters · 1 axioms · 0 invented entities

The central claim rests on the correctness of the enumerative encoding preserving RLIM properties and the validity of the simulation results.

axioms (1)
  • domain assumption The molecular communication channel follows a diffusion-based model with inter-symbol interference.
    Invoked in the simulation claims for BER performance.

pith-pipeline@v0.9.0 · 5522 in / 1204 out tokens · 71650 ms · 2026-05-07T08:37:10.384474+00:00 · methodology

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Reference graph

Works this paper leans on

25 extracted references · 25 canonical work pages

  1. [1]

    Nakano, A

    T. Nakano, A. W. Eckford, and T. Haraguchi,Molecular Communica- tion. Cambridge University Press, 2013

    work page 2013

  2. [2]

    Fundamentals of molecular information and communication science,

    O. B. Akan, H. Ramezani, T. Khan, N. A. Abbasi, and M. Kuscu, “Fundamentals of molecular information and communication science,” Proceedings of the IEEE, vol. 105, no. 2, pp. 306–318, 2017

    work page 2017

  3. [3]

    The internet of nano-things,

    I. F. Akyildiz and J. M. Jornet, “The internet of nano-things,”Wireless Commun., vol. 17, no. 6, p. 58–63, Dec. 2010. [Online]. Available: https://doi.org/10.1109/MWC.2010.5675779

    work page doi:10.1109/mwc.2010.5675779 2010

  4. [4]

    Transmitter and receiver architectures for molecular communications: A survey on physical design with modulation, coding, and detection techniques,

    M. Kuscu, E. Dinc, B. A. Bilgin, H. Ramezani, and O. B. Akan, “Transmitter and receiver architectures for molecular communications: A survey on physical design with modulation, coding, and detection techniques,”Proceedings of the IEEE, vol. 107, no. 7, pp. 1302–1341, 2019. 9

    work page 2019

  5. [5]

    Run-length-limited isi-mitigation (rlim) coding for molecular communication,

    M. ¸ Sahin and O. B. Akan, “Run-length-limited isi-mitigation (rlim) coding for molecular communication,”IEEE Transactions on Molecular , Biological, and Multi-Scale Communications, pp. 1–1, 2026

    work page 2026

  6. [6]

    Enumerative source encoding,

    T. M. Cover, “Enumerative source encoding,”IEEE Transactions on Information Theory, vol. 19, no. 1, pp. 73–77, Jan. 1973

    work page 1973

  7. [7]

    Enumerative coding for constant-weight binary se- quences with constrained run-length of zeros,

    O. F. Kurmaev, “Enumerative coding for constant-weight binary se- quences with constrained run-length of zeros,”Problems of Information Transmission, vol. 38, no. 4, pp. 249–254, 2002

    work page 2002

  8. [8]

    Constant-weight and constant-charge binary run-length limited codes,

    ——, “Constant-weight and constant-charge binary run-length limited codes,”IEEE Transactions on Information Theory, vol. 57, no. 7, pp. 4497–4515, 2011

    work page 2011

  9. [9]

    Modulation techniques for communication via diffusion in nanonetworks,

    M. S. Kuran, H. B. Yilmaz, T. Tugcu, and I. F. Akyildiz, “Modulation techniques for communication via diffusion in nanonetworks,” in2011 IEEE International Conference on Communications (ICC), 2011, pp. 1–5

    work page 2011

  10. [10]

    Local differential privacy for molecular communication networks,

    M. ¸ Sahin and O. B. Akan, “Local differential privacy for molecular communication networks,” 2026. [Online]. Available: https://arxiv.org/ abs/2603.00690

    work page arXiv 2026

  11. [11]

    Three- dimensional channel characteristics for molecular communications with an absorbing receiver,

    H. B. Yilmaz, A. C. Heren, T. Tugcu, and C.-B. Chae, “Three- dimensional channel characteristics for molecular communications with an absorbing receiver,”IEEE Communications Letters, vol. 18, no. 6, pp. 929–932, 2014

    work page 2014

  12. [12]

    Correlated source achievable information rate analysis in diffusive channels with memory,

    F. Vakilipoor, L. Barletta, S. Bregni, and M. Magarini, “Correlated source achievable information rate analysis in diffusive channels with memory,” in2024 IEEE Latin-American Conference on Communications (LATINCOM), 2024, pp. 1–6

    work page 2024

  13. [13]

    A generalized method for encoding and decoding run-length-limited binary sequences (corresp.),

    G. Beenker and K. Immink, “A generalized method for encoding and decoding run-length-limited binary sequences (corresp.),”IEEE Trans. Inf. Theor ., vol. 29, no. 5, p. 751–754, Sep. 2006. [Online]. Available: https://doi.org/10.1109/TIT.1983.1056728

    work page doi:10.1109/tit.1983.1056728 2006

  14. [14]

    Pierobon, I

    A. Hareedy, B. Dabak, and R. Calderbank, “The secret arithmetic of patterns: A general method for designing constrained codes based on lexicographic indexing,”IEEE Trans. Inf. Theor ., vol. 68, no. 9, p. 5747–5778, Sep. 2022. [Online]. Available: https://doi.org/10.1109/TIT. 2022.3170692

    work page doi:10.1109/tit 2022

  15. [15]

    Block codes for a class of constrained noiseless channels,

    D. Tang and L. Bahl, “Block codes for a class of constrained noiseless channels,”Information and Control, vol. 17, no. 5, pp. 436–461, 1970. [Online]. Available: https://www.sciencedirect.com/science/article/pii/ S0019995870903694

    work page 1970

  16. [16]

    1970.tb01770.x

    R. W. Hamming, “Error detecting and error correcting codes,”Bell System Technical Journal, vol. 29, no. 2, pp. 147–160, 1950. [Online]. Available: https://onlinelibrary.wiley.com/doi/abs/10.1002/j.1538-7305. 1950.tb00463.x

    work page doi:10.1002/j.1538-7305 1950

  17. [17]

    Channel codes for reliability enhancement in molecular communication,

    P.-J. Shih, C.-H. Lee, P.-C. Yeh, and K.-C. Chen, “Channel codes for reliability enhancement in molecular communication,”IEEE Journal on Selected Areas in Communications, vol. 31, no. 12, pp. 857–867, 2013

    work page 2013

  18. [18]

    Journal of the Society for Industrial and Applied Mathematics8(2), 300–304 (1960)

    I. S. Reed and G. Solomon, “Polynomial codes over certain finite fields,”Journal of the Society for Industrial and Applied Mathematics, vol. 8, no. 2, pp. 300–304, 1960. [Online]. Available: https://doi.org/10.1137/0108018

    work page doi:10.1137/0108018 1960

  19. [19]

    Reed solomon codes for molecular communication with a full absorption receiver,

    M. B. Dissanayake, Y . Deng, A. Nallanathan, E. M. N. Ekanayake, and M. Elkashlan, “Reed solomon codes for molecular communication with a full absorption receiver,”IEEE Communications Letters, vol. 21, no. 6, pp. 1245–1248, 2017

    work page 2017

  20. [20]

    Minimum energy channel codes for molecular communications,

    C. Bai, M. S. Leeson, and M. D. Higgins, “Minimum energy channel codes for molecular communications,”Electronics Letters, vol. 50, no. 23, pp. 1669–1671, 2014. [Online]. Available: https: //ietresearch.onlinelibrary.wiley.com/doi/abs/10.1049/el.2014.3345

    work page doi:10.1049/el.2014.3345 2014

  21. [21]

    Isi-mitigating channel codes for molecular communication via diffusion,

    A. O. Kislal, B. C. Akdeniz, C. Lee, A. E. Pusane, T. Tugcu, and C.-B. Chae, “Isi-mitigating channel codes for molecular communication via diffusion,”IEEE Access, vol. 8, pp. 24 588–24 599, 2020

    work page 2020

  22. [22]

    Index modulation for molecular communication via diffusion systems,

    M. C. Gursoy, E. Basar, A. E. Pusane, and T. Tugcu, “Index modulation for molecular communication via diffusion systems,”IEEE Transactions on Communications, vol. 67, no. 5, pp. 3337–3350, 2019

    work page 2019

  23. [23]

    Isi mitigation techniques in molecular communication,

    B. Tepekule, A. E. Pusane, H. B. Yilmaz, C.-B. Chae, and T. Tugcu, “Isi mitigation techniques in molecular communication,”IEEE Transactions on Molecular , Biological and Multi-Scale Communications, vol. 1, no. 2, pp. 202–216, 2015. Melih ¸ Sahin (Graduate Student Member, IEEE) is a PhD student in the Department of Engineering at the University of Cambridg...

    work page 2015

  24. [24]

    His research interests cover Information The- ory, Coding Theory, and Molecular Communication. Ozgur B. Akan (Fellow, IEEE)received the PhD from the School of Electrical and Computer Engi- neering, Georgia Institute of Technology, Atlanta, in

    work page

  25. [25]

    His research interests in- clude wireless, nano, and molecular communications and Internet of Everything

    He is currently the Head of Centre for neXt Communications (CXC), with the Department of Engineering, University of Cambridge, U.K., and the Director of Centre for neXt Communications (CXC), Koç University, Türkiye. His research interests in- clude wireless, nano, and molecular communications and Internet of Everything

    work page