Universal Framework for Parametric Constrained Coding

04/03/2023
by   Daniella Bar-Lev, et al.
0

Constrained coding is a fundamental field in coding theory that tackles efficient communication through constrained channels. While channels with fixed constraints have a general optimal solution, there is increasing demand for parametric constraints that are dependent on the message length. Several works have tackled such parametric constraints through iterative algorithms, yet they require complex constructions specific to each constraint to guarantee convergence through monotonic progression. In this paper, we propose a universal framework for tackling any parametric constrained-channel problem through a novel simple iterative algorithm. By reducing an execution of this iterative algorithm to an acyclic graph traversal, we prove a surprising result that guarantees convergence with efficient average time complexity even without requiring any monotonic progression. We demonstrate the effectiveness of this universal framework by applying it to a variety of both local and global channel constraints. We begin by exploring the local constraints involving illegal substrings of variable length, where the universal construction essentially iteratively replaces forbidden windows. We apply this local algorithm to the minimal periodicity, minimal Hamming weight, local almost-balanced Hamming weight and the previously-unsolved minimal palindrome constraints. We then continue by exploring global constraints, and demonstrate the effectiveness of the proposed construction on the repeat-free encoding, reverse-complement encoding, and the open problem of global almost-balanced encoding. For reverse-complement, we also tackle a previously-unsolved version of the constraint that addresses overlapping windows. Overall, the proposed framework generates state-of-the-art constructions with significant ease while also enabling the simultaneous integration of multiple constraints for the first time.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/08/2022

Codes for Constrained Periodicity

Reliability is an inherent challenge for the emerging nonvolatile techno...
research
07/05/2020

Universal codes in the shared-randomness model for channels with general distortion capabilities

We put forth new models for universal channel coding. Unlike standard co...
research
08/19/2022

Two dimensional RC/Subarray Constrained Codes: Bounded Weight and Almost Balanced Weight

In this work, we study two types of constraints on two-dimensional binar...
research
11/21/2022

CONFIG: Constrained Efficient Global Optimization for Closed-Loop Control System Optimization with Unmodeled Constraints

In this paper, the CONFIG algorithm, a simple and provably efficient con...
research
01/14/2020

Group Testing with Runlength Constraints for Topological Molecular Storage

Motivated by applications in topological DNA-based data storage, we intr...
research
10/26/2019

A Deep Learning Approach to Universal Binary Visible Light Communication Transceiver

This paper studies a deep learning (DL) framework for the design of bina...
research
09/06/2022

Risk Aware Belief-dependent Constrained POMDP Planning

Risk awareness is fundamental to an online operating agent. However, it ...

Please sign up or login with your details

Forgot password? Click here to reset