نتایج جستجو برای: random key pre
تعداد نتایج: 1106434 فیلتر نتایج به سال:
In recent years searchable symmetric encryption has seen a rapid increase in query expressiveness including keyword, phrase, Boolean, and fuzzy queries. With this expressiveness came increasingly complex constructions. Having these facts in mind, we present an efficient and generic searchable symmetric encryption construction for phrase queries. Our construction is straightforward to implement,...
Direct-sequence spread spectrum (DSSS) has been recognized as an effective jamming resilient technique. However, the effectiveness of DSSS relies on the use of either pre-shared unique secret keys or a bank of public codes, which can be prohibitively expensive in future large-scale decentralized wireless networks, e.g., the Internet of Things. To tackle this problem, in this work we develop a n...
The bit error rate (BER) performance of an M branch maximal-ratio combiner (MRC) for the detection of signals in a correlated Nakagami-fading channel is analyzed. Coherent and incoherent detection of frequency shift-keying (FSK) and phase-shift keying (PSK) signals are considered. It is assumed that the fading parameters in each diversity branch are identical. The effect of correlation is studi...
Key distribution is an important problem in wireless sensor networks where sensor nodes are randomly scattered in adversarial environments. Due to the random deployment of sensors, a list of keys must be pre-distributed to each sensor node before deployment. To establish a secure communication, two nodes must share common key from their key-rings. Otherwise, they can find a keypath in which ens...
A phase-shift keying (PSK) demodulator is demonstrated for the target application of low power and high data rate inductive links. The demodulator based on the single-bit sampling demodulation scheme is capable of operating in binary, quadrature, 8-, and 16-PSK mode. The prototype chip realized in 0.18mm CMOS process can demodulate up to 1.25 MSymbol/s at 5-MHz carrier frequency. It occupies 24...
Aktract-Construction of efficient block-encoded M-ary phase shift keying (M-PSK) schemes is investigated in this paper. An algebraic approach is adopted in which the basic modulation signals are associated with the elements of a finite group. Using some of the properties of group partition chains, the algebraic properties of linear codes are investigated. From this analysis, a class of codes ca...
We analyze the performance of direct-sequence spread spectrum multiple access (DS/SSMA) systems, which use trellis coding with asymmetric phase shift keying (PSK) modulation. By designing the signal constellation to be asymmetric, we obtain a performance gain for the DS/SSMA system over the systems using the traditional symmetric signal constellation. Bit error probability analysis of the propo...
The availability of multiple transmit antennas allows for two-dimensional channel codes that exploit the spatial transmit diversity. These codes were referred to as space–time codes by Tarokh et al. Most prior works on space–time code design have considered quasi-static fading channels. In this paper, we extend our earlier work on algebraic space–time coding to block-fading channels. First, we ...
In this correspondence, in extension of Piret’s bound for codes over phase-shift keying (PSK) signal sets, we investigate the application of the Gilbert–Varshamov (GV) bound to a variety of distance-uniform (DU) signal sets in Euclidean space. It is shown that four-dimensional signal sets matched to binary tetrahedral, binary octahedral, and binary icosahedral groups lead to better bounds compa...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید