메뉴 건너뛰기




Volumn 30, Issue 2, 1982, Pages 317-324

On the Probability of Undetected Error for Linear Block Codes

Author keywords

[No Author keywords available]

Indexed keywords

PROBABILITY;

EID: 0020088210     PISSN: 00906778     EISSN: None     Source Type: Journal    
DOI: 10.1109/TCOM.1982.1095473     Document Type: Article
Times cited : (113)

References (11)
  • 1
    • 0016926397 scopus 로고
    • Concerning a bound on undetected error probability
    • Mar.
    • S. K. Leung-Yan-Cheong and M. Hellman, “Concerning a bound on undetected error probability,” IEEE Trans. Inform. Theory, vol. IT-22, pp. 235–237, Mar. 1976.
    • (1976) IEEE Trans. Inform. Theory , vol.IT-22 , pp. 235-237
    • Leung-Yan-Cheong, S.K.1    Hellman, M.2
  • 2
    • 0018324812 scopus 로고
    • On some properties of the undetected error probability of linear codes
    • Jan.
    • S. K. Leung-Yan-Cheong, E. R. Barnes, and D. U. Friedman, “On some properties of the undetected error probability of linear codes,” IEEE Trans. Inform. Theory, vol. IT-25, pp. 110–112, Jan. 1979.
    • (1979) IEEE Trans. Inform. Theory , vol.IT-25 , pp. 110-112
    • Leung-Yan-Cheong, S.K.1    Barnes, E.R.2    Friedman, D.U.3
  • 3
    • 0018285377 scopus 로고
    • A performance analysis of a family of codes constructed from simple binary codes
    • presented at Canadian Conf. Commun. and Power, Montreal, P.Q., Canada, Oct.
    • J. Lawton, A. Michelson, and Z. Huntoon, “A performance analysis of a family of codes constructed from simple binary codes,” presented at Canadian Conf. Commun. and Power, Montreal, P.Q., Canada, Oct. 1978.
    • (1978)
    • Lawton, J.1    Michelson, A.2    Huntoon, Z.3
  • 5
    • 0004511506 scopus 로고
    • Coding techniques for digital data networks
    • NTG-Fachberichte, Berlin, Germany, Sept.
    • J. Massey, “Coding techniques for digital data networks,” in Proc. Int. Conf. Inform. Theory and Syst., NTG-Fachberichte, vol. 65, Berlin, Germany, Sept. 18–20, 1978.
    • (1978) Proc. Int. Conf. Inform. Theory and Syst. , vol.65 , pp. 18-20
    • Massey, J.1
  • 6
    • 0019035620 scopus 로고
    • A simple derivation of the MacWilliams identity for linear codes
    • July
    • S. C. Chang and J. K. Wolf, “A simple derivation of the MacWilliams identity for linear codes,” IEEE Trans. Inform. Theory, vol. IT–26, pp. 476–477, July 1980.
    • (1980) IEEE Trans. Inform. Theory , vol.IT-26 , pp. 476-477
    • Chang, S.C.1    Wolf, J.K.2
  • 7
    • 0002627993 scopus 로고
    • A theorem on the distribution of weights in a systematic code
    • Jan.
    • F. J. MacWilliams, “A theorem on the distribution of weights in a systematic code,” Bell Syst. Tech. J., vol. 42, pp. 79–94, Jan. 1963.
    • (1963) Bell Syst. Tech. J. , vol.42 , pp. 79-94
    • MacWilliams, F.J.1
  • 8
    • 33747378968 scopus 로고
    • A fundamental inequality between the probabilities of binary subgroups and cosets
    • Jan.
    • D. D. Sullivan, “A fundamental inequality between the probabilities of binary subgroups and cosets,” IEEE Trans. Inform. Theory, vol. IT-13, pp. 91–124, Jan. 1967.
    • (1967) IEEE Trans. Inform. Theory , vol.IT-13 , pp. 91-124
    • Sullivan, D.D.1
  • 10
    • 84910945835 scopus 로고
    • On the weight structure and symmetry of BCH codes
    • Contract Rep. AFCRL-65-515, July
    • W. W. Peterson, “On the weight structure and symmetry of BCH codes,” Contract Rep. AFCRL-65-515, July 1963.
    • (1963)
    • Peterson, W.W.1
  • 11
    • 84939045067 scopus 로고
    • Concatenated Codes (Res. Monograph 37) Cambridge, MA: MIT Press
    • G. D. Forney, Concatenated Codes (Res. Monograph 37) Cambridge, MA: MIT Press, 1966.
    • (1966)
    • Forney, G.D.1


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