title: New lower bounds of the size of error-correcting codes for the Z-channel
abstract: Optimization problems on graphs are formulated to obtain new lower bounds of the size of error-correcting codes for the Z-channel
keyphrases: lower bounds error-correcting codes Z-channel optimization problems graphs