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.
Surveillance visual systems play an important role in modern life, especially in the Internet of Things (IoTs) era. However, the limitation of bandwidth, energy resources and the heterogeneity of devices, networks and environments have been asking for a more powerful video coding solution, which provides not only the high compression efficiency but also the flexible scalability capability. In this...
In this work, we give the first construction of high-rate locally list-recoverable codes. List-recovery has been an extremely useful building block in coding theory, and our motivation is to use these codes as such a building block. In particular, our construction gives the first capacity-achieving locally list-decodable codes (over constant-sized alphabet); the first capacity achieving} globally...
With the significant increase of the network heterogeneity and the wide use of emerging video applications such as wireless sensor networks, video surveillance systems or remote sensing, the Distributed Scalable Video Coding (DSVC) is a potential solution for efficiently transmitting and storing video data due to its high compression efficiency and low encoding complexity capabilities. In DSVC framework,...
Energy accumulation is an approach to reducing the power consumption of broadcast. In conventional approaches, a node can decode the message if the received power from a single transmission is above a threshold. In contrast, in the cooperative approach based on energy accumulation, a node can decode the message if the sum of the received powers from any set of transmissions exceeds the threshold....
In this paper, a full-duplex (FD) amplify-and-forward (AF) transmitter cooperative communication scheme is proposed for multiple access channel (MAC). In particular, two FD transmitters simultaneously transmit information to a common receiver and help each other's transmissions with the AF relaying scheme. By considering the accumulation of the residual self-interference and additive noise (RIAN)...
We consider insertion and deletion channels with the additional assumption that the channel input sequence is implicitly divided into segments such that at most one edit can occur within a segment. We further assume that there are no segment markers in the received sequence. We propose code constructions for the segmented deletion, segmented insertion, and segmented insertion-deletion channels based...
In this work, we establish the pointwise optimality of side information version of SWLZ algorithm for stationary ergodic sources. We also obtain a pointwise upper bound on the redundancy rate of this side information version of SWLZ algorithm for a subclass of φ-mixing sources, which includes Markov sources as a special case. This upper bound obtained differs only by a constant factor from the best...
The Boolean multireference alignment problem consists in recovering a Boolean signal from multiple shifted and noisy observations. In this paper we obtain an expression for the error exponent of the maximum A posteriori decoder. This expression is used to characterize the number of measurements needed for signal recovery in the low SNR regime, in terms of higher order autocorrelations of the signal...
The security of code-based cryptography relies primarily on the hardness of generic decoding with linear codes. The best generic decoding algorithms are all improvements of an old algorithm due to Prange: they are known under the name of information set decoding techniques (ISD). A while ago a generic decoding algorithm which does not belong to this family was proposed: statistical decoding. It is...
We present an encoding and decoding scheme for constant weight sequences, that is, given an information sequence, the construction results in a sequence of specific weight within a certain range. The scheme uses a prefix design that is based on Gray codes. Furthermore, by adding redundant symbols we extend the range of weight values for output sequences, which is useful for some applications.
In this work, we study the arbitrarily varying degraded broadcast channel (AVDBC), when state information is available at the transmitter in a causal manner. We establish inner and outer bounds on both the random code capacity region and the deterministic code capacity region. The capacity region is then determined for a class of channels satisfying a condition on the mutual informations between the...
Neuromorphic engineering aims at building cognitive systems made of electronic neuron and synapse circuits. These emerging computing architectures have a high potential for real-world problems that are difficult to formalize and program, such as vision or sensorimotor control. In order to leverage the potential of neuromorphic engineering and study cognition principles in physical systems, the development...
In this paper, a distributed video coding (DVC) system with spatiotemporal side information is proposed. The proposed framework addresses the problem of poor compression performance of DVC for high-motion video sequences by integrating temporal and spatial prediction schemes in one framework. Super-resolution techniques are employed for spatially-predicted side information generation, and a support...
Recently, rateless codes make a remarkable progress on achieving maximum network performance without incurring CSI feedback overhead, under dynamic contexts with time-varying channels. However, existing rateless codes are only optimal for single-carrier channels, but are far from optimal for multi-subcarrier OFDM channels that are dominantly adopted in modern high-speed wireless networks. In this...
This work studies the performance of a cooperative network which consists of two channel-coded sources, multiple relays, and one destination. Due to the spectral efficiency constraint, we assume that a single time slot is dedicated to relaying. Conventional network-coded based cooperation (NCC) selects the best relay which uses network coding to serve the two sources simultaneously. It is shown that...
In traditional (k, n) threshold secret image sharing (SIS), a secret image is encrypted into n shadow images (also called shares) distributed to n associated participants. The secret image can be recovered by collecting any k or more shadow images, i.e., SIS is loss-tolerant. In SIS research domain, visual cryptography scheme (VCS) also called visual secret sharing (VSS) and Shamir's polynomial-based...
We provide a novel upper bound on the rate-distortion function with multiple decoders with side information, which takes the form of a linear program. This complements a recently-obtained lower bound that also takes the form of a linear program. We show that the upper bound is optimal in several instances of the problem1.
The Asymmetric Numeral Systems (ANS) are a family of entropy coders for information sources with a finite alphabet, developed by J. Duda as an alternative to arithmetic coding. We have already proposed an approximation formula to the stationary distribution of the states in a special version (ABS) of ANS. We show that our previous result in ABS, which deals only with binary sources, can be applied...
A ring signature scheme allows a signer from a group convince the verifier that the signature is generated by a member belonging to the group but the identity of the signer is not disclosed. It is a useful tool for some scenarios where anonymity is needed to be protected. In this paper, we design a ring signature scheme based on hard problems and assumptions in coding theory. The sign and verify processes...
Orthogonal frequency division multiplexing (OFDM) is the most promising approach to combat the frequency selective fading nature of wide-band wireless channels. On the other hand, complex field network coding (CFNC) scheme offers the advantages of better spectral efficiency and full diversity when utilized in multiuser cooperative communication systems. The efficiency of CFNC scheme in relay based...
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.