메뉴 건너뛰기




Volumn , Issue , 2004, Pages 145-154

Cyclic Redundancy Code (CRC) polynomial selection for embedded networks

Author keywords

[No Author keywords available]

Indexed keywords

DATA ACQUISITION; DECISION MAKING; EMBEDDED SYSTEMS; ERROR CORRECTION; POLYNOMIALS;

EID: 4544268912     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/dsn.2004.1311885     Document Type: Conference Paper
Times cited : (282)

References (24)
  • 1
    • 0032139074 scopus 로고    scopus 로고
    • On the cyclic redundancy-check codes with 8-bit redundancy
    • [Baicheva98]
    • [Baicheva98] Baicheva, T., S. Dodunekov & P. Kazakov, "On the cyclic redundancy-check codes with 8-bit redundancy," Computer Communications, vol. 21, 1998, pp. 1030-1033.
    • (1998) Computer Communications , vol.21 , pp. 1030-1033
    • Baicheva, T.1    Dodunekov, S.2    Kazakov, P.3
  • 2
    • 0034295964 scopus 로고    scopus 로고
    • Undetected error probability performance of cyclic redundancy-check codes of 16-bit redundancy
    • [Baicheva00] Oct.
    • [Baicheva00] Baicheva, T., S. Dodunekov & P. Kazakov, "Undetected error probability performance of cyclic redundancy-check codes of 16-bit redundancy," IEEE Proc. Comms., Vol. 147, No. 5, Oct. 2000, pp. 253-256.
    • (2000) IEEE Proc. Comms. , vol.147 , Issue.5 , pp. 253-256
    • Baicheva, T.1    Dodunekov, S.2    Kazakov, P.3
  • 4
    • 0027612155 scopus 로고
    • Optimization of cyclic redundancy-check codes with 24 and 32 parity bits
    • [Castagnoli93] June
    • [Castagnoli93] Castagnoli, G., S. Braeuer & M. Herrman, "Optimization of Cyclic Redundancy-Check Codes with 24 and 32 Parity Bits", IEEE Trans. on Communications, Vol. 41, No. 6, June 1993.
    • (1993) IEEE Trans. on Communications , vol.41 , Issue.6
    • Castagnoli, G.1    Braeuer, S.2    Herrman, M.3
  • 5
    • 4544292340 scopus 로고    scopus 로고
    • [Gilmore02] (source code), accessed on October 22
    • [Gilmore02] Gilmore, J., "Parallel CRC Equation Generator" (source code), accessed on October 22, 2002 at: http://www.physics.ohio-state. edu/~cms/crc_generator
    • (2002) Parallel CRC Equation Generator
    • Gilmore, J.1
  • 7
    • 0024065586 scopus 로고
    • Performance comparison of standard frame transmission formats FT1.2 and FT2 specified by IEC TC57
    • [Funk88]
    • [Funk88] Funk, G., "Performance comparison of standard frame transmission formats FT1.2 and FT2 specified by IEC TC57", ntzArchiv Bd. 10, 1988, pp. 217-221.
    • (1988) NtzArchiv Bd. 10 , vol.10 , pp. 217-221
    • Funk, G.1
  • 10
    • 4544308643 scopus 로고    scopus 로고
    • [Jaffer03] accessed September 27
    • [Jaffer03] Jaffer, A., "Mathematical packages: cyclic checksum," accessed September 27, 2003 at http://www.swiss.ai.mit.edu/ ~jaffer/slib_4.html#IDX522
    • (2003) Mathematical Packages: Cyclic Checksum
    • Jaffer, A.1
  • 11
    • 0035269588 scopus 로고    scopus 로고
    • Fast calculation of the number of minimum-weight words of CRC codes
    • [Kazakov01] 3, March
    • [Kazakov01] Kazakov, P., "Fast calculation of the number of minimum-weight words of CRC codes," IEEE Trans. Information Theory, (47) 3, March 2001, pp. 1190-1195.
    • (2001) IEEE Trans. Information Theory , Issue.47 , pp. 1190-1195
    • Kazakov, P.1
  • 13
    • 0036922195 scopus 로고    scopus 로고
    • 32-Bit cyclic redundancy codes for Internet applications
    • [Koopman02] Washington DC, July
    • [Koopman02] Koopman, P., "32-bit cyclic redundancy codes for Internet applications," Intl. Conf. Dependable Systems and Networks (DSN), Washington DC, July 2002, pp. 459-468.
    • (2002) Intl. Conf. Dependable Systems and Networks (DSN) , pp. 459-468
    • Koopman, P.1


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