메뉴 건너뛰기




Volumn 44, Issue 2, 1998, Pages 599-611

On a new class of codes for identifying vertices in graphs

Author keywords

Code construction; Coding theory; Covering radius; Fault diagnosis; Graph theory; Multiprocessor systems

Indexed keywords

ERROR ANALYSIS; GRAPH THEORY; MATHEMATICAL MODELS; MULTIPROCESSING SYSTEMS; SET THEORY;

EID: 0032022632     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/18.661507     Document Type: Article
Times cited : (409)

References (26)
  • 1
    • 84892349312 scopus 로고
    • D. R. Avresky and D. K. Pradhan, Eds., Comput. Soc. Press
    • D. R. Avresky and D. K. Pradhan, Eds., Fault-Tolerant Parallel and Distributed Systems. Comput. Soc. Press, 1995.
    • (1995) Fault-tolerant Parallel and Distributed Systems
  • 5
    • 0022777610 scopus 로고
    • Further results on the covering radius of codes
    • Sept.
    • G. D. Cohen, A. C. Lobstein, and N. J. A. Sloane, "Further results on the covering radius of codes," IEEE Trans. Inform. Theory, vol. IT-32, pp. 680-694, Sept. 1986.
    • (1986) IEEE Trans. Inform. Theory , vol.IT-32 , pp. 680-694
    • Cohen, G.D.1    Lobstein, A.C.2    Sloane, N.J.A.3
  • 6
    • 0026854499 scopus 로고
    • The message-driven processor: A multicomputer processing node with efficient mechanisms
    • Apr.
    • W. J. Dally et al., "The message-driven processor: A multicomputer processing node with efficient mechanisms," IEEE Micro, vol. 12, pp. 23-39, Apr. 1992.
    • (1992) IEEE Micro , vol.12 , pp. 23-39
    • Dally, W.J.1
  • 7
    • 0003780715 scopus 로고
    • Reading, MA: Addison-Wesley
    • F. Harary, Graph Theory. Reading, MA: Addison-Wesley, 1969.
    • (1969) Graph Theory
    • Harary, F.1
  • 9
    • 0023981420 scopus 로고
    • Lower bounds for binary covering codes
    • Mar.
    • I. S. Honkala, "Lower bounds for binary covering codes," IEEE Trans. Inform. Theory, vol. 34, pp. 326-329, Mar. 1988.
    • (1988) IEEE Trans. Inform. Theory , vol.34 , pp. 326-329
    • Honkala, I.S.1
  • 11
    • 84976768440 scopus 로고
    • The CM-5 connection machine: A scalable supercomputer
    • W. D. Hillis and L. W. Tucker, "The CM-5 connection machine: A scalable supercomputer," Commun. Assoc. Comput. Mach., vol. 36, pp. 31-40, 1993.
    • (1993) Commun. Assoc. Comput. Mach. , vol.36 , pp. 31-40
    • Hillis, W.D.1    Tucker, L.W.2
  • 12
    • 0019584217 scopus 로고
    • Weight distribution of translates, covering radius and perfect codes correcting errors of the given weights
    • July
    • M. G. Karpovsky, "Weight distribution of translates, covering radius and perfect codes correcting errors of the given weights," IEEE Trans. Inform. Theory, vol. IT-27, pp. 462-472, July 1981.
    • (1981) IEEE Trans. Inform. Theory , vol.IT-27 , pp. 462-472
    • Karpovsky, M.G.1
  • 13
    • 0000987928 scopus 로고
    • Nonrandom binary superimposed codes
    • Oct.
    • W. H. Kautz and R. C. Singleton, "Nonrandom binary superimposed codes," IEEE Trans. Inform. Theory, vol. IT-10, pp. 363-367, Oct. 1964.
    • (1964) IEEE Trans. Inform. Theory , vol.IT-10 , pp. 363-367
    • Kautz, W.H.1    Singleton, R.C.2
  • 14
  • 15
    • 33747080131 scopus 로고
    • System diagnosis
    • D. K. Pradhan, Ed. Englewood Cliffs, NJ: Prentice-Hall
    • C. R. Kime, "System diagnosis," in Fault-Tolerant Computing: Theory and Techniques, vol. 2, D. K. Pradhan, Ed. Englewood Cliffs, NJ: Prentice-Hall, 1986.
    • (1986) Fault-tolerant Computing: Theory and Techniques , vol.2
    • Kime, C.R.1
  • 16
    • 0022141776 scopus 로고
    • Fat trees: Universal networks for hardware-efficient supercomputing
    • C. E. Leiserson, "Fat trees: Universal networks for hardware-efficient supercomputing," IEEE Trans. Comput., vol. C-34, pp 892-901, 1985.
    • (1985) IEEE Trans. Comput. , vol.C-34 , pp. 892-901
    • Leiserson, C.E.1
  • 18
    • 0002876117 scopus 로고
    • Conflict-resolution algorithms and random access communications
    • New York: Springer-Verlag
    • J. L. Massey, "Conflict-resolution algorithms and random access communications," Multi-User Communication Systems. New York: Springer-Verlag, 1981.
    • (1981) Multi-user Communication Systems
    • Massey, J.L.1
  • 21
    • 0026157767 scopus 로고
    • Upper bounds for q-ary covering codes
    • May
    • P. R. J. Östergård, "Upper bounds for q-ary covering codes," IEEE Trans. Inform. Theory, vol. 37, pp. 660-664, May 1991.
    • (1991) IEEE Trans. Inform. Theory , vol.37 , pp. 660-664
    • Östergård, P.R.J.1
  • 22
    • 84938017623 scopus 로고
    • On the connection assignment problem of diagnosable systems
    • Dec.
    • F. P. Preparata, G. Metze, and R. T. Chien, "On the connection assignment problem of diagnosable systems," IEEE Trans. Electron. Comput., vol. EC-16, pp. 848-854, Dec. 1967.
    • (1967) IEEE Trans. Electron. Comput. , vol.EC-16 , pp. 848-854
    • Preparata, F.P.1    Metze, G.2    Chien, R.T.3
  • 24
    • 0026154769 scopus 로고
    • HARTS: A distributed real-time architecture
    • May
    • K. G. Shin, "HARTS: A distributed real-time architecture," IEEE Computer, pp. 25-35, May 1991.
    • (1991) IEEE Computer , pp. 25-35
    • Shin, K.G.1
  • 25
    • 0022121186 scopus 로고
    • An efficient unsorted VLSI dictionary machine
    • Sept.
    • A. K. Somani and V. K. Agarwal, "An efficient unsorted VLSI dictionary machine," IEEE Trans. Comput., vol. 34, pp. 841-852, Sept. 1985.
    • (1985) IEEE Trans. Comput. , vol.34 , pp. 841-852
    • Somani, A.K.1    Agarwal, V.K.2
  • 26
    • 0005279284 scopus 로고    scopus 로고
    • Fault isolation and diagnosis in multiprocessor system with point-to-point connections
    • D. R. Avresky and D. R. Kaeli, Eds. Norwell, MA: Kluwer
    • K. Chakrabarty, M. G. Karpovsky, and L. B. Levitin, "Fault isolation and diagnosis in multiprocessor system with point-to-point connections," in Fault-Tolerant Parallel and Distributed Systems, D. R. Avresky and D. R. Kaeli, Eds. Norwell, MA: Kluwer, 1998, pp. 285-301.
    • (1998) Fault-tolerant Parallel and Distributed Systems , pp. 285-301
    • Chakrabarty, K.1    Karpovsky, M.G.2    Levitin, L.B.3


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.