[КНИГА][B] Concise encyclopedia of coding theory

WC Huffman, JL Kim, P Solé - 2021 - api.taylorfrancis.com
Most coding theory experts date the origin of the subject with the 1948 publication of A
Mathematical Theory of Communication by Claude Shannon. Since then, coding theory has …

Timing and synchronisation for high‐loss free‐space quantum communication with Hybrid de Bruijn Codes

P Zhang, DKL Oi, D Lowndes… - IET Quantum …, 2021 - Wiley Online Library
Satellite‐based, long‐distance free‐space quantum key distribution has the potential to
realise global quantum secure communication networks. Detecting faint quantum optical …

On greedy algorithms for binary de Bruijn sequences

Z Chang, MF Ezerman, AA Fahreza - Applicable Algebra in Engineering …, 2022 - Springer
We propose a general greedy algorithm for binary de Bruijn sequences, called Generalized
Prefer-Opposite Algorithm, and its modifications. By identifying specific feedback functions …

Cycle structures of a class of cascaded FSRs

Z Chang, G Gong, Q Wang - IEEE Transactions on Information …, 2019 - ieeexplore.ieee.org
In this paper, we study a class of binary nonlinear feedback shift register sequences
generated by cascaded feedback registers, one is an LFSR and the other one generates a …

Generalized cycle joining method and its application to the construction of long-period Galois NFSRs

Y Pan, J Zhong, D Lin - Designs, Codes and Cryptography, 2024 - Springer
Nonlinear feedback shift registers (NFSRs) are used in many recent stream ciphers as their
main building blocks. One security criterion for the design of a stream cipher is to assure its …

Distribution of linear and second-highest degree parts of maximum-length feedback functions

Y Jiang, Y Zhu - Cryptography and Communications, 2025 - Springer
De Bruijn sequences are maximum-length sequences generated by feedback shift registers.
The study of their feedback functions is very important and has attracted a lot of attention …

[HTML][HTML] Constructions of de Bruijn sequences from a full-length shift register and an irreducible LFSR

LL Zhou, T Tian, WF Qi, ZX Wang - Finite Fields and Their Applications, 2019 - Elsevier
In this paper, we study the construction of de Bruijn sequences. A method is given to stretch
a de Bruijn sequence of order n to a de Bruijn sequence of order n+ k with the help of a k …

Efficient construction of cross-join pairs in a product of primitive polynomials of pairwise-coprime degrees

M Li, D Lin - IEEE Transactions on Information Theory, 2021 - ieeexplore.ieee.org
We study the cross-join pairs in the cycles of linear feedback shift registers whose
characteristic polynomials are of the form, where are primitive polynomials of coprime …

[HTML][HTML] A New Approach to Determine the Minimal Polynomials of Binary Modified de Bruijn Sequences

Musthofa, IE Wijayanti, DJE Palupi, MF Ezerman - Mathematics, 2022 - mdpi.com
A binary modified de Bruijn sequence is an infinite and periodic binary sequence derived by
removing a zero from the longest run of zeros in a binary de Bruijn sequence. The minimal …

[HTML][HTML] The minimal polynomials of modified de Bruijn sequences revisited

HY Wang, QX Zheng, ZX Wang, WF Qi - Finite Fields and Their …, 2020 - Elsevier
Let q be a prime power and F q the finite field with q elements. In this paper, it is shown that
the minimal polynomial of a modified de Bruijn sequence of order n over F q cannot be the …