当前期刊: IEEE Transactions on Information Theory Go to current issue    加入关注   
显示样式:        排序: IF: - GO 导出
我的关注
我的收藏
您暂时未登录!
登录
  • On the Robustness of Information-Theoretic Privacy Measures and Mechanisms
    IEEE Trans. Inform. Theory (IF 3.215) Pub Date : 2019-09-05
    Mario Diaz; Hao Wang; Flavio P. Calmon; Lalitha Sankar

    Consider a data publishing setting for a dataset composed by both private and non-private features. The publisher uses an empirical distribution, estimated from $n$ i.i.d. samples, to design a privacy mechanism which is applied to new fresh samples afterward. In this paper, we study the discrepancy between the privacy-utility guarantees for the empirical distribution, used to design the privacy mechanism

    更新日期:2020-03-20
  • Covert Capacity of Non-Coherent Rayleigh-Fading Channels
    IEEE Trans. Inform. Theory (IF 3.215) Pub Date : 2019-11-28
    Mehrdad Tahmasbi; Anne Savard; Matthieu R. Bloch

    The covert capacity is characterized for a non-coherent fast Rayleigh-fading wireless channel, in which a legitimate user wishes to communicate reliably with a legitimate receiver while escaping detection from a warden. It is shown that the covert capacity is achieved with an amplitude-constrained input distribution that consists of a finite number of mass points including one at zero and numerically

    更新日期:2020-03-20
  • The Capacity Achieving Distribution for the Amplitude Constrained Additive Gaussian Channel: An Upper Bound on the Number of Mass Points
    IEEE Trans. Inform. Theory (IF 3.215) Pub Date : 2019-10-21
    Alex Dytso; Semih Yagli; H. Vincent Poor; Shlomo Shamai Shitz

    This paper studies an $n$ -dimensional additive Gaussian noise channel with a peak-power-constrained input. It is well known that, in this case, when $n=1$ the capacity-achieving input distribution is discrete with finitely many mass points, and when $n>1$ the capacity-achieving input distribution is supported on finitely many concentric shells. However, due to the previous proof technique, not even

    更新日期:2020-03-20
  • The Capacity of Private Information Retrieval With Private Side Information Under Storage Constraints
    IEEE Trans. Inform. Theory (IF 3.215) Pub Date : 2019-11-18
    Yi-Peng Wei; Sennur Ulukus

    We consider the problem of private information retrieval (PIR) of a single message out of $K$ messages from $N$ replicated and non-colluding databases where a cache-enabled user (retriever) of cache-size $S$ possesses side information in the form of uncoded portions of the messages where the message identities are unknown to the databases. The identities of these side information messages need to be

    更新日期:2020-03-20
  • Private Information Retrieval With Side Information
    IEEE Trans. Inform. Theory (IF 3.215) Pub Date : 2019-10-24
    Swanand Kadhe; Brenden Garcia; Anoosheh Heidarzadeh; Salim El Rouayheb; Alex Sprintson

    We study the problem of Private Information Retrieval (PIR) in the presence of prior side information. The problem setup includes a database of $K$ independent messages possibly replicated on several servers, and a user that needs to retrieve one of these messages. In addition, the user has some prior side information in the form of a subset of $M$ messages, not containing the desired message and unknown

    更新日期:2020-03-20
  • Distributed Hypothesis Testing Over Discrete Memoryless Channels
    IEEE Trans. Inform. Theory (IF 3.215) Pub Date : 2019-11-15
    Sreejith Sreekumar; Deniz Gündüz

    A distributed binary hypothesis testing (HT) problem involving two parties, one referred to as the observer and the other as the detector is studied. The observer observes a discrete memoryless source (DMS) and communicates its observations to the detector over a discrete memoryless channel (DMC). The detector observes another DMS correlated with that at the observer, and performs a binary hypothesis

    更新日期:2020-03-20
  • Error Exponents of Typical Random Trellis Codes
    IEEE Trans. Inform. Theory (IF 3.215) Pub Date : 2019-09-23
    Neri Merhav

    In continuation to an earlier work, where error exponents of typical random codes were studied in the context of general block coding, with no underlying structure, here we carry out a parallel study on typical random, time–varying trellis codes, focusing on a certain range of low rates. By analyzing an upper bound to the error probability of the typical random trellis code, using the method of types

    更新日期:2020-03-20
  • Channel Input Adaptation via Natural Type Selection
    IEEE Trans. Inform. Theory (IF 3.215) Pub Date : 2019-09-17
    Sergey Tridenski; Ram Zamir

    We propose an algorithm for computation of the optimal correct-decoding exponent, and its corresponding optimal input. The computation algorithm translates into a stochastic iterative algorithm for adaptation of the codebook distribution to an unknown discrete memoryless channel in the limit of a large block length. The adaptation scheme uses i.i.d. random block codes, and it relies on one bit of feedback

    更新日期:2020-03-20
  • On the Compression of Messages in the Multi-Party Setting
    IEEE Trans. Inform. Theory (IF 3.215) Pub Date : 2020-01-09
    Anurag Anshu; Penghui Yao

    We consider the following communication task in the multi-party setting, which involves joint random variables $XYZMN$ with the property that $M$ is independent of $YZN$ conditioned on $X$ , and $N$ is independent of $XZM$ conditioned on $Y$ . Three parties Alice, Bob and Charlie, respectively, observe samples $x,y$ and $z$ from $XYZ$ . Alice and Bob communicate messages to Charlie with the goal that

    更新日期:2020-03-20
  • Generalized Gaussian Multiterminal Source Coding: The Symmetric Case
    IEEE Trans. Inform. Theory (IF 3.215) Pub Date : 2020-02-04
    Jun Chen; Li Xie; Yameng Chang; Jia Wang; Yizhong Wang

    Consider a generalized multiterminal source coding system, where $\binom{\ell }{ m}$ encoders, each observing a distinct size- $m$ subset of $\ell $ ( $\ell \geq 2$ ) zero-mean unit-variance exchangeable Gaussian sources with correlation coefficient $\rho $ , compress their observations in such a way that a joint decoder can reconstruct the sources within a prescribed mean squared error distortion

    更新日期:2020-03-20
  • Quantum Channel Simulation and the Channel’s Smooth Max-Information
    IEEE Trans. Inform. Theory (IF 3.215) Pub Date : 2019-09-26
    Kun Fang; Xin Wang; Marco Tomamichel; Mario Berta

    We study the general framework of quantum channel simulation, that is, the ability of a quantum channel to simulate another one using different classes of codes. First, we show that the minimum error of simulation and the one-shot quantum simulation cost under no-signalling assisted codes are given by semidefinite programs. Second, we introduce the channel’s smooth max-information, which can be seen

    更新日期:2020-03-20
  • One-Shot Capacity Bounds on the Simultaneous Transmission of Classical and Quantum Information
    IEEE Trans. Inform. Theory (IF 3.215) Pub Date : 2019-10-07
    Farzin Salek; Anurag Anshu; Min-Hsiu Hsieh; Rahul Jain; Javier Rodríguez Fonollosa

    We study the communication capabilities of a quantum channel under the most general channel model known as the one-shot model. Unlike classical channels that can only be used to transmit classical information (bits), a quantum channel can be used for transmission of classical information, quantum information (qubits) and simultaneous transmission of classical and quantum information. In this work,

    更新日期:2020-03-20
  • Completing the Grand Tour of Asymptotic Quantum Coherence Manipulation
    IEEE Trans. Inform. Theory (IF 3.215) Pub Date : 2019-10-09
    Ludovico Lami

    We compute on all quantum states several measures that characterise asymptotic quantum coherence manipulation under restricted classes of operations. We focus on the distillable coherence, i.e. the maximum rate of production of approximate pure bits of coherence starting from independent copies of an input state $ {\rho }$ , and on the coherence cost, i.e. the minimum rate of consumption of pure coherence

    更新日期:2020-03-20
  • BIA for the K-User Interference Channel Using Reconfigurable Antenna at Receivers
    IEEE Trans. Inform. Theory (IF 3.215) Pub Date : 2019-12-09
    Milad Johnny; Mohammad Reza Aref

    In this paper, we consider the problem of data transmission for ${K}-$ user interference channel (IC) with no channel state information (CSI) at transmitters. Each pair of transceivers with the aid of a particular precoder and a switching pattern structure tries to place its desired signal in a subspace which is linearly independent of interference signals. We show that if the channel values are known

    更新日期:2020-03-20
  • Constant-Gap-to-Capacity and Generalized Degrees of Freedom Regions of the MIMO MAC-IC-MAC
    IEEE Trans. Inform. Theory (IF 3.215) Pub Date : 2019-12-16
    Yimin Pang; Mahesh K. Varanasi

    The MAC-IC-MAC is a class of multiple-access interference channels consisting of two multiple-access channels (MACs) that are mutually interfering but in which there is interference only from one transmitter of each MAC to the receiver of the other MAC. Two achievable rate regions that are within a quantifiable gap of the capacity region for the discrete-memoryless semi-deterministic MAC-IC-MAC were

    更新日期:2020-03-20
  • Rate-Memory Trade-Off for Caching and Delivery of Correlated Sources
    IEEE Trans. Inform. Theory (IF 3.215) Pub Date : 2020-01-28
    Parisa Hassanzadeh; Antonia M. Tulino; Jaime Llorca; Elza Erkip

    This paper studies the fundamental limits of content delivery in a cache-aided broadcast network for correlated content generated by a discrete memoryless source with arbitrary joint distribution. Each receiver is equipped with a cache of equal capacity, and the requested files are delivered over a shared error-free broadcast link. A class of achievable correlation-aware schemes based on a two-step

    更新日期:2020-03-20
  • Fundamental Limits of Coded Caching With Multiple Antennas, Shared Caches and Uncoded Prefetching
    IEEE Trans. Inform. Theory (IF 3.215) Pub Date : 2019-11-25
    Emanuele Parrinello; Ayşe Ünsal; Petros Elia

    The work explores the fundamental limits of coded caching in the setting where a transmitter with potentially multiple ( $N_{0}$ ) antennas serves different users that are assisted by a smaller number of caches. Under the assumption of uncoded cache placement, the work derives the exact optimal worst-case delay and DoF, for a broad range of user-to-cache association profiles where each such profile

    更新日期:2020-03-20
  • Achieving Zero-Packet-Loss Throughput 1 for a Collision Channel Without Feedback and With Arbitrary Time Offsets
    IEEE Trans. Inform. Theory (IF 3.215) Pub Date : 2020-01-27
    Yijin Zhang; Yi Chen; Yuan-Hsun Lo; Wing Shing Wong

    The collision channel without feedback (CCw/oFB) introduced by Massey and Mathys, depicts a scenario where multiple users share a communication channel but have arbitrary time offsets, and can never learn these time offsets due to the lack of feedback. This paper considers an extension of the CCw/oFB, which allows the receiver to use successive interference cancellation (SIC) to cancel the interference

    更新日期:2020-03-20
  • Quickest Detection of Dynamic Events in Networks
    IEEE Trans. Inform. Theory (IF 3.215) Pub Date : 2019-10-18
    Shaofeng Zou; Venugopal V. Veeravalli; Jian Li; Don Towsley

    The problem of quickest detection of dynamic events in networks is studied. At some unknown time, an event occurs, and a number of nodes in the network are affected by the event, in that they undergo a change in the statistics of their observations. It is assumed that the event is dynamic, in that it can propagate along the edges in the network, and affect more and more nodes with time. The event propagation

    更新日期:2020-03-20
  • Several Classes of Minimal Linear Codes With Few Weights From Weakly Regular Plateaued Functions
    IEEE Trans. Inform. Theory (IF 3.215) Pub Date : 2019-11-28
    Sihem Mesnager; Ahmet Sınak

    Minimal linear codes have significant applications in secret sharing schemes and secure two-party computation. There are several methods to construct linear codes, one of which is based on functions over finite fields. Recently, many construction methods for linear codes from functions have been proposed in the literature. In this paper, we generalize the recent construction methods given by Tang et

    更新日期:2020-03-20
  • Syndrome-Coupled Rate-Compatible Error-Correcting Codes: Theory and Application
    IEEE Trans. Inform. Theory (IF 3.215) Pub Date : 2020-01-13
    Pengfei Huang; Yi Liu; Xiaojie Zhang; Paul H. Siegel; Erich F. Haratsch

    Rate-compatible error-correcting codes (ECCs), which consist of a set of extended codes, are of practical interest in both wireless communications and data storage. In this work, we first study the lower bounds for rate-compatible ECCs, thus proving the existence of good rate-compatible codes. Then, we propose a general framework for constructing rate-compatible ECCs based on cosets and syndromes of

    更新日期:2020-03-20
  • Coding Over Sets for DNA Storage
    IEEE Trans. Inform. Theory (IF 3.215) Pub Date : 2019-12-20
    Andreas Lenz; Paul H. Siegel; Antonia Wachter-Zeh; Eitan Yaakobi

    In this paper we study error-correcting codes for the storage of data in synthetic deoxyribonucleic acid (DNA). We investigate a storage model where a data set is represented by an unordered set of $M$ sequences, each of length $L$ . Errors within that model are a loss of whole sequences and point errors inside the sequences, such as insertions, deletions and substitutions. We derive Gilbert-Varshamov

    更新日期:2020-03-20
  • Coding Against Deletions in Oblivious and Online Models
    IEEE Trans. Inform. Theory (IF 3.215) Pub Date : 2020-01-21
    Venkatesan Guruswami; Ray Li

    We consider binary error correcting codes when errors are deletions. A basic challenge concerning deletion codes is determining ${p}_{0}^{(adv)}$ , the zero-rate threshold of adversarial deletions , defined to be the supremum of all $p$ for which there exists a code family with rate bounded away from 0 capable of correcting a fraction $p$ of adversarial deletions. A recent construction of deletion-correcting

    更新日期:2020-03-20
  • Two Deletion Correcting Codes From Indicator Vectors
    IEEE Trans. Inform. Theory (IF 3.215) Pub Date : 2019-10-29
    Jin Sima; Netanel Raviv; Jehoshua Bruck

    Construction of capacity achieving deletion correcting codes has been a baffling challenge for decades. A recent breakthrough by Brakensiek et al ., alongside novel applications in DNA storage, have reignited the interest in this longstanding open problem. In spite of recent advances, the amount of redundancy in existing codes is still orders of magnitude away from being optimal. In this paper, a novel

    更新日期:2020-03-20
  • Deep Holes of Projective Reed-Solomon Codes
    IEEE Trans. Inform. Theory (IF 3.215) Pub Date : 2019-09-16
    Jun Zhang; Daqing Wan; Krishna Kaipa

    Projective Reed-Solomon (PRS) codes are Reed-Solomon codes of the maximum possible length $q+1$ . The classification of deep holes –received words with maximum possible error distance– for PRS codes is an important and difficult problem. In this paper, we use algebraic methods to explicitly construct three classes of deep holes for PRS codes. We show that these three classes completely classify all

    更新日期:2020-03-20
  • On Optimal Locally Repairable Codes With Multiple Disjoint Repair Sets
    IEEE Trans. Inform. Theory (IF 3.215) Pub Date : 2019-09-30
    Han Cai; Ying Miao; Moshe Schwartz; Xiaohu Tang

    Locally repairable codes are desirable for distributed storage systems to improve the repair efficiency. In this paper, a new combination of codes with locality and codes with multiple disjoint repair sets (also called availability) is introduced. Accordingly, a Singleton-type bound is derived for the new code, which contains those bounds in [9] , [20] , [28] as special cases. Optimal constructions

    更新日期:2020-03-20
  • Private Streaming With Convolutional Codes
    IEEE Trans. Inform. Theory (IF 3.215) Pub Date : 2020-01-03
    Lukas Holzbaur; Ragnar Freij-Hollanti; Antonia Wachter-Zeh; Camilla Hollanti

    Recently, information-theoretic private information retrieval (PIR) from coded storage systems has gained a lot of attention, and a general star product PIR scheme was proposed. In this paper, the star product scheme is adopted, with appropriate modifications, to the case of private ( e.g. , video) streaming. It is assumed that the files to be streamed are stored on $n$ servers in a coded form, and

    更新日期:2020-03-20
  • Interleaved Polar (I-Polar) Codes
    IEEE Trans. Inform. Theory (IF 3.215) Pub Date : 2020-01-24
    Mao-Ching Chiu

    By inserting interleavers between intermediate stages of the polar encoder, a new class of polar codes, termed interleaved polar (i-polar) codes, is proposed. By the uniform interleaver assumption, we derive the weight enumerating function (WEF) and the input-output weight enumerating function (IOWEF) averaged over the ensemble of i-polar codes. The average WEF can be used to calculate the upper bound

    更新日期:2020-03-20
  • One-Shot PIR: Refinement and Lifting
    IEEE Trans. Inform. Theory (IF 3.215) Pub Date : 2019-11-19
    Rafael G. L. D’Oliveira; Salim El Rouayheb

    We study a class of private information retrieval (PIR) methods that we call one-shot schemes. The intuition behind one-shot schemes is the following. The user’s query is regarded as a dot product of a query vector and the message vector (database) stored at multiple servers. Privacy, in an information theoretic sense, is then achieved by encrypting the query vector using a secure linear code, such

    更新日期:2020-03-20
  • A New Approach to the Kasami Codes of Type 2
    IEEE Trans. Inform. Theory (IF 3.215) Pub Date : 2019-10-25
    Minjia Shi; Denis S. Krotov; Patrick Solé

    The dual of the Kasami code of length $q^{2}-1$ , with $q$ a power of 2, is constructed by concatenating a cyclic MDS code of length $q+1$ over $F_{q}$ with a Simplex code of length $q-1$ . This yields a new derivation of the weight distribution of the Kasami code, a new description of its coset graph, and a new proof that the Kasami code is completely regular. The automorphism groups of the Kasami

    更新日期:2020-03-20
  • Failure Analysis of the Interval-Passing Algorithm for Compressed Sensing
    IEEE Trans. Inform. Theory (IF 3.215) Pub Date : 2020-01-24
    Yauhen Yakimenka; Eirik Rosnes

    In this work, we perform a complete failure analysis of the interval-passing algorithm (IPA) for compressed sensing. The IPA is an efficient iterative algorithm for reconstructing a $k$ -sparse nonnegative $n$ -dimensional real signal ${x}$ from a small number of linear measurements ${y}$ . In particular, we show that the IPA fails to recover ${x}$ from ${y}$ if and only if it fails to recover a corresponding

    更新日期:2020-03-20
  • The Generalized Lasso for Sub-Gaussian Measurements With Dithered Quantization
    IEEE Trans. Inform. Theory (IF 3.215) Pub Date : 2020-01-17
    Christos Thrampoulidis; Ankit Singh Rawat

    In the problem of structured signal recovery from high-dimensional linear observations, it is commonly assumed that full-precision measurements are available. Under this assumption, the recovery performance of the popular Generalized Lasso (G-Lasso) is by now well-established. In this paper, we extend these types of results to the practically relevant settings with quantized measurements. We study

    更新日期:2020-03-20
  • Effective Condition Number Bounds for Convex Regularization
    IEEE Trans. Inform. Theory (IF 3.215) Pub Date : 2020-01-10
    Dennis Amelunxen; Martin Lotz; Jake Walvin

    We derive bounds relating Renegar’s condition number to quantities that govern the statistical performance of convex regularization in settings that include the $\ell _{1}$ -analysis setting. Using results from conic integral geometry, we show that the bounds can be made to depend only on a random projection, or restriction, of the analysis operator to a lower dimensional space, and can still be effective

    更新日期:2020-03-20
  • Optimal Variable Selection and Adaptive Noisy Compressed Sensing
    IEEE Trans. Inform. Theory (IF 3.215) Pub Date : 2020-01-10
    Mohamed Ndaoud; Alexandre B. Tsybakov

    In the context of high-dimensional linear regression models, we propose an algorithm of exact support recovery in the setting of noisy compressed sensing where all entries of the design matrix are independent and identically distributed standard Gaussian. This algorithm achieves the same conditions of exact recovery as the exhaustive search (maximal likelihood) decoder, and has an advantage over the

    更新日期:2020-03-20
  • MML Is Not Consistent for Neyman-Scott
    IEEE Trans. Inform. Theory (IF 3.215) Pub Date : 2019-09-24
    Michael Brand

    Strict Minimum Message Length (SMML) is an information-theoretic statistical inference method widely cited (but only with informal arguments) as providing estimations that are consistent for general estimation problems. It is, however, almost invariably intractable to compute, for which reason only approximations of it (known as MML algorithms) are ever used in practice. Using novel techniques that

    更新日期:2020-03-20
  • The Trade-Off Between Privacy and Fidelity via Ehrhart Theory
    IEEE Trans. Inform. Theory (IF 3.215) Pub Date : 2019-12-16
    Arun Padakandla; P. R. Kumar; Wojciech Szpankowski

    As an increasing amount of data is gathered nowadays and stored in databases, the question arises of how to protect the privacy of individual records in a database even while providing accurate answers to queries on the database. Differential Privacy (DP) has gained acceptance as a framework to quantify vulnerability of algorithms to privacy breaches. We consider the problem of how to sanitize an entire

    更新日期:2020-03-20
  • Measuring Uncertainty Under Prior Information
    IEEE Trans. Inform. Theory (IF 3.215) Pub Date : 2020-01-30
    Lakshmi Kanta Patra; Suchandan Kayal; Somesh Kumar

    There are various situations where prior information is available on parameters in the form of order relations. One needs to take into account this information to obtain superior estimators. Shannon modeled uncertainty mathematically and called it entropy. In this paper, we study the problem of estimating entropy of two exponential populations associated with a common scale parameter, and unknown but

    更新日期:2020-03-20
  • Binarization Trees and Random Number Generation
    IEEE Trans. Inform. Theory (IF 3.215) Pub Date : 2019-12-25
    Sung-Il Pae

    An $m$ -extracting procedure produces unbiased random bits from a loaded dice with $m$ faces, and its output rate, the average number of output per input is bounded by the Shannon entropy of the source. This information-theoretic upper bound can be achieved only asymptotically as the input size increases, by certain extracting procedures that we call asymptotically optimal. Although a computationally

    更新日期:2020-03-20
  • On the Bounded Distance Decoding Problem for Lattices Constructed and Their Cryptographic Applications
    IEEE Trans. Inform. Theory (IF 3.215) Pub Date : 2020-01-17
    Zhe Li; San Ling; Chaoping Xing; Sze Ling Yeo

    In this paper, we propose new classes of trapdoor functions to solve the bounded distance decoding problem in lattices. Specifically, we construct lattices based on properties of polynomials for which the bounded distance decoding problem is hard to solve unless some trapdoor information is revealed. We thoroughly analyze the security of our proposed functions using state-of-the-art attacks and results

    更新日期:2020-03-20
  • Corrections to “Wyner’s Common Information Under Rényi Divergence Measures”
    IEEE Trans. Inform. Theory (IF 3.215) Pub Date : 2020-01-30
    Lei Yu; Vincent Y. F. Tan

    In this correspondence, we correct an erroneous result on the achievability part of the Rényi common information with order $1+s\in (1,2]$ in (L. Yu and V. Y. F. Tan, “Wyner’s common information under Rényi divergence measures,” IEEE Trans. Inf. Theory, vol. 64, no. 5, pp. 3616–3632, May 2018). The new achievability result (upper bound) of the Rényi common information no longer coincides with Wyner’s

    更新日期:2020-03-20
  • Adaptive Linear Programming Decoding of Nonbinary Linear Codes Over Prime Fields
    IEEE Trans. Inform. Theory (IF 3.215) Pub Date : 2019-11-25
    Eirik Rosnes; Michael Helmling

    In this work, we consider adaptive linear programming (ALP) decoding of linear codes over prime fields, i.e., the finite fields $\mathbb F_{p}$ of size $p$ where $p$ is a prime, when used over a $p$ -ary input memoryless channel. In particular, we provide a general construction of valid inequalities (using no auxiliary variables) for the codeword polytope (or the convex hull) of the so-called constant-weight

    更新日期:2020-02-18
  • An Index Coding Approach to Caching With Uncoded Cache Placement
    IEEE Trans. Inform. Theory (IF 3.215) Pub Date : 2020-01-20
    Kai Wan; Daniela Tuninetti; Pablo Piantanida

    Caching is an efficient way to reduce network traffic congestion during peak hours, by storing some content at the user’s local cache memory, even without knowledge of user’s later demands. Maddah-Ali and Niesen proposed a two-phase (placement phase and delivery phase) coded caching strategy for broadcast channels with cache-aided users. This paper investigates the same model under the constraint that

    更新日期:2020-02-18
  • A Pliable Index Coding Approach to Data Shuffling
    IEEE Trans. Inform. Theory (IF 3.215) Pub Date : 2019-11-19
    Linqi Song; Christina Fragouli; Tianchu Zhao

    A promising research area that has recently emerged, is on how to use index coding to improve the communication efficiency in distributed computing systems, especially for data shuffling in iterative computations. In this paper, we posit that pliable index coding can offer a more efficient framework for data shuffling, as it can better leverage the many possible shuffling choices to reduce the number

    更新日期:2020-02-18
  • Covert Communication With Polynomial Computational Complexity
    IEEE Trans. Inform. Theory (IF 3.215) Pub Date : 2019-11-26
    Qiaosheng Zhang; Mayank Bakshi; Sidharth Jaggi

    This paper develops a concatenated coding scheme with polynomial computational complexity for covert communication over Binary Symmetric Channels (BSCs) and binary-input Discrete Memoryless Channels (DMCs). Our setting is as follows — a transmitter Alice wishes to potentially reliably transmit a message to a receiver Bob, while ensuring that the transmission taking place is covert with respect to a

    更新日期:2020-02-18
  • Bounds and Constructions of Codes Over Symbol-Pair Read Channels
    IEEE Trans. Inform. Theory (IF 3.215) Pub Date : 2019-09-18
    Ohad Elishco; Ryan Gabrys; Eitan Yaakobi

    Cassuto and Blaum recently studied the symbol-pair channel, a model where every two consecutive symbols are read together. This special channel structure is motivated by the limitations of the reading process in high density data storage systems, where it is no longer possible to read individual symbols. In this new paradigm, the errors are not individual symbol errors, but rather symbol-pair errors

    更新日期:2020-02-18
  • Error Correction Based on Partial Information
    IEEE Trans. Inform. Theory (IF 3.215) Pub Date : 2019-11-19
    Itzhak Tamo; Min Ye; Alexander Barg

    We consider the decoding of linear and array codes from errors when we are only allowed to download a part of the codeword. More specifically, suppose that we have encoded $k$ data symbols using an $(n,k)$ code with code length $n$ and dimension $k$ . During storage, some of the codeword coordinates might be corrupted by errors. We aim to recover the original data by reading the corrupted codeword

    更新日期:2020-02-18
  • Binary MDS Array Codes With Optimal Repair
    IEEE Trans. Inform. Theory (IF 3.215) Pub Date : 2019-09-03
    Hanxu Hou; Patrick P. C. Lee

    Consider a binary maximum distance separable (MDS) array code composed of an $m\times (k+r)$ array of bits with $k$ information columns and $r$ parity columns, such that any $k$ out of $k+r$ columns suffice to reconstruct the $k$ information columns. Our goal is to provide optimal repair access for binary MDS array codes, meaning that the bandwidth triggered to repair any single failed information

    更新日期:2020-02-18
  • The Existence of Perfect Codes in Doob Graphs
    IEEE Trans. Inform. Theory (IF 3.215) Pub Date : 2019-10-11
    Denis S. Krotov

    We solve the problem of existence of perfect codes in the Doob graph. It is shown that 1-perfect codes in the Doob graph $ {D(m,n)}$ exist if and only if $6 {m}+3 {n}+1$ is a power of 2; that is, if the size of a 1-ball divides the number of vertices.

    更新日期:2020-02-18
  • Secure Network Code for Adaptive and Active Attacks With No-Randomness in Intermediate Nodes
    IEEE Trans. Inform. Theory (IF 3.215) Pub Date : 2019-12-02
    Ning Cai; Masahito Hayashi

    In secure network coding, there is a possibility that the eavesdropper can improve her performance when she changes (contaminates) the information on the attacked edges (active attack) and chooses the attacked edges adaptively (adaptive attack). We analyze the security for network code over such types of attacks. We show that active and adaptive attacks cannot improve the performance of the eavesdropper

    更新日期:2020-02-18
  • How Many Weights Can a Cyclic Code Have?
    IEEE Trans. Inform. Theory (IF 3.215) Pub Date : 2019-10-11
    Minjia Shi; Xiaoxiao Li; Alessandro Neri; Patrick Solé

    Upper and lower bounds on the largest number of weights in a cyclic code of given length, dimension and alphabet are given. An application to irreducible cyclic codes is considered. Sharper upper bounds are given for the special cyclic codes (called here strongly cyclic), whose nonzero codewords have period equal to the length of the code. Asymptotics are derived on the function $\Gamma (k,q)$ , that

    更新日期:2020-02-18
  • The Need for Structure in Quantum LDPC Codes
    IEEE Trans. Inform. Theory (IF 3.215) Pub Date : 2019-11-21
    Lior Eldar; Maris Ozols; Kevin Thompson

    The existence of quantum LDPC codes with minimal distance scaling linearly in the number of qubits is a central open problem in quantum information. Despite years of research good quantum LDPC codes are not known to exist, but at the very least it is known they cannot be defined on very regular topologies, like low-dimensional grids. In this work we establish a complementary result, showing that good

    更新日期:2020-02-18
  • A New Code for Encoding All Monotone Sources With a Fixed Large Alphabet Size
    IEEE Trans. Inform. Theory (IF 3.215) Pub Date : 2020-01-10
    Hamed Narimani; Mohammadali Khosravifard

    The problem of designing a fixed code for encoding all monotone sources with a large alphabet size $n$ is studied. It is proved that if the codelengths of a code sequence are of order $O(\log n)$ , then the redundancy for almost all monotone sources with $n$ symbols is very close to that for a specific distribution, so-called average distribution. Noting this point, for any large alphabet size $n$

    更新日期:2020-02-18
  • Achievability Performance Bounds for Integer-Forcing Source Coding
    IEEE Trans. Inform. Theory (IF 3.215) Pub Date : 2019-11-01
    Elad Domanovitz; Uri Erez

    Integer-forcing source coding has been proposed as a low-complexity method for compression of distributed correlated Gaussian sources. In this scheme, each encoder quantizes its observation using the same fine lattice and reduces the result modulo a coarse lattice. Rather than directly recovering the individual quantized signals, the decoder first recovers a full-rank set of judiciously chosen integer

    更新日期:2020-02-18
  • Wiretap Channels With Random States Non-Causally Available at the Encoder
    IEEE Trans. Inform. Theory (IF 3.215) Pub Date : 2019-11-08
    Ziv Goldfeld; Paul Cuff; Haim H. Permuter

    We study the state-dependent (SD) wiretap channel (WTC) with non-causal channel state information (CSI) at the encoder. This model subsumes all instances of CSI availability as special cases, and calls for an efficient utilization of the state sequence for both reliability and security purposes. A lower bound on the secrecy-capacity, that improves upon the previously best known result published by

    更新日期:2020-02-18
  • Generalized Lexicographic Products and the Index Coding Capacity
    IEEE Trans. Inform. Theory (IF 3.215) Pub Date : 2019-12-24
    Fatemeh Arbabjolfaei; Young-Han Kim

    The index coding problem studies the fundamental limit on broadcasting multiple messages to their respective receivers with different sets of side information that are represented by a directed graph. The generalized lexicographic product structure in the side information graph is introduced as a natural condition under which the corresponding index coding problem can be decomposed into multiple interacting

    更新日期:2020-02-18
  • Asymptotically Optimal Stochastic Encryption for Quantized Sequential Detection in the Presence of Eavesdroppers
    IEEE Trans. Inform. Theory (IF 3.215) Pub Date : 2019-11-25
    Jiangfan Zhang; Xiaodong Wang

    We consider sequential detection based on quantized data in the presence of eavesdropper. Stochastic encryption is employed as a counter measure that flips the quantization bits at each sensor according to certain probabilities, and the flipping probabilities are only known to the legitimate fusion center (LFC) but not the eavesdropping fusion center (EFC). As a result, the LFC employs the optimal

    更新日期:2020-02-18
  • Homologous Codes for Multiple Access Channels
    IEEE Trans. Inform. Theory (IF 3.215) Pub Date : 2019-11-28
    Pinar Sen; Young-Han Kim

    Building on recent development by Padakandla and Pradhan, and by Lim, Feng, Pastore, Nazer, and Gastpar, this paper studies the potential of structured coset coding as a complete replacement for random coding in network information theory. The roles of two techniques used in coset coding to generate nonuniform codewords, namely, shaping and channel transformation, are clarified and illustrated via

    更新日期:2020-02-18
  • Semantically Secure Lattice Codes for Compound MIMO Channels
    IEEE Trans. Inform. Theory (IF 3.215) Pub Date : 2019-11-18
    Antonio Campello; Cong Ling; Jean-Claude Belfiore

    We consider compound multi-input multi-output (MIMO) wiretap channels where minimal channel state information at the transmitter (CSIT) is assumed. Code construction is given for the special case of isotropic mutual information, which serves as a conservative strategy for general cases. Using the flatness factor for MIMO channels, we propose lattice codes universally achieving the secrecy capacity

    更新日期:2020-02-18
  • A New Iterative Algorithm for Computing the Correct Decoding Probability Exponent of Discrete Memoryless Channels
    IEEE Trans. Inform. Theory (IF 3.215) Pub Date : 2019-10-31
    Yutaka Jitsumatsu; Yasutada Oohama

    Dueck and Körner’s reliability function for discrete memoryless channels for rates above the capacity coincides with Arimoto’s exponent of correct decoding probability. The two exponent functions are described by seemingly different optimization problems over the space of probability distributions. Arimoto gave an iterative algorithm for solving the optimization problem that appears in his exponent

    更新日期:2020-02-18
  • Learning an Adversary’s Actions for Secret Communication
    IEEE Trans. Inform. Theory (IF 3.215) Pub Date : 2019-09-13
    Mehrdad Tahmasbi; Matthieu R. Bloch; Aylin Yener

    Secure communication over a wiretap channel is investigated, in which an active adversary modifies the state of the channel and the legitimate transmitter has the opportunity to sense and learn the adversary’s actions. The adversary has the ability to switch the channel state and observe the corresponding output at every channel use while the encoder has causal access to observations that depend on

    更新日期:2020-02-18
Contents have been reproduced by permission of the publishers.
导出
全部期刊列表>>
宅家赢大奖
向世界展示您的会议墙报和演示文稿
全球疫情及响应:BMC Medicine专题征稿
新版X-MOL期刊搜索和高级搜索功能介绍
化学材料学全球高引用
ACS材料视界
x-mol收录
自然科研论文编辑服务
南方科技大学
南方科技大学
西湖大学
中国科学院长春应化所于聪-4-8
复旦大学
课题组网站
X-MOL
香港大学化学系刘俊治
中山大学化学工程与技术学院
试剂库存
天合科研
down
wechat
bug