메뉴 건너뛰기




Volumn 45, Issue 4, 1999, Pages 1280-1283

An efficient implementation of the d-homomorphism for generation of de bruijn sequences

Author keywords

D homomorphism; De bruijn sequences; Nonlinear feedback shift register sequences

Indexed keywords

ALGORITHMS; FUNCTIONS; MATHEMATICAL MORPHOLOGY; SHIFT REGISTERS;

EID: 0032639401     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/18.761285     Document Type: Article
Times cited : (24)

References (12)
  • 2
    • 0000869587 scopus 로고    scopus 로고
    • On a homomorphism of the de Bruijn graph and its applications to the design of feedback shift registers,"
    • 19, pp. 1204-1209, Dec. 1970.
    • A. Lempel On a homomorphism of the de Bruijn graph and its applications to the design of feedback shift registers," IEEE Trans. Comput., vol. C-19, pp. 1204-1209, Dec. 1970.
    • IEEE Trans. Comput., Vol. C
    • Lempel, A.1
  • 3
    • 0018724284 scopus 로고    scopus 로고
    • Cryptology in transition,"
    • vol. 11, pp. 285-303, Dec. 1979.
    • _ Cryptology in transition," Comput. Sum., vol. 11, pp. 285-303, Dec. 1979.
    • Comput. Sum.
  • 5
    • 0000881136 scopus 로고    scopus 로고
    • A survey of full cycle algorithms,"
    • vol. 24, pp. 195-221, Apr. 1982.
    • H. Fredrickson A survey of full cycle algorithms," SIAM Rev., vol. 24, pp. 195-221, Apr. 1982.
    • SIAM Rev.
    • Fredrickson, H.1
  • 6
    • 0000941884 scopus 로고    scopus 로고
    • On the complexities of de Bruijn sequences,"
    • vol. 33, pp. 233-246, Nov. 1982.
    • A. H. Chan, R. A. Games, and E. L. Key On the complexities of de Bruijn sequences," J. Comb. Theory, Ser. A, vol. 33, pp. 233-246, Nov. 1982.
    • J. Comb. Theory, Ser. a
    • Chan, A.H.1    Games, R.A.2    Key, E.L.3
  • 7
    • 0343037463 scopus 로고    scopus 로고
    • The number of cross-join pairs in maximum length linear sequences,"
    • vol. 37, pp. 1731-1733, Nov. 1991.
    • T. Helleseth and T. K10ve The number of cross-join pairs in maximum length linear sequences," IEEE Trans. Inform. Theory, vol. 37, pp. 1731-1733, Nov. 1991.
    • IEEE Trans. Inform. Theory
    • Helleseth, T.1    Klove, T.2
  • 8
    • 0027662956 scopus 로고    scopus 로고
    • Cross-joins in de Bruijn sequences and maximum length linear sequences,"
    • 76A, pp. 1494-1501, Sept. 1993.
    • T. Chang, I. Song, H. M. Kim, and S. H. Cho Cross-joins in de Bruijn sequences and maximum length linear sequences," IEICE Trans. Fund., vol. E76A, pp. 1494-1501, Sept. 1993.
    • IEICE Trans. Fund., Vol. E
    • Chang, T.1    Song, I.2    Kim, H.M.3    Cho, S.H.4
  • 9
    • 0031075109 scopus 로고    scopus 로고
    • Generating de Bruijn sequences: An efficient implementation,"
    • vol. 46, pp. 198-200, Feb. 1997.
    • F. S. Annexstein Generating de Bruijn sequences: An efficient implementation," IEEE Trans. Comput., vol. 46, pp. 198-200, Feb. 1997.
    • IEEE Trans. Comput.
    • Annexstein, F.S.1
  • 10
    • 0030150819 scopus 로고    scopus 로고
    • Near optimal single-track Gray codes,"
    • vol. 42, pp. 779-789, May 1996.
    • T. Etzion and K. G. Paterson Near optimal single-track Gray codes," IEEE Trans. Inform. Theory, vol. 42, pp. 779-789, May 1996.
    • IEEE Trans. Inform. Theory
    • Etzion, T.1    Paterson, K.G.2
  • 11
    • 0030242658 scopus 로고    scopus 로고
    • A method for constructing decodable de Bruijn sequences,"
    • vol. 42, pp. 1472-1478, Sept. 1996.
    • C. J. Mitchell, T. Etzion, and K. G. Paterson A method for constructing decodable de Bruijn sequences," IEEE Trans. Inform. Theory, vol. 42, pp. 1472-1478, Sept. 1996.
    • IEEE Trans. Inform. Theory
    • Mitchell, C.J.1    Etzion, T.2    Paterson, K.G.3
  • 12
    • 0031190752 scopus 로고    scopus 로고
    • The depth distribution-A new characterization for linear codes,"
    • vol. 43, pp. 1361-1363, July 1997.
    • T. Etzion The depth distribution-A new characterization for linear codes," IEEE Trans. Inform. Theory, vol. 43, pp. 1361-1363, July 1997.
    • IEEE Trans. Inform. Theory
    • Etzion, T.1


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