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.
Mutually Uncorrelated (MU) codes are a class of codes in which no proper prefix of one codeword is a suffix of another codeword. These codes were originally studied for synchronization purposes and recently, Yazdi et al. showed their applicability to enable random access in DNA storage. In this work we follow the research of Yazdi et al. and study MU codes along with their extensions to correct errors...
We consider several related problems of estimating the ‘sparsity’ or number of nonzero elements d in a length n vector x by observing only b = M ⊙ x, where M is a predesigned test matrix independent of x, and the operation ⊙ varies between problems. We aim to provide a Δ-approximation of sparsity for some constant Δ with a minimal number of measurements (rows of M). This framework generalizes multiple...
The problem of constructing sticky-insertion-correcting codes with efficient encoding and decoding is considered. An {n, M, r) sticky-insertion-correcting code consists of M codewords of length n such that any pattern of up to r sticky insertions can be corrected. We utilize BCH codes and their analogous in the Lee space to construct explicit and systematic codes that are immune to up to r sticky...
We prove a new, improved upper bound on the size of codes C ⊆{1, 2, 3, 4}n with the property that every four distinct codewords in C have a coordinate where they all differ. Specifically, we show that such a code has size at most 26n/19 +o(n), or equivalently has rate bounded by 6/19 ≤ 0.3158 (measured in bits). This improves the previous best upper bound of 0.3512 due to (Arikan 1994), which in turn...
In this paper, we revisit the content identification problem with lossy recovery (Tuncel and Gündüz, 2014) and establish the exponential strong converse theorem for the problem. Further, we derive an upper bound on the joint excess-distortion and error exponent for the problem.
In this paper, alternative signal set designs for higher order constellations based on combinatorial structures are proposed. These system designs are practical for 5th and future generation of systems. Non-Orthogonal Multiple Access (NOMA) is currently recognized as a promising multi-access technique for fifth generation (5G) networks. NOMA techniques ensure that multiple users share the same spectrum...
We consider the multicast channel (MC), in which a transmitter broadcasts only a common message to two receivers. In our previous work, we have derived information-theoretic upper and lower bounds and showed that the two-round receiver cooperation (2RC) scheme, in which the receivers interactively perform compress-forward and then decode-forward, improves the MC achievable rate over different schemes...
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.
We consider a problem of localizing the destination of an activated path signal supported on a graph. An “activated path signal” is a graph signal that evolves over time that can be viewed as the trajectory of a moving agent. We show that by combining dynamic programming and graph partitioning, the computational complexity of destination localization can be significantly reduced. Then, we show that...
This paper studies the one-sided secrecy of a full-duplex two-way wiretap channel. It is motivated by a practical communication scenario, where two legitimate users communicate with each other in the presence of an external eavesdropper and only one of the users wishes to keep its message confidential from the external eavesdropper for the sake of privacy. As a general result, we establish an achievable...
In this work, we consider a variant of the set reconciliation problem where the estimate for the size of the symmetric difference may be inaccurate. Given this setup, we propose a new method to reconciling sets of data and we then compare our method to the Invertible Bloom Filter approach proposed by Eppstein et al. [2].
In this paper, a new cooperative spectrum sharing protocol that employs space-time block coded spatial modulation (STBC-SM) at the secondary user (SU), is proposed for overlay cognitive radio (CR) networks. STBC-SM is applied at the secondary transmitter (ST) which transmits its data by both modulated symbols and antenna combinations while conveying PU's data only by modulated symbols. This protocol...
The problems of subspace coding of large cardinality are considered. The main most interesting results which were published to this time are presented. A few directions of the development of this scientific area are mentioned. One of the direction was stated by Koetter, Kschischang and Silva and simultaneously was continued by Gabidulin and Bossert. It is based on so called lifting constructions of...
In this paper, we investigate the problem of secure broadcasting over block-fading channels with limited channel knowledge at the transmitter. More particularly, we analyze the effect of having imperfect channel state information (CSI) via a finite rate feedback on the throughput of a broadcast channel where the transmission is intended for multiple legitimate receivers in the presence of an eavesdropper...
In this paper, we characterize the asymmetric total degrees of freedom (DoF) of a multiple-input multiple-output (MIMO) 3-way channel. Each node has a separate-antenna full-duplex MIMO transceiver with a different number of antennas, where each antenna can be configured for either signal transmission or reception. Each node has two unicast messages to be delivered to the two other nodes. We first...
File synchronization is a critical component of many modern data sharing applications. File synchronization is particularly challenging when different versions of a file that need to be synchronized differ in some number of edits. Several recent works have studied exact synchronization under edit errors. In this paper, we extend the available analytical toolbox of file synchronization by focusing...
In this paper, amended truncated union bounds on the bit error probability of systematic linear codes over additive white Gaussian noise (AWGN) channels are proposed. The proposed bounds are based on Gallager's first bounding technique (GFBT), where the “good” region is defined by a suboptimal list decoding algorithm. The proposed bounds require only the knowledge of partial input output weight enumerating...
There has been a rejuvenated interest in the use of arbitrary constellations (non-equally spaced) after promising performance results were demonstrated compared to conventional grid and circular constellations. To enable the development of such constellations, in this contribution we derive an upper bound bit-error-rate (BER) expressions for coded transmit maximum ratio combining (TMRC) systems operating...
A wireless network architecture is studied in which edge nodes (ENs), such as base stations, are connected to a cloud processor by dedicated fronthaul links, while also being endowed with caches, in which popular content, such as multimedia files, can be proactively stored. Cloud processing enables the centralized implementation of cooperative transmission by the ENs, albeit at the cost of an increased...
Distributed storage systems need to guarantee reliable access to stored data. Resilience to node failures can be increased by using erasure encoding. A variety of erasure codes are discussed in literature and implemented in practice. This multiplicity of codes puts a heavy burden on existing systems. In scenarios such as multi-cloud file delivery or migration of data to a new erasure code, the ability...
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.