Serwis Infona wykorzystuje pliki cookies (ciasteczka). Są to wartości tekstowe, zapamiętywane przez przeglądarkę na urządzeniu użytkownika. Nasz serwis ma dostęp do tych wartości oraz wykorzystuje je do zapamiętania danych dotyczących użytkownika, takich jak np. ustawienia (typu widok ekranu, wybór języka interfejsu), zapamiętanie zalogowania. Korzystanie z serwisu Infona oznacza zgodę na zapis informacji i ich wykorzystanie dla celów korzytania z serwisu. Więcej informacji można znaleźć w Polityce prywatności oraz Regulaminie serwisu. Zamknięcie tego okienka potwierdza zapoznanie się z informacją o plikach cookies, akceptację polityki prywatności i regulaminu oraz sposobu wykorzystywania plików cookies w serwisie. Możesz zmienić ustawienia obsługi cookies w swojej przeglądarce.
Crowd workers are often unreliable and anonymous. Hence there is a need to ensure reliable work delivery while preserving some level of privacy to the requester's data. For this purpose, we use a combination of random perturbation to mask the sensitive data and error-correcting codes for quality assurance. We also consider the possibility of collusion attacks by malicious crowd workers. We develop...
This paper presents a novel method for protecting privacy sensitive regions inside a digital frame. The purpose is achieved by deteriorating the visual quality of privacy sensitive region by adding probability model based random noise to nonzero quantized transform coefficients of the region. The probabilistic model based noise is generated based on the information from neighboring macroblocks and...
Alice wishes to potentially communicate covertly with Bob over a Binary Symmetric Channel while Willie the wiretapper listens in over a channel that is noisier than Bob's. We show that Alice can send her messages reliably to Bob while ensuring that even whether or not she is actively communicating is (a) deniable to Willie, and (b) optionally, her message is also hidable from Willie. We consider two...
We provide a theoretical analysis of the performance of differential predictive coding using fixed-lag smoothing of the standard decoder output. This performance is compared to related results for coding using latency at the encoder, and causal encoding with delayed decoding, as well as with some prior theoretical analyses of these methods. Surprisingly, it is shown that fixed-lag smoothing of the...
We discuss the protection of Gaussian biometric templates. We first introduce the Juels-Wattenberg for binary biometrics, where the binary biometrics are a result of hard-quantized Gaussian biometrics. The Juels-Wattenberg scheme adds a random binary code word to the biometric for privacy reasons and to allow errors in the biometric at authentication. We modify the Juels- Wattenberg scheme in such...
The error probability performance of convolutional codes are mostly evaluated by computer simulations, and few studies have been made for exact error probability of convolutional codes. In [1], the moments of decision variable are derived by a recurrence relation for maximum a-posteriori probability (MAP) decoding of 4-state convolutional code. However, due to the convergence problem of moment techniques,...
In this paper, we investigate the effects of an additional relay node on the secrecy of broadcast channels by considering the model of relay broadcast channels with confidential messages (RBC-CM). More specifically, first, we investigate the discrete memoryless relay broadcast channels with two confidential messages and one common message. Three inner bounds (with respect to decode-forward, generalized...
This paper proposes a symbol-level combining (SLC) scheme for hybrid automatic-repeat-request (HARQ), being used with an interference-aware successive decoding (IASD) algorithm [1]. Recently, it is revealed that the capacity in an interference channel over point-to-point codes can be achieved by combining two schemes: one is jointly decoding an interfering signal with a serving signal and the other...
Most existing research studies in cooperative communication are based on a half-duplex assumption. Motivated by recent successes in hardware implementation of wireless full-duplex transmission, we propose a full-duplex cooperative communication (FDCC) approach to maximize the achievable transmission rate between a source and a destination with the help of a relay node. Under the consideration of hardware...
In the setting of the time-selective two-user multiple-input single-output (MISO) broadcast channel (BC), recent work by Tandon et al. considered the case where — in the presence of error-free delayed channel state information at the transmitter (delayed CSIT) — the current CSIT for the channel of user 1 and of user 2, alternate between the two extreme states of perfect current CSIT and of no current...
We propose a factor-graph-based approach to joint channel, impulse, symbol and bit estimation (JCISB) of LDPC-coded orthogonal frequency division multiplexing (OFDM) systems in impulsive noise environments. Impulsive noise arises in many modern wireless and wireline communication systems, such as cellular LTE and powerline communications, due to uncoordinated interference that is much stronger than...
In this paper we study the robustness of a command decoding approach based on tiny decoding graphs for voice-based robotic interaction. This approach comprises the fusion of the grammar rules and the statistical n-gram language models to produce an elegant and quite efficient tiny decoding graph. The resulting tiny graph has several advantages such as high speed and improved robustness of command...
Group-testing refers to the problem of identifying (with high probability) a (small) subset of D defectives from a (large) set of N items via a “small” number of “pooled” tests (i.e., tests have a positive outcome if even one of the items being tested in the pool is defective, else they have a negative outcome). For ease of presentation in this work we focus the regime when the number of defectives...
The modulo lattice channel is a key ingredient in the study of lattice encoding and decoding for the AWGN channel. In this paper, the capacity of the modulo lattice channels is investigated.
This paper analyzes the rate-reliability trade-off for non-ergodic fading channels with state information available at the receiver, specifically the second-order coding rate with a fixed length corresponding to one channel coherence time and a target average error probability. Achievability is developed using random coding and modified typicality decoding, and the converse is developed using generalized...
This paper generalizes the compute-and-forward framework to allow for unequal (or asymmetric) power allocation across transmitters. Each transmitter's codebook is formed using a fine lattice that is chosen to ensure decodability as well as a coarse lattice that is chosen to enforce the power constraint. The employed lattices are drawn from a nested lattice chain, which makes it possible for the receivers...
We consider the problem of the two-user multiple-input single-output complex Gaussian Broadcast Channel where the transmitter has access to delayed knowledge of the channel state information. We characterize the capacity region of this channel to within a constant number of bits for all values of the transmit power. The proposed signaling strategy utilizes the delayed knowledge of the channel state...
This paper extends the recent analysis of optimal zero-delay jamming problem, specialized to scalar sources over scalar additive noise channels, to vector spaces. Particularly, we find the saddle point solution to the jamming problem in “vector spaces”, within its most general, non-Gaussian setting; the problem has been open even for the important special case of Gaussian source and channel. Similar...
We propose the use of a divided spectrum balanced detection (DSBD) to reduce the intensity noise in spectral amplitude coding (SAC) OCDMA systems. Simulation results show several order of magnitude improvements in bit error rate (BER) compared to the conventional balanced detection.
Bidirectional wireless communication between two multi-antenna terminals that operate in a full-duplex mode is considered. The effects of loopback self-interference and transmit-side noise due to radio front-end imperfections are analyzed in the asymptotic regime where the number of antennas at both terminals grows large. The study compares two transparent mitigation schemes by which conventional...
Podaj zakres dat dla filtrowania wyświetlonych wyników. Możesz podać datę początkową, końcową lub obie daty. Daty możesz wpisać ręcznie lub wybrać za pomocą kalendarza.