Properties of Even-Length Barker Codes and Specific Polyphase Codes with Barker Type Autocorrelation Functions

Author(s):  
Shimshon Gabbay
Author(s):  
V. A. Nenashev ◽  
A. M. Sergeev ◽  
E. A. Kapranova

Introduction: Barker codes representing binary sequences (codes) of finite lengths 2, 3, 4, 5, 7, 11 and 13 are widely used in solving the problem of increasing the noise immunity of radar channels. However, the code sequences for n > 13 are unknown. Sequences derived from quasi-orthogonal Mersenne matrices also have not been used for these purposes.Purpose: Studying the ways to compress a complex modulated signal by Mersenne sequences obtained from the first rows of a monocyclic quasi-orthogonal Mersenne matrix, as an alternative to Barker codes.Results:It has been found out that the characteristics of autocorrelation functions for Mersenne codes 3, 7 and 11 exceed those for Barker codes. This is a basis for ensuring greater noise immunity of probing signals in radar channels, as well as for increasing the probability of their correct detection, proving the expediency of their application for amplitude and phase modulation of radio signals.Practical relevance:The obtained results allow you to increase the compression characteristics in radar systems when solving the problem of detecting targets under noise and interference. The wide application of Barker codes of length 3, 7 and 11 in digital data transmission systems provides a special interest in similar Mersenne codes when implementing noise-resistant data transmission in radio channels in a complex electromagnetic environment. Discussion: An unresolved problem is the non-symmetry of elements in a coding Mersenne sequence. This problem can be solved either by special synthesis of a phase-modulated signal or by finding new approaches to their compression.


Author(s):  
M. B. Sergeev ◽  
V. A. Nenashev ◽  
A. M. Sergeev

Introduction: The problem of noise-free encoding for an open radio channel is of great importance for data transfer. The results presented in this paper are aimed at stimulating scientific interest in new codes and bases derived from quasi-orthogonal matrices, as a basis for the revision of signal processing algorithms.Purpose: Search for new code sequences as combinations of codes formed from the rows of Mersenne and Raghavarao quasi-orthogonal matrices, as well as complex and more efficient Barker — Mersenne — Raghavarao codes.Results: We studied nested code sequences derived from the rows of quasi-orthogonal cyclic matrices of Mersenne, Raghavarao and Hadamard, providing estimates for the characteristics of the autocorrelation function of nested Barker, Mersenne and Raghavarao codes, and their combinations: in particular, the ratio between the main peak and the maximum positive and negative “side lobes”. We have synthesized new codes, including nested ones, formed on the basis of quasi-orthogonal matrices with better characteristics than the known Barker codes and their nested constructions. The results are significant, as this research influences the establishment and development of methods for isolation, detection and processing of useful information. The results of the work have a long aftermath because new original code synthesis methods need to be studied, modified, generalized and expanded for new application fields.Practical relevance: The practical application of the obtained results guarantees an increase in accuracy of location systems, and detection of a useful signal in noisy background. In particular, these results can be used in radar systems with high distance resolution, when detecting physical objects, including hidden ones.


2020 ◽  
Vol 15 (1) ◽  
pp. 258-265
Author(s):  
Yu Zhou ◽  
Daoguang Mu ◽  
Xinfeng Dong

AbstractS-box is the basic component of symmetric cryptographic algorithms, and its cryptographic properties play a key role in security of the algorithms. In this paper we give the distributions of Walsh spectrum and the distributions of autocorrelation functions for (n + 1)-bit S-boxes in [12]. We obtain the nonlinearity of (n + 1)-bit S-boxes, and one necessary and sufficient conditions of (n + 1)-bit S-boxes satisfying m-order resilient. Meanwhile, we also give one characterization of (n + 1)-bit S-boxes satisfying t-order propagation criterion. Finally, we give one relationship of the sum-of-squares indicators between an n-bit S-box S0 and the (n + 1)-bit S-box S (which is constructed by S0).


1969 ◽  
Vol 10 (6) ◽  
pp. 964-974 ◽  
Author(s):  
P. Résibois ◽  
J. Brocas ◽  
G. Decan

1968 ◽  
Vol 11 (4) ◽  
pp. 246-249
Author(s):  
Dwight F. Mix

Sign in / Sign up

Export Citation Format

Share Document