메뉴 건너뛰기




Volumn 49, Issue 7, 2003, Pages 1788-1793

Data verification and reconciliation with generalized error-control codes

Author keywords

Data reconciliation and verification; Error correcting codes; Graph coloring

Indexed keywords

BOUNDARY CONDITIONS; CODES (SYMBOLS); DATA COMMUNICATION SYSTEMS; GRAPH THEORY;

EID: 0038782260     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/TIT.2003.813498     Document Type: Letter
Times cited : (23)

References (22)
  • 6
    • 0003397990 scopus 로고    scopus 로고
    • Set reconciliation with nearly optimal communication complexity
    • Cornell Univ., Ithaca, NY, Tech. Reps. TR199-1778, TR2000-1796,TR2000-1813
    • Y. Minsky, A. Trachtenberg, and R. Zippel, "Set reconciliation with nearly optimal communication complexity," Cornell Univ., Ithaca, NY, Tech. Reps. TR199-1778, TR2000-1796,TR2000-1813, 2000.
    • (2000)
    • Minsky, Y.1    Trachtenberg, A.2    Zippel, R.3
  • 9
    • 0024666184 scopus 로고
    • Design of self-diagnostic boards by signature analysis
    • May
    • M. G. Karpovsky and P. Nagvajara, "Design of self-diagnostic boards by signature analysis," IEEE Trans. Ind. Electron., vol. 36, pp. 241-246, May 1989.
    • (1989) IEEE Trans. Ind. Electron. , vol.36 , pp. 241-246
    • Karpovsky, M.G.1    Nagvajara, P.2
  • 10
    • 0001467577 scopus 로고
    • The zero-error side information problem and chromatic numbers
    • Sept.
    • H. Witsenhausen, "The zero-error side information problem and chromatic numbers," IEEE Trans. Inform. Theory, vol. IT-22, p. 592, Sept. 1976.
    • (1976) IEEE Trans. Inform. Theory , vol.IT-22 , pp. 592
    • Witsenhausen, H.1
  • 11
    • 0030241020 scopus 로고    scopus 로고
    • Source coding and graphs entropies
    • Sept.
    • N. Alon and A. Orlitsky, "Source coding and graphs entropies," IEEE Trans. Inform. Theory, vol. 42, pp. 1329-1339, Sept. 1996.
    • (1996) IEEE Trans. Inform. Theory , vol.42 , pp. 1329-1339
    • Alon, N.1    Orlitsky, A.2
  • 12
    • 0000293430 scopus 로고
    • Interactive communication of balanced distributions and correlated files
    • Nov.
    • A. Orlitsky, "Interactive communication of balanced distributions and correlated files," SIAM J. Discr. Math., vol. 6, no. 4, pp. 548-564, Nov. 1993.
    • (1993) SIAM J. Discr. Math. , vol.6 , Issue.4 , pp. 548-564
    • Orlitsky, A.1
  • 13
    • 0026374112 scopus 로고    scopus 로고
    • Interactive communication: Balanced distributions, correlated files, and average-case complexity
    • ____, "Interactive communication: Balanced distributions, correlated files, and average-case complexity," in Proc. 32nd Annu. Symp. Foundations of Computer Science, 1991, pp. 228-238.
    • Proc. 32nd Annu. Symp. Foundations of Computer Science, 1991 , pp. 228-238
    • Orlitsky, A.1
  • 16
    • 0002619432 scopus 로고
    • Binary codes capable of correcting spurious insertions and deletions of ones
    • V. Levenshtein, "Binary codes capable of correcting spurious insertions and deletions of ones," Probl. Inform. Transm., vol. 1, no. 1, pp. 8-17, 1965.
    • (1965) Probl. Inform. Transm. , vol.1 , Issue.1 , pp. 8-17
    • Levenshtein, V.1
  • 17
    • 0035089745 scopus 로고    scopus 로고
    • Efficient reconstruction of sequences
    • Jan.
    • ____, "Efficient reconstruction of sequences," IEEE Trans. Inform. Theory, vol. 47, pp. 2-22, Jan. 2001.
    • (2001) IEEE Trans. Inform. Theory , vol.47 , pp. 2-22
    • Levenshtein, V.1
  • 18
    • 84959695157 scopus 로고
    • On coloring the nodes of a network
    • R. Brooks, "On coloring the nodes of a network," in Proc. Cambridge Phil. Soc., vol. 37, 1941, pp. 194-197.
    • (1941) Proc. Cambridge Phil. Soc. , vol.37 , pp. 194-197
    • Brooks, R.1
  • 21
    • 0003904360 scopus 로고    scopus 로고
    • GSGC: An efficient gossip-style garbage collection scheme for scalable reliable multicast
    • Cornell Univ., Tech. Rep., Dec.
    • K. Guo, M. Hayden, R. v. Renesse, W. Vogels, and K. P. Birman, "GSGC: An efficient gossip-style garbage collection scheme for scalable reliable multicast," Cornell Univ., Tech. Rep., Dec. 1997.
    • (1997)
    • Guo, K.1    Hayden, M.2    Renesse, R.V.3    Vogels, W.4    Birman, K.P.5
  • 22
    • 0004160113 scopus 로고    scopus 로고
    • Probabilistic broadcast
    • Cornell Univ., Tech. Rep.
    • M. Hayden and K. Birman, "Probabilistic broadcast," Cornell Univ., Tech. Rep., 1996.
    • (1996)
    • Hayden, M.1    Birman, K.2


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