메뉴 건너뛰기




Volumn 30, Issue 1, 1984, Pages 84-85

Notes on the Asymptotic Behavior of the Information Rate of Block Codes

Author keywords

[No Author keywords available]

Indexed keywords

CODES, SYMBOLIC;

EID: 0021169217     PISSN: 00189448     EISSN: 15579654     Source Type: Journal    
DOI: 10.1109/TIT.1984.1056844     Document Type: Article
Times cited : (7)

References (4)
  • 1
    • 0003525990 scopus 로고    scopus 로고
    • The Theory of Error-Correcting Codes
    • Amsterdam: North-Holland
    • F. J. MacWilliams and N. J. A. Sloane, The Theory of Error-Correcting Codes Amsterdam: North-Holland, 1977.
    • MacWilliams, F.J.1    Sloane, N.J.A.2
  • 2
    • 0004216907 scopus 로고    scopus 로고
    • Algebraic Coding Theory
    • New York: McGraw-Hill
    • E. R. Berlekamp, Algebraic Coding Theory. New York: McGraw-Hill, 1968.
    • Berlekamp, E.R.1
  • 3
    • 77956681397 scopus 로고
    • Bounds on the information rate of a tree code as a function of the code’s feedback decoding minimum distance
    • M. J. Aaltonen, “Bounds on the information rate of a tree code as a function of the code’s feedback decoding minimum distance,” Ann. Univ. Turkuensis, Ser. A I, no. 181, 1981.
    • (1981) Ann. Univ. Turkuensis , Issue.181
    • Aaltonen, M.J.1
  • 4
    • 0013482499 scopus 로고
    • What is the maximum number of points on a curve over F2?
    • Yu. I. Manin, “What is the maximum number of points on a curve over F2?” J. Fac. Sci. Tokyo, vol. 28, no. 3, pp. 715–720, 1981.
    • (1981) J. Fac. Sci. Tokyo , vol.28 , Issue.3 , pp. 715-720
    • Manin, Y.I.1


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