We gratefully acknowledge support from
the Simons Foundation and member institutions.
Full-text links:

Download:

Current browse context:

cs.IT
< prev | next >
new | recent | 2404

Change to browse by:

cs
math

References & Citations

DBLP - CS Bibliography

listing | bibtex

Bookmark

(what is this?)
CiteULike logo BibSonomy logo Mendeley logo del.icio.us logo Digg logo Reddit logo

Computer Science > Information Theory

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

Authors: Prachi Mishra, Navin Kashyap
(Submitted on 29 Apr 2024)
Abstract: 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.
Comments: 9 pages, a shorter version is submitted at the International Symposium on Information Theory (ISIT) 2024
Subjects: Information Theory (cs.IT)
Cite as: arXiv:2404.18469 [cs.IT]
  (or arXiv:2404.18469v1 [cs.IT] for this version)

Submission history

From: Prachi Mishra [view email]
[v1] Mon, 29 Apr 2024 07:11:26 GMT (228kb,D)
Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)

Link back to: arXiv, form interface, contact.