The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
We study the secrecy of a distributed-storage system for passwords. The encoder, Alice, observes a length-n password and describes it using δ s-bit hints, which she stores in different locations. The legitimate receiver, Bob, observes ν of those hints. In one scenario we require that the expected number of guesses it takes Bob to guess the password approach 1 as n tends to infinity, and in the other...
The setup of a general channel is considered in the mismatched case, i.e., when the decoder uses a general decoding metric. An expression for the average error probability in list decoding with block length n, metric qn, list size enΘn and rate R, denoted ε(n)qn(R, Θn), is established. Further, a general multi-letter formula for the mismatched capacity with list decoding is derived. It is shown that...
This paper addresses a coordination problem between two agents (Agents 1 and 2) in the presence of a noisy communication channel which depends on an external system state {x0,t}. The channel takes as inputs both agents' actions, {x1,t} and {x2,t} and produces outputs that are observed strictly causally at Agent 2 but not at Agent 1. The system state is available either causally or non-causally at...
Two setups involving delay-constrained sequential transmission of a vector Gauss-Markov source over a burst-erasure channel are studied. The encoder sequentially compresses the source vectors to be transmitted in a causal fashion. The channel introduces a single erasure burst of length up to B during the transmission. In streaming with controlled-interruption, the decoder reconstructs the source vectors...
This paper studies the first- and second-order maximum achievable rates of codes with/without cost constraints for general mixed channels whose channel law is characterized by a mixture of uncountably many stationary and memoryless discrete channels. These channels are referred to as general mixed memoryless channels and include mixed memoryless channels of finitely or countably many memoryless channels...
This paper studies the fixed-error asymptotics of constant-composition codes for discrete memoryless channels. An achievable asymptotic expansion is derived with a third-order term that can be as high as 1/2 log n, while being lower when (i) a certain feasibility-decoding condition fails, or (ii) the channel is a sum channel. Converse bounds are used to provide conditions under which each of these...
In a joint source-channel coding scheme, a single mapping is used to perform both the tasks of data compression and channel coding in a combined way, rather than performing them separately. Usually for simple iid sources and channels, separation of the tasks is information theoretically optimal. In an adversarial joint source-channel coding scenario, instead of a stochastic channel, an adversary introduces...
In cooperative communication, network nodes that would otherwise act independently instead coordinate their efforts with the aim of improving communication performance. To better understand cooperation, we consider communication over a multiple access channel using a “cooperation facilitator”, a node that receives rate-limited message descriptions from the transmitters and sends rate-limited message...
This paper investigates the asymptotic expansion for the size of block codes defined for the additive white Gaussian noise (AWGN) channel with feedback under the following setting: A peak power constraint is imposed on every transmitted codeword (i.e., maximum per-codeword power constraint), and the average error probability of decoding the transmitted message is non-vanishing as the blocklength increases...
Forward error correction techniques are commonly used for delay-sensitive video streaming applications. Streaming of compressed videos can usually withstand a certain level of packet loss, depending on the compression methods and error concealment techniques. In this paper, a QoS-driven optimization algorithm is proposed for the streaming of scalable videos using layer-aligned multipriority rateless...
Low density parity check (LDPC) codes with iterative soft decoding have been adopted as the primary error correction coding technology in data storage devices, e.g., hard disk drives (HDDs) and solid state drives (SSDs). Data storage normally has stringent requirements for low probability of decoding failure since there is no re-transmission mechanism as available for most other data communication...
Entropy coding is an integral part of most data compression systems. Huffman coding (HC) and arithmetic coding (AC) are two of the most widely used coding methods. HC can process a large symbol alphabet at each step allowing for fast encoding and decoding. However, HC typically provides suboptimal data rates due to its inherent approximation of symbol probabilities to powers of 1 over 2. In contrast,...
In recent years the information industry develops vigorously and the progress in technology results in thriving augmentation of internet and people pass messages mutually through network in large number and triggers the issue of information security. In order to protect the safety and reliability of message passing, the development of steganography is thereby generated. In this research we will aim...
This paper analyzes the block error rate (BLER) performance provided by a virtual MIMO scheme which implements a modified Alamouti Space-Frequency Block Code (SFBC) encoding-decoding algorithm using two fixed Decode &Forward relays that perform selective relaying, and single-antenna devices. It also analyzes the performance of the classical relay-based distributed Alamouti scheme with single-antenna...
Distributed video coding (DVC) is a recent paradigm of video coding, based on distributed source coding and side information (SI) generated at the Decoder. Most of the DVC schemes are using complex channel codes such as LDPC or Turbo codes, which are increasing the decoder complexity and delay. Many searches have been done to simplfy the coding schemes, one of them was done by replacing the channel...
In this paper, a robust and novel approach for optimal bit allocation between source and channel coding is proposed. The proposed approach consists of a wavelet-based scalable video coding framework and a forward error correction method based on the serial concatenation of LDPC codes and turbo codes. Turbo codes shows good performance at low signal to noise ratios but LDPC outperforms turbo codes...
We present a multimode spectral coding algorithm which employs the enhanced MBE (EMBE) spectral model and a new spectral quantization technique called transformed variable dimension vector quantization (TVDVQ) offering good speech quality at low rate. The EMBE model represents the short-term speech spectrum in a mode-specific way. TVDVQ encodes the variable-dimension spectral components efficiently...
Current compression systems incorporate a data model, however formed, deeply into the coding process, leading to difficulties of an architectural nature. This work contributes an alternative "Model-Code Separation" architecture for general compression, based on model-free coding and iterative message-passing algorithms over graphical models representing the modeling and coding aspects of...
With the widespread popularity of mobile terminals, mobile video has become an indispensable part of daily life. The conventional wireless video transmission scheme which consists of separate digital source coding and digital channel coding is now unable to meet the broadcast and mobile scenarios owing to the dramatic changes in its channel condition. However, an uncoded transmission scheme called...
Millimeter wave communication is a main solution for the high speed backhaul and ultra-high speed access transmission. This paper presented the interface-aware LDPC codes in the millimeter-wave system to support highspeed Ethernet interfaces and reduce the conversion delay. Considering constraints of the encoded codeword length of 1 G to 100 G Ethernet physical layer, LDPC (196, 120), LDPC (588, 528),...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.