DeepAI AI Chat
Log In Sign Up

Asymptotic Behavior and Typicality Properties of Runlength-Limited Sequences

by   Mladen Kovačević, et al.
University of Novi Sad

We study properties of binary runlength-limited sequences with additional restrictions on their weight and/or the number of runs of identical symbols they contain. An algebraic and a probabilistic (entropic) characterization of the exponential growth rate of the number of such sequences, i.e., their information capacity, are obtained, and properties of the capacity as a function of its parameters are stated. The second-order term in the asymptotic expansion of the rate of these sequences is also given, and the typical values of the relevant quantities are derived. Several applications of the results are illustrated, including bounds on codes for the run-preserving insertion-deletion channel in the fixed-number-of-errors regime, a sphere-packing bound for sparse-noise channels in the fixed-fraction-of errors regime, and the asymptotics of constant-weight sub-block constrained sequences. In addition, the asymptotics of a closely related notion – q-ary sequences with fixed Manhattan weight – is briefly discussed, and an application in coding for molecular timing channels is illustrated.


page 2

page 3

page 5

page 6

page 7

page 8

page 10

page 11


Runlength-Limited Sequences and Shift-Correcting Codes

This work is motivated by the problem of error correction in bit-shift c...

On the Performance of Reed-Muller Codes with respect to Random Errors and Erasures

This work proves new results on the ability of binary Reed-Muller codes ...

The Sphere Packing Bound For Memoryless Channels

Sphere packing bounds (SPBs) ---with prefactors that are polynomial in t...

Third-order Analysis of Channel Coding in the Moderate Deviations Regime

The channel coding problem in the moderate deviations regime is studied;...

Channel Simulation: Finite Blocklengths and Broadcast Channels

We study channel simulation under common randomness-assistance in the fi...

Constrained de Bruijn Codes: Properties, Enumeration, Constructions, and Applications

The de Bruijn graph, its sequences, and their various generalizations, h...

Multivariate Analytic Combinatorics for Cost Constrained Channels and Subsequence Enumeration

Analytic combinatorics in several variables is a powerful tool for deriv...