Publisher
Springer Berlin Heidelberg
Reference38 articles.
1. Belitskaja, E.E., Sidorenko, V.R., Stenström, P.: Testing of Memory with Defects of Fixed Configurations. In: Proceedings of 2nd International Workshop on Algebraic and Combinatorial Coding Theory, Leningrad, pp. 24–28 (1990)
2. Biggs, N.: Perfect Codes in Graphs. J. Combin. Theory Ser. B 15, 289–296 (1973)
3. Chen, H., Tzeng, N.: Efficient Resource Placement in Hypercubes Using Multiple–Adjacency Code. IEEE Trans. Comput. 43, 23–33 (1994)
4. Constantin, S.D., Rao, T.R.N.: On the Theory of Binary Asymmetric Error Correcting Codes. Information and Control 40, 20–26 (1979)
5. Dorbec, P., Mollard, M.: Perfect Codes in Cartesian Products of 2–Paths and Infinite Paths. The Electronic Journal of Combinatorics 12, R65 (2005)