Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
REFERENCES
Körner, J. and Simonyi, G., Separating Partition Systems and Locally Different Sequences, SIAM J. Discrete Math., 1988, vol. 1, no. 3, pp. 355–359.
Friedman, A.D., Graham, R.L., and Ullman, J.D., Universal Single Transition Time Asynchronous State Assignments, IEEE Trans. Comp., 1969, vol. 18, no. 6, pp. 541–547.
Sagalovich, Yu.L., Separating Systems, Probl. Peredachi Inf., 1994, vol. 30, no. 2, pp. 14–35 [Probl. Inf. Trans. (Engl. Transl.), 1994, vol. 30, no. 2, pp. 105–123].
Cohen, G.D. and Zémor, G., Intersecting Codes and Independent Families, IEEE Trans. Inf. Theory, 1994, vol. 40, no. 6, pp. 1872–1881.
Pinsker, M.S. and Sagalovich, Yu.L., Lower Bound on the Cardinality of Code of Automata's States, Probl. Peredachi Inf., 1972, vol. 8, no. 3, pp. 59–66.
Rights and permissions
About this article
Cite this article
Kabatiansky, G.A. On Pair-Separating Codes. Problems of Information Transmission 37, 329–331 (2001). https://doi.org/10.1023/A:1013871300662
Issue Date:
DOI: https://doi.org/10.1023/A:1013871300662