Conference paper
Automatic taxonomy generation: Issues and possibilities
Raghu Krishnapuram, Krishna Kummamuru
IFSA 2003
The usual (k2 + 1) × (k1 + 1) array code, in which the last row and the last column contain redundant bits, can correct any single error. However, if the bits are read diagonally instead of horizontally, the code can correct bursts of errors. It is shown that the (k2 + 1) × (k1 + 1) array code with diagonal readout can correct any burst of length up to k1 if and only if k2 ≥ 2(k1 − 1). Copyright © 1986 by The Institute of Electrical and Electronics Engineers, Inc.
Raghu Krishnapuram, Krishna Kummamuru
IFSA 2003
Rajiv Ramaswami, Kumar N. Sivarajan
IEEE/ACM Transactions on Networking
N.K. Ratha, A.K. Jain, et al.
Workshop CAMP 2000
Maurice Hanan, Peter K. Wolff, et al.
DAC 1976