메뉴 건너뛰기




Volumn 32, Issue 19, 1996, Pages 1758-1760

Partitioning of convolutional codes using a convolutional scrambler

Author keywords

Convolutional codes

Indexed keywords

BINARY SEQUENCES; CONSTRAINT THEORY; MATRIX ALGEBRA; TRELLIS CODES; VECTORS;

EID: 3242848095     PISSN: 00135194     EISSN: None     Source Type: Journal    
DOI: 10.1049/el:19961204     Document Type: Article
Times cited : (9)

References (4)
  • 2
    • 0242645418 scopus 로고
    • Short unit-memory byte-oriented binary convolutional codes having maximal free distance
    • LEE, L.-N.: 'Short unit-memory byte-oriented binary convolutional codes having maximal free distance', IEEE Trans., 1976, IT-22, pp. 349-352
    • (1976) IEEE Trans. , vol.IT-22 , pp. 349-352
    • Lee, L.-N.1
  • 3
    • 0027634632 scopus 로고
    • A linear algebra approach to minimal convolutional encoders
    • JOHANNESSON, R., and WAN, Z.: 'A linear algebra approach to minimal convolutional encoders', IEEE Trans., 1993, IT-39, pp. 1219-1233
    • (1993) IEEE Trans. , vol.IT-39 , pp. 1219-1233
    • Johannesson, R.1    Wan, Z.2
  • 4
    • 0003769249 scopus 로고
    • Short convolutional codes with maximal free distance for rates 1/2, 1/3 and 1/4
    • LARSEN, K.J.: 'Short convolutional codes with maximal free distance for rates 1/2, 1/3 and 1/4', IEEE Trans., 1973, IT-19, pp. 371-372
    • (1973) IEEE Trans. , vol.IT-19 , pp. 371-372
    • Larsen, K.J.1


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