Error-Resilient Weakly Constrained Coding via Row-by-Row Coding

Fuente: arXiv
Saved in:
Bibliographic Details
Main Authors: Mishra, Prachi, Kashyap, Navin
Format: Preprint
Published: 2024
Subjects:
Online Access:
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866914912630996992
author Mishra, Prachi
Kashyap, Navin
author_facet Mishra, Prachi
Kashyap, Navin
contents A weakly constrained code is a collection of finite-length strings over a finite alphabet in which certain substrings or patterns occur according to some prescribed frequencies. Buzaglo and Siegel (ITW 2017) gave a construction of weakly constrained codes based on row-by-row coding, that achieved the capacity of the weak constraint. In this paper, we propose a method to make this row-by-row coding scheme resilient to errors.
format Preprint
id arxiv_https___arxiv_org_abs_2404_18469
institution arXiv
publishDate 2024
record_format arxiv
spellingShingle Error-Resilient Weakly Constrained Coding via Row-by-Row Coding
Mishra, Prachi
Kashyap, Navin
Information Theory
A weakly constrained code is a collection of finite-length strings over a finite alphabet in which certain substrings or patterns occur according to some prescribed frequencies. Buzaglo and Siegel (ITW 2017) gave a construction of weakly constrained codes based on row-by-row coding, that achieved the capacity of the weak constraint. In this paper, we propose a method to make this row-by-row coding scheme resilient to errors.
title Error-Resilient Weakly Constrained Coding via Row-by-Row Coding
topic Information Theory
url https://arxiv.org/abs/2404.18469