New Lower Bounds of the Size of Error-Correcting Codes for the Z-Channel |
| |
Authors: | V. P. Shilo |
| |
Affiliation: | (1) Cybernetics Institute, National Academy of Sciences of Ukraine, Kiev, Ukraine |
| |
Abstract: | Optimization problems on graphs are formulated to obtain new lower bounds of the size of error-correcting codes for the Z-channel. |
| |
Keywords: | discrete optimization problem error-correcting code lower bound Z-channel |
本文献已被 SpringerLink 等数据库收录! |