Construction of constrained codes for state-independent decoding

Authors:
Craig Jamieson;Ivan Fair
Affiliations:
Department of Electrical and Computer Engineering, Edmonton, AB, Canada;Department of Electrical and Computer Engineering, Edmonton, AB, Canada
Venue:
IEEE Journal on Selected Areas in Communications
Year:
2010

Citing 4
Cited 0

Efficient implementation of the first-fit strategy for dynamic storage allocation

ACM Transactions on Programming Languages and Systems (TOPLAS)
Introduction to Algorithms

Introduction to Algorithms
The complexity of theorem-proving procedures

STOC '71 Proceedings of the third annual ACM symposium on Theory of computing
Stabilization of Block-Type-Decodability Properties for Constrained Systems

SIAM Journal on Discrete Mathematics

Quantified Score

Hi-index	0.07

Visualization

Abstract

Constrained sequence codes are widely used to meet constraints imposed by digital storage and communication systems. This paper develops an algorithm for the construction of constrained codes that admit state-independent decoding. By partitioning the code into a group of alphabets, one for each state, a codebook is developed using this algorithm that will allow the code to be decoded at the receiver without the need for state information. Finally, we use this algorithm to construct DC-free runlength-limited (RLL) codes, and we present two highly efficient state-independent decodable DC-free RLL codes.