Skip-Sliding Window Codes

Constrained coding is used widely in digital communication and storage systems. In this article, we study a generalized sliding window constraint called the skip-sliding window. A (SSW) code defined terms of length L window, skip J, cost E each Each valid codeword + kJ determined by k+1 windows where i starts at (iJ 1)th symbol for all non-negative integers such that ≤ k; must be satisfied. SSW constraints naturally arise applications as simultaneous energy information transfer, codes are also potential candidates visible light communications. work, two methods given to enumerate size further refinements made reduce enumeration complexity. Using proposed methods, noiseless capacity binary some useful observations made, fact provide greater than certain related classes constrained codes. Moreover, noisy bounds