New lower bounds of the size of error-correcting codes for the \(Z\)-channel

DOI10.1023/A:1015579729144zbMath1029.68054MaRDI QIDQ1407338

V. P. Shilo

Publication date: 16 September 2003

Published in: Cybernetics and Systems Analysis (Search for Journal in Brave)

zbMATH Keywords

discrete optimization problem; lower bound; error-correcting code; \(Z\)-channel

Mathematics Subject Classification ID

68P30: Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science)

Related Items

Problems of discrete optimization: challenges and main approaches to solve them