Construction of de Bruijn sequences from product of two irreducible polynomials-Reference-Cited by-同舟云学术

Construction of de Bruijn sequences from product of two irreducible polynomials

Published:2017-03-08 Issue:2 Volume:10 Page:251-275
ISSN:1936-2447
Container-title:Cryptography and Communications
language:en
Short-container-title:Cryptogr. Commun.

Author:

Chang Zuling,Ezerman Martianus Frederic^ORCID,Ling San,Wang Huaxiong

Funder

National Natural Science Foundation of China

Publisher

Springer Science and Business Media LLC

Subject

Applied Mathematics,Computational Theory and Mathematics,Computer Networks and Communications

Link

http://link.springer.com/article/10.1007/s12095-017-0219-8/fulltext.html

Reference26 articles.

1. van Aardenne-Ehrenfest, T., de Bruijn, N.G.: Circuits and trees in oriented linear graphs. Simon Stevin 28, 203–217 (1951)

2. de Bruijn, N.G.: A combinatorial problem. Koninklijke Nederlandse Akademie v. Wetenschappen 49, 758–764 (1946)

3. Chan, A.H., Games, R.A., Key, E.L.: On the complexities of de Bruijn sequences. J. Combinat. Theory, Ser. A 33(3), 233–246 (1982)

4. Chang, Z., Chrisnata, J., Ezerman, M.F., Kiah, H.M.: Rates of DNA sequence profiles for practical values of read lengths. CoRR abs/1607.02279 (2016). arXiv: 1607.02279

5. Ding, C.: Codes from Difference Sets. World Scientific, Singapore (2014)

Cited by 7 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Constructions of full cycles;Sequences and the de Bruijn Graph;2024

2. Analysis and Efficient Implementations of a Class of Composited de Bruijn Sequences;IEEE Transactions on Computers;2020-12-01

3. Cycle Structures of a Class of Cascaded FSRs;IEEE Transactions on Information Theory;2020-06

4. Longest subsequences shared by two de Bruijn sequences;Designs, Codes and Cryptography;2020-04-22

5. A New Upper Bound on the Order of Affine Sub-families of NFSRs;Journal of Systems Science and Complexity;2019-12-26