research
∙
09/16/2023
Sampling-Based Estimates of the Sizes of Constrained Subcodes of Reed-Muller Codes
This paper develops an algorithmic approach for obtaining approximate, n...
share
research
∙
01/12/2023
Estimating the Sizes of Binary Error-Correcting Constrained Codes
In this paper, we study binary constrained codes that are resilient to b...
research
∙
11/10/2022
Coding Schemes Based on Reed-Muller Codes for (d,∞)-RLL Input-Constrained Channels
The paper considers coding schemes derived from Reed-Muller (RM) codes, ...
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
∙
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
∙
01/06/2022
On the Performance of Reed-Muller Codes Over (d,∞)-RLL Input-Constrained BMS Channels
This paper considers the input-constrained binary memoryless symmetric (...
research
∙
01/21/2021
Bounds on the Feedback Capacity of the (d,∞)-RLL Input-Constrained Binary Erasure Channel
The paper considers the input-constrained binary erasure channel (BEC) w...
research
∙
01/10/2020
Computable Lower Bounds for Capacities of Input-Driven Finite-State Channels
This paper studies the capacities of input-driven finite-state channels,...
research
∙
02/26/2019
Achieving Secrecy Capacity of Minimum Storage Regenerating Codes for all Feasible (n, k, d) Parameter Values
This paper addresses the problem of constructing secure exact-repair reg...
research
∙
01/10/2018