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

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

V. P. Shilo

Publication date: 16 September 2003

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

Full work available at URL: https://doi.org/10.1023/a:1015579729144

zbMATH Keywords

discrete optimization problemlower bounderror-correcting code\(Z\)-channel

Mathematics Subject Classification ID

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

Related Items (1)

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

This page was built for publication: New lower bounds of the size of error-correcting codes for the \(Z\)-channel