The known lower bound of Körner and Simonyi [SIAM J. Discrete Math., 1988, vol. 1, no. 3, pp. 355–359] on the rate of binary codes with the property of simultaneous separation of any two pairs of codewords is improved by a factor of 1.5.
Problems of Information Transmission – Springer Journals
Published: Oct 9, 2004
It’s your single place to instantly
discover and read the research
that matters to you.
Enjoy affordable access to
over 18 million articles from more than
15,000 peer-reviewed journals.
All for just $49/month
Query the DeepDyve database, plus search all of PubMed and Google Scholar seamlessly
Save any article or search result from DeepDyve, PubMed, and Google Scholar... all in one place.
All the latest content is available, no embargo periods.
“Whoa! It’s like Spotify but for academic articles.”@Phil_Robichaud