메뉴 건너뛰기
IEEE International Symposium on Information Theory - Proceedings
Volumn , Issue , 2004, Pages 161-
Analysis of bit-stuffing codes and lower bounds on capacity for 2-D constrained arrays using quasi-stationary measures
Author keywords

[No Author keywords available]
Indexed keywords

BIT-STUFFING CODES; CONSTRAINED ARRAYS; LOWER BOUNDS; QUASI-STATIONARY MEASURES;
EID: 5044244786     PISSN: 21578097     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper
Times cited : (2)
References (3)
  • 1
    • 0035270843 scopus 로고    scopus 로고
    • Efficient coding schemes for the hard-square model
    • March
    • R.M. Roth, P.H. Siegel and J.K. Wolf, "Efficient coding schemes for the hard-square model," IEEE Trans. Inform. Theory, vol. 47, pp. 1166-76, March, 2001.
    • (2001) IEEE Trans. Inform. Theory , vol.47 , pp. 1166-1176
    • Roth, R.M.1    Siegel, P.H.2    Wolf, J.K.3
  • 2
    • 0036350014 scopus 로고    scopus 로고
    • Improved bit-stuffing bounds on two-dimensional constraints
    • Lausanne, Switzerland
    • S. Halevy, J. Chen, R.M. Roth, P.H. Siegel, J.K. Wolf, "Improved bit-stuffing bounds on two-dimensional constraints," Proc. ISIT'02, Lausanne, Switzerland, p. 385, 2002.
    • (2002) Proc. ISIT'02 , pp. 385
    • Halevy, S.1    Chen, J.2    Roth, R.M.3    Siegel, P.H.4    Wolf, J.K.5
  • 3
    • 0032625906 scopus 로고    scopus 로고
    • Entropy bounds for constrained two-dimensional random fields
    • Jan.
    • S. Forchhammer and J. Justesen, "Entropy bounds for constrained two-dimensional random fields," IEEE Trans. Inform. Theory, vol. 45, no. 1, pp. 118-127, Jan. 1999.
    • (1999) IEEE Trans. Inform. Theory , vol.45 , Issue.1 , pp. 118-127
    • Forchhammer, S.1    Justesen, J.2

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