Comments on "Novel Totally Self-Checking Berger Checker Designs Based on Generalized Berger Code Partitioning"

Rao et al. [1] proposed a totally self-checking (TSC) 2-output checker for Berger codes with I = 2^r-1 information bits. These comments show that their checker may not be self-testing, as claimed. Hence, the circuit proposed by us in [4] is the first correct solution of this design problem.