English
Related papers

Related papers: Run-Length-Limited ISI-Mitigation (RLIM) Coding fo…

200 papers

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…

Information Theory · Computer Science 2026-05-01 Melih Şahin , Ozgur B. Akan

In diffusion based molecular communication, the intersymbol interference (ISI) is an important reason for system performance degradation, which is caused by the random movement, out-of-order arrival and indistinguishability of the…

Information Theory · Computer Science 2019-01-01 Hui Li , Qingchao Li

A diffusion molecular channel is a channel with memory, as molecules released into the medium hit the receptors after a random delay. Coding over the diffusion channel is performed by choosing the type, intensity, or the released time of…

Channel memory and inter-symbol interference (ISI) are harmful factors in diffusion-based molecular communication (DBMC) between bionanosensors. To tackle these problems, this paper proposes a lightweight ISI-mitigating coding scheme to…

Information Theory · Computer Science 2023-05-24 Dongliang Jing , Andrew W. Eckford

Intersymbol Interference (ISI) is a major bottleneck in Molecular Communication via Diffusion (MCvD), degrading system performance. This paper introduces two families of linear channel codes to mitigate ISI: Zero Pad Zero Start (ZPZS) and…

Information Theory · Computer Science 2025-07-01 Tamoghno Nath , Krishna Gopal Benerjee , Adrish Banerjee

In this paper we propose a matched encoding (ME) scheme for convolutionally encoded transmission over intersymbol interference (usually called ISI) channels. A novel trellis description enables to perform equalization and decoding jointly,…

Information Theory · Computer Science 2012-10-05 Fabian Schuh , Andreas Schenk , Johannes B. Huber

Reed-Muller (RM) codes are known for their good maximum likelihood (ML) performance in the short block-length regime. Despite being one of the oldest classes of channel codes, finding a low complexity soft-input decoding scheme is still an…

Information Theory · Computer Science 2021-07-28 Marvin Geiselhart , Ahmed Elkelesh , Moustafa Ebada , Sebastian Cammerer , Stephan ten Brink

Traditional wireless communications rely solely on bit-level channel coding for error correction, without exploiting the inherent linguistic structure of the data source. This paper proposes a large language model (LLM) Viterbi decoder that…

Information Theory · Computer Science 2026-04-22 Zhengtong Li , Chentao Yue , Jiafu Hao , Branka Vucetic , Yonghui Li

In this work, we address the question of the largest rate of linear subcodes of Reed-Muller (RM) codes, all of whose codewords respect a runlength-limited (RLL) constraint. Our interest is in the $(d,\infty)$-RLL constraint, which mandates…

Information Theory · Computer Science 2022-08-05 V. Arvind Rameshwar , Navin Kashyap

Maximum run-length limited codes are constraint codes used in communication and data storage systems. Insertion/deletion correcting codes correct insertion or deletion errors caused in transmitted sequences and are used for combating…

Information Theory · Computer Science 2020-12-29 Reona Takemoto , Takayuki Nozaki

This letter introduces a novel algorithm for generating codebooks in molecular communications (MC). The proposed algorithm utilizes character entropy to effectively mitigate inter-symbol interference (ISI) during MC via diffusion. Based on…

Information Theory · Computer Science 2023-06-07 Haewoong Hyun Changmin Lee , Miaowen Wen , Sang-Hyo Kim , Chan-Byoung Chae

The paper considers coding schemes derived from Reed-Muller (RM) codes, for transmission over input-constrained memoryless channels. Our focus is on the $(d,\infty)$-runlength limited (RLL) constraint, which mandates that any pair of…

Information Theory · Computer Science 2023-05-23 V. Arvind Rameshwar , Navin Kashyap

Universally achievable error exponents pertaining to certain families of channels (most notably, discrete memoryless channels (DMC's)), and various ensembles of random codes, are studied by combining the competitive minimax approach,…

Information Theory · Computer Science 2007-08-01 Yaniv Akirav , Neri Merhav

In this letter, a novel run-length limited (RLL) code is reported. In addition to providing a strict DC-balance and other relevant features for visible light communication (VLC) applications, the proposed 5B10B code presents enhanced error…

Signal Processing · Electrical Eng. & Systems 2019-12-30 Vitalio Alfonso Reguera

The space-time bit-interleaved coded modulation (ST-BICM) is an efficient technique to obtain high diversity and coding gain on a block-fading MIMO channel. Its maximum-likelihood (ML) performance is computed under ideal interleaving…

Information Theory · Computer Science 2016-11-15 Nicolas Gresset , Loic Brunel , Joseph Boutros

This paper suggests achieving diversity gains while utilizing low-denisty parity check (LDPC) codes in molecular communications. Intersymbol interference (ISI) causes a significant disadvantage in error performance for molecular…

Signal Processing · Electrical Eng. & Systems 2024-12-06 Alpar Türkoğlu , Berk Karabacakoğlu , Ali Emre Pusane

In the transmission of digital data at a relatively high rate over a particular band limited channel, it is normally necessary to employ an equalizer at the receiver in order to correct the signal distortion introduced by the channel .ISI…

Information Theory · Computer Science 2014-03-18 Laith Awda Kadhim , Salih Mohammed , Osamah Saad

A present challenge in wireless communications is the assurance of ultra-reliable and low-latency communication (URLLC). While the reliability aspect is well known to be improved by channel coding with long codewords, this usually implies…

Information Theory · Computer Science 2023-03-15 Sahar Allahkaram , Francisco A. Monteiro , Ioannis Chatzigeorgiou

Run length limited (RLL) codes are used in visible light communication (VLC) to avoid flicker and to support different dimming ranges such that communication is not affected by the variation in light intensity. In this paper, we propose a…

Information Theory · Computer Science 2019-06-06 Nitin Jain , Adrish Banerjee

This paper considers the average complexity of maximum likelihood (ML) decoding of convolutional codes. ML decoding can be modeled as finding the most probable path taken through a Markov graph. Integrated with the Viterbi algorithm (VA),…

Information Theory · Computer Science 2016-11-17 Jie Luo
‹ Prev 1 2 3 10 Next ›