Automatic taxonomy generation: Issues and possibilities
Raghu Krishnapuram, Krishna Kummamuru
IFSA 2003
The problem of preventing quasi-catastrophic error propagation in maximum-likelihood and reduced-state sequence detection for multilevel partial-response channels with transfer functions (1 − DP) and (1 + DP) is studied. M-ary channel input sequences that limit the length of minimum distance error events to L symbols are exhaustively characterized by finite-state transition diagrams. An efficient procedure for computing the capacity associated with these transition diagrams is given. Efficient constrained codes that can be readily implemented by finite-state encoders and block decoders with small error propagation are constructed. © 1995 IEEE
Raghu Krishnapuram, Krishna Kummamuru
IFSA 2003
Victor Valls, Panagiotis Promponas, et al.
IEEE Communications Magazine
Ruixiong Tian, Zhe Xiang, et al.
Qinghua Daxue Xuebao/Journal of Tsinghua University
Thomas M. Cheng
IT Professional