Coding Schemes Based on Reed-Muller Codes for (d,∞)-RLL Input-Constrained Channels

11/10/2022
by   V. Arvind Rameshwar, et al.
0

The paper considers coding schemes derived from Reed-Muller (RM) codes, for transmission over input-constrained memoryless channels. Our focus is on the (d,∞)-runlength limited (RLL) constraint, which mandates that any pair of successive 1s be separated by at least d 0s. In our study, we first consider (d,∞)-RLL subcodes of RM codes, taking the coordinates of the RM codes to be in the standard lexicographic ordering. We show, via a simple construction, that RM codes of rate R have linear (d,∞)-RLL subcodes of rate R·2^-⌈log_2(d+1)⌉. We then show that our construction is essentially rate-optimal, by deriving an upper bound on the rates of linear (d,∞)-RLL subcodes of RM codes of rate R. Next, for the special case when d=1, we prove the existence of potentially non-linear (1,∞)-RLL subcodes that achieve a rate of max(0,R-3/8). This, for R > 3/4, beats the R/2 rate obtainable from linear subcodes. We further derive upper bounds on the rates of (1,∞)-RLL subcodes, not necessarily linear, of a certain canonical sequence of RM codes of rate R. We then shift our attention to settings where the coordinates of the RM code are not ordered according to the lexicographic ordering, and derive rate upper bounds for linear (d,∞)-RLL subcodes in these cases as well. Finally, we present a new two-stage constrained coding scheme, again using RM codes of rate R, which outperforms any linear coding scheme using (d,∞)-RLL subcodes, for values of R close to 1.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/09/2022

Linear Runlength-Limited Subcodes of Reed-Muller Codes and Coding Schemes for Input-Constrained BMS Channels

In this work, we address the question of the largest rate of linear subc...
research
08/20/2018

Optimized Rate-Adaptive Protograph-Based LDPC Codes for Source Coding with Side Information

This paper considers the problem of source coding with side information ...
research
04/14/2022

A Feedback Capacity-Achieving Coding Scheme for the (d,∞)-RLL Input-Constrained Binary Erasure Channel

This paper considers the memoryless input-constrained binary erasure cha...
research
06/21/2021

Strong Singleton type upper bounds for linear insertion-deletion codes

The insertion-deletion codes was motivated to correct the synchronizatio...
research
09/19/2018

Zero-error communication over adder MAC

Adder MAC is a simple noiseless multiple-access channel (MAC), where if ...
research
03/16/2018

Runlength-Limited Sequences and Shift-Correcting Codes

This work is motivated by the problem of error correction in bit-shift c...
research
12/20/2020

Achieving positive rates with predetermined dictionaries

In the first part of the paper we consider binary input channels that ar...

Please sign up or login with your details

Forgot password? Click here to reset