Computing the stopping distance of a Tanner graph is NP-hard
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
1 Pith paper cite this work. Polarity classification is still indexing.