Automatic taxonomy generation: Issues and possibilities
Raghu Krishnapuram, Krishna Kummamuru
IFSA 2003
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
Raghu Krishnapuram, Krishna Kummamuru
IFSA 2003
Lixi Zhou, Jiaqing Chen, et al.
VLDB
Chidanand Apté, Fred Damerau, et al.
ACM Transactions on Information Systems (TOIS)
Indranil R. Bardhan, Sugato Bagchi, et al.
JMIS