Work

Error-Correcting Weakly Constrained Codes: Constructions and Achievable Rates

Year: 2026

Type: preprint

Abstract: We investigate weakly constrained codes, in which specific patterns occur with prescribed frequencies rather than being strictly forbidden as in conventional constrained coding. We propose a capacity-achieving construction of a weakly constrained codebook based on Eulerian cycles. We then obtain, via expurgation, weakly constrained codes with linear minimum distance and positive rate, and analyze the rates achievable. Finally, we propose a practical concatenated code construction that supports polynomial-time encoding and decoding.

Source: arXiv (Cornell University)

DOI: 10.48550/arxiv.2605.09113

Authors: Mishra, Prachi, Jaggi, Sidharth, Kashyap, Navin, Langberg, Michael

Institutions: Indian Institute of Science Bangalore, University of Bristol, University at Buffalo, State University of New York

Language: English

Topic: Error Correcting Code Techniques

Subfield: Computer Networks and Communications

Field: Computer Science

Domain: Physical Sciences

Open Access status: green

OpenAlex ID: W7160930270

Cites:

Cited by:

Related to: 10