György E. Révész
Theoretical Computer Science
A (2n, k, l, c,d) dc free binary block code is a code of length 2n< constant weight n, 2k codewords, maximum runlength of a symbol l, maximum accumulated charge c, and minimum distance d. The purpose of this code is to achieve dc freeness and error correction at the same time. The goal is to keep the rate k/2n and d large and l and c small. Of course, these are conflicting goals. Ferreira presented a (16,8,8,5,4) dc free code. Here a (16,9,6,5,4) dc free code is presented. Easy encoding and decoding algorithms are also given. © 1988 IEEE
György E. Révész
Theoretical Computer Science
Michael Ray, Yves C. Martin
Proceedings of SPIE - The International Society for Optical Engineering
A. Gupta, R. Gross, et al.
SPIE Advances in Semiconductors and Superconductors 1990
Rajeev Gupta, Shourya Roy, et al.
ICAC 2006