50 results
Search Results
2. IEEE Transactions on Information Theory Information for Authors.
- Subjects
PERIODICAL publishing ,INFORMATION theory ,AUTHORS - Abstract
These instructions give guidelines for preparing papers for this publication. Presents information for authors publishing in this journal. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
3. IEEE Transactions on Information Theory information for authors.
- Subjects
PERIODICAL publishing ,INFORMATION theory ,AUTHORS - Abstract
These instructions give guidelines for preparing papers for this publication. Presents information for authors publishing in this journal. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
4. IEEE Transactions on Information Theory information for authors.
- Subjects
PERIODICAL publishing ,INFORMATION theory ,AUTHORS - Abstract
These instructions give guidelines for preparing papers for this publication. Presents information for authors publishing in this journal. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
5. IEEE Transactions on Information Theory information for authors.
- Subjects
INFORMATION theory ,CYBERNETICS ,PERIODICAL publishing ,AUTHORS - Abstract
These instructions give guidelines for preparing papers for this publication. Presents information for authors publishing in this journal. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
6. IEEE Transactions on Information Theory information for authors.
- Subjects
INFORMATION theory ,CYBERNETICS ,PERIODICAL publishing ,AUTHORS - Abstract
These instructions give guidelines for preparing papers for this publication. Presents information for authors publishing in this journal. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
7. IEEE Transactions on Information Theory information for authors.
- Subjects
INFORMATION theory ,CYBERNETICS ,PERIODICAL publishing ,AUTHORS - Abstract
These instructions give guidelines for preparing papers for this publication. Presents information for authors publishing in this journal. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
8. IEEE Transactions on Information Theory information for authors.
- Subjects
IEEE 802 standard ,INFORMATION theory - Published
- 2022
- Full Text
- View/download PDF
9. IEEE Transactions on Information Theory information for authors.
- Subjects
INFORMATION theory - Abstract
The article offers instructions for authors in preparing papers for publication in the journal.
- Published
- 2021
- Full Text
- View/download PDF
10. IEEE Transactions on Information Theory information for authors.
- Subjects
INFORMATION theory ,CYBERNETICS ,PERIODICAL publishing ,AUTHORS - Abstract
These instructions give guidelines for preparing papers for this publication. Presents information for authors publishing in this journal. [ABSTRACT FROM AUTHOR]
- Published
- 2021
- Full Text
- View/download PDF
11. IEEE Transactions on Information Theory information for authors.
- Subjects
INFORMATION theory ,CYBERNETICS ,PERIODICAL publishing ,AUTHORS - Abstract
These instructions give guidelines for preparing papers for this publication. Presents information for authors publishing in this journal. [ABSTRACT FROM AUTHOR]
- Published
- 2021
- Full Text
- View/download PDF
12. IEEE Transactions on Information Theory information for authors.
- Subjects
INFORMATION theory ,CYBERNETICS ,PERIODICAL publishing ,AUTHORS - Abstract
These instructions give guidelines for preparing papers for this publication. Presents information for authors publishing in this journal. [ABSTRACT FROM AUTHOR]
- Published
- 2021
- Full Text
- View/download PDF
13. IEEE Transactions on Information Theory information for authors.
- Subjects
IEEE 802 standard ,INFORMATION theory - Published
- 2022
- Full Text
- View/download PDF
14. IEEE Transactions on Information Theory information for authors.
- Subjects
INFORMATION theory - Published
- 2022
- Full Text
- View/download PDF
15. IEEE Transactions on Information Theory information for authors.
- Subjects
INFORMATION theory - Abstract
The article offers information on preparation of manuscripts, graphical abstract, and open access related to the periodical.
- Published
- 2022
- Full Text
- View/download PDF
16. IEEE Transactions on Information Theory information for authors.
- Subjects
INFORMATION theory - Abstract
The article offers information related to supplementary material, preparation of manuscripts, and open access for the authors of the periodical.
- Published
- 2021
- Full Text
- View/download PDF
17. Improved Bounds for (b, k)-Hashing.
- Author
-
Della Fiore, Stefano, Costa, Simone, and Dalai, Marco
- Subjects
DISTRIBUTION (Probability theory) ,INFORMATION theory ,COMPUTER science ,QUADRATIC forms - Abstract
For fixed integers $n$ and $b\geq k$ , let $A(b,k,n)$ the largest size of a subset of $\{1,2,\ldots,b\}^{n}$ such that, for any $k$ distinct elements in the set, there is a coordinate where they all differ. Bounding $A(b,k,n)$ is a problem of relevant interest in information theory and computer science, relating to the zero-error capacity with list decoding and to the study of $(b, k)$ -hash families of functions. It is known that, for fixed $b$ and $k$ , $A(b,k,n)$ grows exponentially in $n$. In this paper, we determine new exponential upper bounds for different values of $b$ and $k$. A first bound on $A(b,k,n)$ for general $b$ and $k$ was derived by Fredman and Komlós in the ’80s and improved for certain $b\neq k$ by Körner and Marton and by Arikan. Only very recently better bounds were derived for general $b$ and $k$ by Guruswami and Riazanov, while stronger results for small values of $b=k$ were obtained by Arikan, by Dalai, Guruswami and Radhakrishnan, and by Costa and Dalai. In this paper, we strengthen the bounds for some specific values of $b$ and $k$. Our contribution is a new computational method for obtaining upper bounds on the values of a quadratic form defined over discrete probability distributions in arbitrary dimensions, which emerged as a central ingredient in recent works. The proposed method reduces an infinite-dimensional problem to a finite one, which we manage to further simplify by means of a series of optimality conditions. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
18. Secret Key-Enabled Authenticated-Capacity Region, Part—II: Typical-Authentication.
- Author
-
Graves, Eric, Perazzone, Jake B., Yu, Paul L., and Blum, Rick S.
- Subjects
GAUSSIAN channels ,DECODERS & decoding ,MULTIUSER channels - Abstract
This paper investigates the secret key-authenticated-capacity region, where information-theoretic authentication is defined by the ability of the decoder to accept and decode messages originating from a valid encoder while rejecting messages from other invalid sources. The model considered here consists of a valid encoder-decoder pairing that can communicate through a channel controlled by an adversary who is also able to eavesdrop on the encoder’s transmissions. Prior to the encoder’s transmission, the adversary decides whether or not to replace the decoder’s observation with an arbitrary one of the adversary’s choosing, with the adversary’s objective being to have the decoder accept and decode their observation to a valid message (different from that of the encoder). To combat the adversary, the encoder and decoder share a secret key. The secret key-authenticated-capacity region is defined as the region of jointly achievable message rate, authentication rate (a to be defined per symbol measure that will generally represent the likelihood that an adversary can fool the decoder), and the key-consumption rate (how many bits of secret key are needed per symbol sent). This is the second of a two-part study, with the parts differing in their measure of the authentication rate. For this second study, the probability of false authentication is considered as a function of the system state, where the system state is defined by the message being transmitted, the value of the secret key, the adversary’s channel observations, and the adversary’s (possibly stochastic) choice for the decoder’s observation. Termed the typical-authentication rate, the authentication measure considered here corresponds to an upper bound on the probability of false authentication for the majority of system states. For this measure, we derive matching inner and outer bounds for the secret key-enabled authenticated capacity region in terms of traditional information-theoretic measures. In doing so, it is shown that the typical-authentication rate and the message rate exhibit a one-to-one trade-off in the capacity region. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
19. Simple Coding Techniques for Many-Hop Relaying.
- Author
-
Ling, Yan Hao and Scarlett, Jonathan
- Subjects
ERROR probability ,HOPS ,INFORMATION theory ,VELOCITY - Abstract
In this paper, we study the problem of relaying a single bit of information across a series of binary symmetric channels, and the associated trade-off between the number of hops $m$ , the transmission time $n$ , and the error probability. We introduce a simple, efficient, and deterministic protocol that attains positive information velocity (i.e., a non-vanishing ratio $\frac {m}{n}$ and small error probability) and is significantly simpler than existing protocols that do so. In addition, we characterize the optimal low-noise and high-noise scaling laws of the information velocity, and we adapt our 1-bit protocol to transmit $k$ bits over $m$ hops with $\mathcal {O}(m+k)$ transmission time. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
20. Secret Key-Enabled Authenticated-Capacity Region, Part I: Average Authentication.
- Author
-
Perazzone, Jake B., Graves, Eric, Yu, Paul L., and Blum, Rick S.
- Subjects
CHANNEL coding ,DECODERS & decoding ,WIRELESS sensor networks ,MULTIUSER channels - Abstract
This paper investigates the secret-key-authenticated-capacity region, where information-theoretic authentication is defined by the ability of the decoder to accept and decode messages originating from a valid encoder while rejecting messages from other invalid sources. The model considered here consists of a valid encoder-decoder pairing that can communicate through a channel controlled by an adversary who is also able to eavesdrop on the encoder’s transmissions. Over multiple rounds of communication, the adversary first decides whether or not to replace the decoder’s observation with an arbitrary one of the adversary’s choosing, with the goal of the adversary being to have the decoder accept and decode their observation as a valid message (different from that of the encoder). To combat the adversary, the encoder and decoder share a secret key. The secret-key-authenticated-capacity region here is then defined as the region of jointly achievable message rate, authentication rate (a to be defined per symbol measure that will generally represent the likelihood that an adversary can fool the decoder), and the key-consumption rate (how many bits of secret key are needed per symbol sent). This is the first of a two-part study, with the parts differing in their measure of the authentication rate. In this first study, the authentication rate is the exponent of blocklength-normalized exponent of the expected probability of false authentication. For this metric, we provide an inner bound which improves on those existing in the literature. This is achieved by adopting and merging different classical techniques in novel ways. Within these classical secret-key-based authentication techniques, one technique derives authentication capability from secure channel coding to send the secret key with the message, and the other technique derives its authentication capability directly from obscuring the source. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
21. Tsallis and Rényi Deformations Linked via a New λ-Duality.
- Author
-
Wong, Ting-Kam Leonard and Zhang, Jun
- Subjects
MAXIMUM entropy method ,RENYI'S entropy ,INFORMATION theory ,STATISTICAL physics - Abstract
Tsallis and Rényi entropies, which are monotone transformations of each other, are deformations of the celebrated Shannon entropy. Maximization of these deformed entropies, under suitable constraints, leads to the $q$ -exponential family which has applications in non-extensive statistical physics, information theory and statistics. In previous information-geometric studies, the $q$ -exponential family was analyzed using classical convex duality and Bregman divergence. In this paper, we show that a generalized $\lambda $ -duality, where $\lambda = 1 - q$ is to be interpreted as the constant information-geometric curvature, leads to a generalized exponential family which is essentially equivalent to the $q$ -exponential family and has deep connections with Rényi entropy and optimal transport. Using this generalized convex duality and its associated logarithmic divergence, we show that our $\lambda $ -exponential family satisfies properties that parallel and generalize those of the exponential family. Under our framework, the Rényi entropy and divergence arise naturally, and we give a new proof of the Tsallis/Rényi entropy maximizing property of the $q$ -exponential family. We also introduce a $\lambda $ -mixture family which may be regarded as the dual of the $\lambda $ -exponential family, and connect it with other mixture-type families. Finally, we discuss a duality between the $\lambda $ -exponential family and the $\lambda $ -logarithmic divergence, and study its statistical consequences. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
22. On the Duals of Generalized Bent Functions.
- Author
-
Wang, Jiaxin and Fu, Fang-Wei
- Subjects
RESEARCH & development ,BENT functions ,VECTOR spaces ,INFORMATION theory - Abstract
In this paper, we study the duals of generalized bent functions $f: V_{n}\rightarrow \mathbb {Z}_{p^{k}}$ , where $V_{n}$ is an $n$ -dimensional vector space over $\mathbb {F}_{p}$ and $p$ is an odd prime, $k$ is a positive integer. It is known that weakly regular generalized bent functions always appear in pairs since the dual of a weakly regular generalized bent function is also a weakly regular generalized bent function. The duals of non-weakly regular generalized bent functions can be generalized bent or not generalized bent. By generalizing the construction of Çeşmelioğlu et al., 2016, we provide an explicit construction of generalized bent functions whose duals can be generalized bent or not generalized bent. We show that the well-known direct sum construction and the generalized indirect sum construction given in Wang and Fu, 2021. can provide secondary constructions of generalized bent functions whose duals can be generalized bent or not generalized bent. By using the knowledge on ideal decomposition in cyclotomic fields, we prove that $f^{**}(x)=f(-x)$ if $f$ is a generalized bent function and its dual $f^{*}$ is also a generalized bent function. For any non-weakly regular generalized bent function $f$ which satisfies that $f(x)=f(-x)$ and its dual $f^{*}$ is generalized bent, we give a property and as a consequence, we prove that there is no self-dual generalized bent function $f: V_{n}\rightarrow \mathbb {Z}_{p^{k}}$ if $p\equiv 3 ~(mod ~4)$ and $n$ is odd. When $p \equiv 1 ~(mod ~4)$ or $p\equiv 3 ~(mod ~4)$ and $n$ is even, we give a secondary construction of self-dual generalized bent functions. In the end, by the decomposition of generalized bent functions, we characterize the relations between the generalized bentness of the dual of a generalized bent function $f$ and the bentness of the duals of bent functions associated with the generalized bent function $f$ , as well as the relations of self-duality between a generalized bent function $f$ and bent functions associated with the generalized bent function $f$. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
23. A Bound on Undirected Multiple-Unicast Network Information Flow.
- Author
-
Qureshi, Mohammad Ishtiyaq and Thakor, Satyajit
- Subjects
INFORMATION networks ,LINEAR network coding ,INFORMATION theory ,LINEAR programming ,STATISTICAL decision making ,LOGICAL prediction - Abstract
One of the important unsolved problems in information theory is the conjecture that the undirected multiple-unicast network information capacity is the same as the routing capacity. This conjecture is verified only for a handful of networks and network classes. Moreover, only two explicit upper bounds on information capacity are known for general undirected networks: the sparsest cut bound and the linear programming bound. In this paper, we present an information-theoretic upper bound, called the partition bound, on the capacity of general undirected multiple-unicast networks. We show that a decision version problem of computing the bound is NP-complete. We present two classes of undirected multiple-unicast networks such that the partition bound is achievable by routing. Thus, the conjecture is proved for these classes of networks. Recently, the conjecture was proved for a new class of networks defined by properties relating to cut-set and source-sink paths. We show the existence of a network outside of this new class of networks such that the partition bound is achievable by routing. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
24. On One-Dimensional Linear Minimal Codes Over Finite (Commutative) Rings.
- Author
-
Maji, Makhan, Mesnager, Sihem, Sarkar, Santanu, and Hansda, Kalyan
- Subjects
LINEAR codes ,CODING theory ,FINITE rings ,COMMUTATIVE rings ,ALGEBRAIC fields ,ABSTRACT algebra ,FINITE fields - Abstract
Minimal linear codes have significant applications in secret sharing schemes and secure two-party computation. When they are defined over finite fields, those codes have been intensively studied, especially in recent years, but they have been firstly partially characterized by Ashikhmin and Barg since 1998. Next, they were completely characterized in 2018 by Ding, Heng, and Zhou in terms of the minimum and maximum nonzero weights in the corresponding codes. Since then, many construction methods for minimal linear codes over finite fields throughout algebraic and geometric approaches have been proposed in the literature. In particular, the algebraic approach gives rise to minimal codes from (cryptographic) functions. Linear codes over finite fields have been expanded into the collection of acceptable alphabets for codes and study codes over finite commutative rings. A natural way to extend the known results available in the literature is to consider minimal linear codes over commutative rings with unity. In extending coding theory to codes over rings, several essential principles must be considered. Particularly extending the minimality property from finite fields to rings and creating such codes is not simple. Such an extension offers more flexibility in the construction of minimal codes. The present article investigates one-dimensional minimal linear codes over the rings $\mathbb {Z}_{p^{n}}$ (where $p$ is a prime) and $\mathbb {Z}_{p^{m}q^{n}}$ (where $p < q$ are distinct primes and $m\leq n$). Our ultimate objective is to characterize such codes’ minimality and design minimal linear codes over the considered rings. Given our objective, we first introduced the notion of minimal codes over (commutative) rings and succeeded in deriving simple characterization of one-dimensional minimal linear codes over the underlying rings mentioned above. Our new algebraic approach allows designing new minimal linear codes. Almost minimal codes over rings are also presented. To the best of our knowledge, the present paper offers a wide variety of minimal codes over (commutative) rings for the first time. Novel perspectives and developments in this direction are expected in the future. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
25. The Gray-Wyner Network and Wyner’s Common Information for Gaussian Sources.
- Author
-
Sula, Erixhen and Gastpar, Michael
- Subjects
INFORMATION resources ,INFORMATION theory ,COVARIANCE matrices ,RANDOM variables ,MULTICASTING (Computer networks) - Abstract
This paper presents explicit solutions for two related non-convex information extremization problems due to Gray and Wyner in the Gaussian case. The first problem is the Gray-Wyner network subject to a sum-rate constraint on the two private links. Here, our argument establishes the optimality of Gaussian codebooks and hence, a closed-form formula for the optimal rate region. The second problem is Wyner’s common information and a generalization thereof, where conditional independence is generalized to a limit on the conditional mutual information. We present full explicit solutions for the scalar as well as the vector case. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
26. Generalized Submodular Information Measures: Theoretical Properties, Examples, Optimization Algorithms, and Applications.
- Author
-
Iyer, Rishabh, Khargonkar, Ninad, Bilmes, Jeff, and Asnani, Himanshu
- Subjects
INFORMATION measurement ,SUBMODULAR functions ,MATHEMATICAL optimization ,RANDOM variables ,MACHINE learning ,RANDOM sets - Abstract
Information-theoretic quantities like entropy and mutual information have found numerous uses in machine learning. It is well known that there is a strong connection between these entropic quantities and submodularity since entropy over a set of random variables is submodular. In this paper, we study combinatorial information measures that generalize independence, (conditional) entropy, (conditional) mutual information, and total correlation defined over sets of (not necessarily random) variables. These measures strictly generalize the corresponding entropic measures since they are all parameterized via submodular functions that themselves strictly generalize entropy. Critically, we show that, unlike entropic mutual information in general, the submodular mutual information is actually submodular in one argument, holding the other fixed, for a large class of submodular functions whose third-order partial derivatives satisfy a non-negativity property. This turns out to include a number of practically useful cases such as the facility location and set-cover functions. We study specific instantiations of the submodular information measures on these, as well as the probabilistic coverage, graph-cut, log-determinants, and saturated coverage functions and see that they all have mathematically intuitive and practically useful expressions. Finally, we also study generalized independence between subsets of datapoints (random variables in the entropic case), and connect the independence characterizations to independence in log-submodular distributions. Regarding applications, we connect the maximization of submodular (conditional) mutual information to problems such as mutual-information-based, query-based, and privacy preserving summarization—and we connect optimizing the multi-set submodular mutual information to clustering and robust partitioning. We perform real world as well as synthetic experiments on various data summarization tasks. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
27. Locally-Constrained de Bruijn Codes: Properties, Enumeration, Code Constructions, and Applications.
- Author
-
Chee, Yeow Meng, Etzion, Tuvi, Kiah, Han Mao, Marcovich, Sagi, Vardy, Alexander, Khu Vu, Van, and Yaakobi, Eitan
- Subjects
DE Bruijn graph ,AUTOMOBILE racetracks ,SHIFT registers ,INFORMATION theory ,CODING theory - Abstract
The de Bruijn graph, its sequences, and their various generalizations, have found many applications in information theory, including many new ones in the last decade. In this paper, motivated by a coding problem for emerging memory technologies, a set of sequences which generalize the window property of de Bruijn sequences, on its shorter subsequences, are defined. These sequences can be also defined and viewed as constrained sequences. Hence, they will be called locally-constrained de Bruijn sequences and a set of such sequences will be called a locally-constrained de Bruijn code. Several properties and alternative definitions for such codes are examined and they are analyzed as generalized sequences in the de Bruijn graph (and its generalization) and as constrained sequences. Various enumeration techniques are used to compute the total number of sequences for any given set of parameters. A construction method of such codes from the theory of shift-register sequences is proposed. Finally, we show how these locally-constrained de Bruijn sequences and codes can be applied in constructions of codes for correcting synchronization errors in the $\ell $ -symbol read channel and in the racetrack memory channel. For this purpose, these codes are superior in their size to previously known codes. [ABSTRACT FROM AUTHOR]
- Published
- 2021
- Full Text
- View/download PDF
28. Reverse Euclidean and Gaussian Isoperimetric Inequalities for Parallel Sets With Applications.
- Subjects
ISOPERIMETRIC inequalities ,MACHINE learning ,INFORMATION theory ,SURFACE area ,COMPUTATIONAL complexity ,EUCLIDEAN algorithm - Abstract
The $r$ -parallel set of a set $A \subseteq {\mathbb {R}} ^{d}$ is the set of all points whose distance from $A$ is less than $r$. In this paper, we show that the surface area of an $r$ -parallel set in ${\mathbb {R}}^{d}$ with volume at most $V$ is upper-bounded by $e^{\Theta (d)}V/r$ , whereas its Gaussian surface area is upper-bounded by $\max (e^{\Theta (d)}, e^{\Theta (d)}/r)$. We also derive a reverse form of the Brunn-Minkowski inequality for $r$ -parallel sets, and as an aside a reverse entropy power inequality for Gaussian-smoothed random variables. We apply our results to two problems in theoretical machine learning: (1) bounding the computational complexity of learning $r$ -parallel sets under a Gaussian distribution; and (2) bounding the sample complexity of estimating robust risk, which is a notion of risk in the adversarial machine learning literature that is analogous to the Bayes risk in hypothesis testing. [ABSTRACT FROM AUTHOR]
- Published
- 2021
- Full Text
- View/download PDF
29. Optimal Change-Point Detection With Training Sequences in the Large and Moderate Deviations Regimes.
- Author
-
He, Haiyun, Zhang, Qiaosheng, and Tan, Vincent Y. F.
- Subjects
CHANGE-point problems ,LARGE deviations (Mathematics) ,INFORMATION theory ,ERROR probability ,ERROR functions ,CONFIDENCE intervals - Abstract
This paper investigates a novel offline change-point detection problem from an information-theoretic perspective. In contrast to most related works, we assume that the knowledge of the underlying pre- and post-change distributions are not known and can only be learned from the training sequences which are available. We further require the probability of the estimation error to decay either exponentially or sub-exponentially fast (corresponding respectively to the large and moderate deviations regimes in information theory parlance). Based on the training sequences as well as the test sequence consisting of a single change-point, we design a change-point estimator and further show that this estimator is optimal by establishing matching (strong) converses. This leads to a full characterization of the optimal confidence width (i.e., half the width of the confidence interval within which the true change-point is located at with high probability) as a function of the undetected error, under both the large and moderate deviations regimes. [ABSTRACT FROM AUTHOR]
- Published
- 2021
- Full Text
- View/download PDF
30. Adversarial Risk via Optimal Transport and Optimal Couplings.
- Author
-
Pydi, Muni Sreenivas and Jog, Varun
- Subjects
MACHINE learning ,DISTRIBUTION (Probability theory) ,GAUSSIAN distribution ,INFORMATION theory ,STATISTICAL learning - Abstract
Modern machine learning algorithms perform poorly on adversarially manipulated data. Adversarial risk quantifies the error of classifiers in adversarial settings; adversarial classifiers minimize adversarial risk. In this paper, we analyze adversarial risk and adversarial classifiers from an optimal transport perspective. We show that the optimal adversarial risk for binary classification with 0–1 loss is determined by an optimal transport cost between the probability distributions of the two classes. We develop optimal transport plans (probabilistic couplings) for univariate distributions such as the normal, the uniform, and the triangular distribution. We also derive optimal adversarial classifiers in these settings. Our analysis leads to algorithm-independent fundamental limits on adversarial risk, which we calculate for several real-world datasets. We extend our results to general loss functions under convexity and smoothness assumptions. [ABSTRACT FROM AUTHOR]
- Published
- 2021
- Full Text
- View/download PDF
31. Efficiently List-Decodable Insertion and Deletion Codes via Concatenation.
- Author
-
Liu, Shu, Tjuawinata, Ivan, and Xing, Chaoping
- Subjects
INFORMATION theory ,BINARY codes ,DECODING algorithms ,ENCODING ,CYCLIC codes - Abstract
In this paper, we consider the list decoding property of codes under insertion and deletion errors (insdel for short). Firstly, we analyse the list decodability of random insdel codes. Our result provides a more complete picture on the list decodability of insdel codes when both insertion and deletion errors happen. Secondly, we construct a family of insdel codes along with their efficient encoding and decoding algorithms through concatenation method which provides a Zyablov-type bound for insdel metric codes. [ABSTRACT FROM AUTHOR]
- Published
- 2021
- Full Text
- View/download PDF
32. Repeat-Free Codes.
- Author
-
Elishco, Ohad, Gabrys, Ryan, Yaakobi, Eitan, and Medard, Muriel
- Subjects
ALGORITHMS ,ERROR-correcting codes ,DNA sequencing ,INFORMATION theory ,SHIFT registers - Abstract
In this paper we consider the problem of encoding data into repeat-free sequences in which sequences are imposed to contain any k-tuple at most once (for predefined k). First, the capacity of the repeat-free constraint are calculated. Then, an efficient algorithm, which uses two bits of redundancy, is presented to encode length-n sequences for k = 2 + 2 log (n). This algorithm is then improved to support any value of k of the form k = a log (n), for 1 < a, while its redundancy is o(n). We also calculate the capacity of repeat-free sequences when combined with local constraints which are given by a constrained system, and the capacity of multi-dimensional repeat-free codes. [ABSTRACT FROM AUTHOR]
- Published
- 2021
- Full Text
- View/download PDF
33. A General Framework for Class Label Specific Mutual Information Feature Selection Method.
- Author
-
Rakesh, Deepak Kumar and Jana, Prasanta K.
- Subjects
FEATURE selection ,INFORMATION theory ,MAGNETIC resonance imaging - Abstract
Information theory-based feature selection (ITFS) methods select a single subset of features for all classes based on the following criteria: 1) minimizing redundancy between the selected features and 2) maximizing classification information of the selected features with the classes. A critical issue with selecting a single subset of features is that they may not represent the feature space in which individual class labels can be separated exclusively. Existing methods fail to provide a way to select the feature space specific to the individual class label. To this end, we propose a novel feature selection method called class-label specific mutual information (CSMI) that selects a specific set of features for each class label. The proposed method maximizes the information shared among the selected features and target class label but minimizes the same with all classes. We also consider the dynamic change of information between selected features and the target class label when a candidate feature is added. Finally, we provide a general framework for the CSMI to make it classifier-independent. We perform experiments on sixteen benchmark data sets using four classifiers and found that the CSMI outperforms five traditional, two state-of-the-art ITFS (multi-class classification), and one multi-label classification methods. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
34. On the Reverse-Complement String-Duplication System.
- Author
-
Ben-Tolila, Eyar and Schwartz, Moshe
- Subjects
ERROR-correcting codes ,INFORMATION theory - Abstract
Motivated by DNA storage in living organisms, and by known biological mutation processes, we study the reverse-complement string-duplication system. We fully classify the conditions under which the system has full expressiveness, for all alphabets and all fixed duplication lengths. We then focus on binary systems with duplication length 2 and prove that they have full capacity, yet surprisingly, have zero entropy-rate. Finally, by using binary single burst-insertion correcting codes, we construct codes that correct a single reverse-complement duplication of odd length, over any alphabet. The redundancy (in bits) of the constructed code does not depend on the alphabet size. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
35. An Information-Theoretic View of Stochastic Localization.
- Author
-
El Alaoui, Ahmed and Montanari, Andrea
- Subjects
ESTIMATION theory ,INFORMATION theory ,COVARIANCE matrices ,PROBABILITY measures ,GAUSSIAN channels ,ENTROPY ,FLUX pinning - Abstract
Given a probability measure $\mu $ over $\mathbb {R}^{n}$ , it is often useful to approximate it by the convex combination of a small number of probability measures, such that each component is close to a product measure. Recently, Ronen Eldan used a stochastic localization argument to prove a general decomposition result of this type. In Eldan’s theorem, the ‘number of components’ is characterized by the entropy of the mixture, and ‘closeness to product’ is characterized by the covariance matrix of each component. We present an elementary proof of Eldan’s theorem which makes use of an information theory (or estimation theory) interpretation. The proof is analogous to the one of an earlier decomposition result known as the ‘pinning lemma.’ [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
36. Resolution Limits of Non-Adaptive 20 Questions Search for Multiple Targets.
- Author
-
Zhou, Lin, Bai, Lin, and Hero, Alfred O.
- Subjects
CHANNEL coding ,INFORMATION theory ,DATA transmission systems - Abstract
We study the problem of simultaneous search for multiple targets over a multidimensional unit cube and derive fundamental resolution limits of non-adaptive querying procedures using the 20 questions estimation framework. The performance criterion that we consider is the achievable resolution, which is defined as the maximal $L_\infty $ norm between the location vector and its estimated version where the maximization is over all target location vectors. The fundamental resolution limit is defined as the minimal achievable resolution of any non-adaptive query procedure, where each query has binary yes/no answers. We drive non-asymptotic and second-order asymptotic bounds on the minimal achievable resolution, using tools from finite blocklength information theory. Specifically, in the achievability part, we relate the 20 questions problem to data transmission over a multiple access channel, use the information spectrum method by Han and borrow results from finite blocklength analysis for random access channel coding. In the converse part, we relate the 20 questions problem to data transmission over a point-to-point channel and adapt finite blocklength converse results for channel coding. Our results extend the purely first-order asymptotic analyses of Kaspi et al. (ISIT 2015) for the one-dimensional case: we consider channels beyond the binary symmetric channel and derive non-asymptotic and second-order asymptotic bounds on the performance of optimal non-adaptive query procedures. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
37. A Generalization of Costa’s Entropy Power Inequality.
- Subjects
ENTROPY ,GENERALIZATION ,INFORMATION theory ,RANDOM variables - Abstract
Aim of this short note is to study Shannon’s entropy power along entropic interpolations, thus generalizing Costa’s concavity theorem. We shall provide two proofs of independent interest: the former by $\Gamma $ -calculus, hence applicable to more abstract frameworks; the latter with an explicit remainder term, reminiscent of Villani (IEEE Trans. Inf. Theory, 2006), allowing us to characterize the case of equality. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
38. Secure Distributed Matrix Computation With Discrete Fourier Transform.
- Author
-
Mital, Nitish, Ling, Cong, and Gunduz, Deniz
- Subjects
MATRIX inversion ,MATRIX multiplications ,DISCRETE Fourier transforms ,DISTRIBUTED algorithms ,FINITE fields ,EXPONENTIATION ,MATRICES (Mathematics) - Abstract
We consider the problem of secure distributed matrix computation (SDMC), where a user queries a function of data matrices generated at distributed source nodes. We assume the availability of $N$ honest but curious computation servers, which are connected to the sources, the user, and each other through orthogonal and reliable communication links. Our goal is to minimize the amount of data that must be transmitted from the sources to the servers, called the upload cost, while guaranteeing that no $T$ colluding servers can learn any information about the source matrices, and the user cannot learn any information beyond the computation result. We first focus on secure distributed matrix multiplication (SDMM), considering two matrices, and propose a novel polynomial coding scheme using the properties of finite field discrete Fourier transform, which achieves an upload cost significantly lower than the existing results in the literature. We then generalize the proposed scheme to include straggler mitigation, and to the multiplication of multiple matrices while keeping the input matrices, the intermediate computation results, as well as the final result secure against any $T$ colluding servers. We also consider a special case, called computation with own data, where the data matrices used for computation belong to the user. In this case, we drop the security requirement against the user, and show that the proposed scheme achieves the minimal upload cost. We then propose methods for performing other common matrix computations securely on distributed servers, including changing the parameters of secret sharing, matrix transpose, matrix exponentiation, solving a linear system, and matrix inversion, which are then used to show how arbitrary matrix polynomials can be computed securely on distributed servers using the proposed procedure. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
39. Infinite Divisibility of Information.
- Subjects
INDEPENDENT component analysis ,RANDOM variables ,INJECTIVE functions ,DISTRIBUTION (Probability theory) ,INFORMATION theory ,DIVISIBILITY groups - Abstract
We study an information analogue of infinitely divisible probability distributions, where the i.i.d. sum is replaced by the joint distribution of an i.i.d. sequence. A random variable $X$ is called informationally infinitely divisible if, for any $n\ge 1$ , there exists an i.i.d. sequence of random variables $Z_{1},\ldots,Z_{n}$ that contains the same information as $X$ , i.e., there exists an injective function $f$ such that $X=f(Z_{1},\ldots,Z_{n})$. While there does not exist such informationally infinitely divisible discrete random variable, we show that any discrete random variable $X$ can be divided into arbitrarily many identical pieces with a multiplicative penalty to the entropy, that is, if we remove the injectivity requirement on $f$ , then there exists i.i.d. $Z_{1},\ldots,Z_{n}$ and $f$ satisfying $X=f(Z_{1},\ldots,Z_{n})$ , and the entropy satisfies $H(X)/n\le H(Z_{1})\le 1.59H(X)/n+2.43$ bits. Furthermore, we study the case where $X=(Y_{1},\ldots,Y_{m})$ is itself an i.i.d. sequence, $m\ge 2$ , for which the multiplicative gap 1.59 can be replaced by $1+5\sqrt {(\log m)/m}$. This means that as $m$ increases, $(Y_{1},\ldots,Y_{m})$ becomes closer to being spectral infinitely divisible in a uniform manner. This can be regarded as an information analogue of Kolmogorov’s uniform theorem. Applications of our result include independent component analysis and distributed storage with a secrecy constraint. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
40. Lattice (List) Decoding Near Minkowski’s Inequality.
- Author
-
Mook, Ethan and Peikert, Chris
- Subjects
ERROR-correcting codes ,DECODING algorithms ,SPHERE packings ,RIESZ spaces ,INFORMATION theory ,REED-Solomon codes ,ALGORITHMS - Abstract
Minkowski proved that any $n$ -dimensional lattice of unit determinant has a nonzero vector of Euclidean norm at most $\sqrt {n}$ ; in fact, there are $2^{\Omega (n)}$ such lattice vectors. Lattices whose minimum distances come close to Minkowski’s bound provide excellent sphere packings and error-correcting codes in ${\mathbb {R}}^{n}$. The focus of this work is a certain family of efficiently constructible $n$ -dimensional lattices due to Barnes and Sloane, whose minimum distances are within an $O(\sqrt {\log n})$ factor of Minkowski’s bound. Our primary contribution is a polynomial-time algorithm that list decodes this family to distances approaching $1/\sqrt {2}$ of the minimum distance. The main technique is to decode Reed-Solomon codes under error measured in the Euclidean norm, using the Koetter-Vardy “soft decision” variant of the Guruswami-Sudan list-decoding algorithm. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
41. The Semiring of Dichotomies and Asymptotic Relative Submajorization.
- Author
-
Perry, Christopher, Vrana, Peter, and Werner, Albert H.
- Subjects
TENSOR products ,SEMIRINGS (Mathematics) ,INFORMATION theory ,QUANTUM theory ,EXPONENTS ,GENERALIZATION - Abstract
We study quantum dichotomies and the resource theory of asymmetric distinguishability using a generalization of Strassen’s theorem on preordered semirings. We find that an asymptotic variant of relative submajorization, defined on unnormalized dichotomies, is characterized by real-valued monotones that are multiplicative under the tensor product and additive under the direct sum. These strong constraints allow us to classify and explicitly describe all such monotones, leading to a rate formula expressed as an optimization involving sandwiched Rényi divergences. As an application we give a new derivation of the strong converse error exponent in quantum hypothesis testing. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
42. Bounds on the Zero-Error List-Decoding Capacity of the q /(q – 1) Channel.
- Author
-
Bhandari, Siddharth and Radhakrishnan, Jaikumar
- Subjects
NUCLEAR energy ,INFORMATION theory ,LOGICAL prediction ,CHANNEL coding - Abstract
Let $\mathcal {X}= \{x_{1},x_{2},\ldots, x_{q}\}$ and let $n(m,q,\ell)$ be the smallest $n$ for which there is a code $C \subseteq \mathcal {X} ^{n}$ of $m$ elements such that for every list $w_{1}, w_{2}, \ldots, w_{\ell +1}$ of distinct codewords from $C$ , there is a coordinate $j \in [n]$ such that $\{w_{1}[j], w_{2}[j], \ldots, w_{\ell +1}[j]\} = \mathcal {X}$. We show that there is a constant $A>0$ such that for $\epsilon < 1/5$ , for all large $q$ and large enough $m$ ($m>q^{5}$), we have $n(m,q, \lceil \epsilon q\ln {q}\rceil) \geq \exp {(Aq^{1-5\epsilon })}\log _{2}{m}$. This bound has consequences for the zero-error list-decoding capacity of the $q/(q-1)$ channel studied by Elias (1988). Our result implies that for $A$ and $\epsilon $ as above, the zero-error list-decoding capacity of the $q/(q-1)$ channel with list-size $\epsilon q\ln {q}$ is at most $\exp (-Aq^{1-5\epsilon })$ , that is, it falls exponentially as $q$ increases. This confirms a conjecture of Chakraborty et al. (2006). [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
43. Table of contents.
- Subjects
INFORMATION theory ,LINEAR codes ,CONTINUOUS processing ,INFORMATION-theoretic security ,REED-Solomon codes ,ARITHMETIC - Published
- 2021
- Full Text
- View/download PDF
44. Asymptotic Properties of the Plug-in Estimator of the Discrete Entropy Under Dependence.
- Author
-
Seri, Raffaello and Martinoli, Mario
- Subjects
MARGINAL distributions ,TIME series analysis ,ENTROPY (Information theory) ,ASYMPTOTIC distribution ,GOODNESS-of-fit tests ,RANDOM variables - Abstract
We consider the estimation of the entropy of a discretely-supported time series through a plug-in estimator. We provide a correction of the bias and we study the asymptotic properties of the estimator. We show that the widely-used correction proposed by Roulston (1999) is incorrect as it does not remove the $O\left ({N^{-1}}\right)$ part of the bias while ours does. We provide the asymptotic distribution and we show that it differs when the values taken by the marginal distribution of the process are equiprobable (a situation that we call degeneracy) and when they are not. We introduce estimators of the bias, the variance and the distribution under degeneracy and we study the estimation error. Finally, we propose a goodness-of-fit test based on entropy and give two motivations for it. The theoretical results are supported by specific numerical examples. [ABSTRACT FROM AUTHOR]
- Published
- 2021
- Full Text
- View/download PDF
45. Two-Way Source-Channel Coding.
- Author
-
Weng, Jian-Jia, Alajaji, Fady, and Linder, Tamas
- Subjects
TWO-way communication ,SOURCE code ,TELECOMMUNICATION systems ,CHANNEL coding ,LINEAR network coding ,NOISE measurement ,INFORMATION theory - Abstract
We propose an adaptive lossy joint source-channel coding (JSCC) scheme for sending correlated sources over two-terminal discrete-memoryless two-way channels (DM-TWCs). The main idea is to couple the independent operations of the terminals via an adaptive coding mechanism, which can mitigate cross-interference resulting from simultaneous channel transmissions and concurrently exploit the sources’ correlation to reduce the end-to-end reconstruction distortions. Our adaptive JSCC scheme not only subsumes existing lossy coding methods for two-way simultaneous communication but also improves their performance. Furthermore, we derive outer bounds for our two-way lossy transmission problem and establish complete JSCC theorems in some special settings. In these special cases, a non-adaptive separate source-channel coding (SSCC) scheme achieves the optimal performance, thus simplifying the design of the source-channel communication system. [ABSTRACT FROM AUTHOR]
- Published
- 2021
- Full Text
- View/download PDF
46. Fairness Under Feature Exemptions: Counterfactual and Observational Measures.
- Author
-
Dutta, Sanghamitra, Venkatesh, Praveen, Mardziel, Piotr, Datta, Anupam, and Grover, Pulkit
- Subjects
COUNTERFACTUALS (Logic) ,DISPARATE impact (Law) ,INFORMATION theory ,STEREO vision (Computer science) ,FAIRNESS ,EMPLOYMENT references - Abstract
With the growing use of machine learning algorithms in highly consequential domains, the quantification and removal of disparity in decision making with respect to protected attributes, such as gender, race, etc., is becoming increasingly important. While quantifying disparity is essential, sometimes the needs of a business (e.g., hiring) may require the use of certain features that are critical in a way that any disparity that can be explained by them might need to be exempted. For instance, in hiring a software engineer for a safety-critical application, a coding-test score may be a critical feature that is weighed strongly in the decision even if it introduces disparity, whereas other features, such as name, zip code, or reference letters may be used to improve decision-making, but only to the extent that they do not add disparity. In this work, we propose a novel information-theoretic decomposition of the total disparity (a quantification inspired from counterfactual fairness) into two components: a non-exempt component which quantifies the part of the disparity that cannot be accounted for by the critical features, and an exempt component which quantifies the remaining disparity. This decomposition is important: it allows one to check if the disparity arose purely due to the critical features (inspired from the business necessity defense of disparate impact law) and also enables selective removal of the non-exempt component of disparity if desired. We arrive at this decomposition through canonical examples that lead to a set of desirable properties (axioms) that any measure of non-exempt disparity should satisfy. We then demonstrate that our proposed counterfactual measure of non-exempt disparity satisfies all of them. Our quantification bridges ideas of causality, Simpson’s paradox, and a body of work from information theory called Partial Information Decomposition (PID). We also obtain an impossibility result showing that no observational measure of non-exempt disparity can satisfy all of the desired properties, which leads us to relax our goals and examine alternative observational measures that satisfy only some of these properties. We perform case studies to show how one can audit existing models as well as train new models while reducing non-exempt disparity. [ABSTRACT FROM AUTHOR]
- Published
- 2021
- Full Text
- View/download PDF
47. Entropy and Relative Entropy From Information-Theoretic Principles.
- Author
-
Gour, Gilad and Tomamichel, Marco
- Subjects
ENTROPY (Information theory) ,RANDOM variables ,INFORMATION theory ,AXIOMS - Abstract
We introduce an axiomatic approach to entropies and relative entropies that relies only on minimal information-theoretic axioms, namely monotonicity under mixing and data-processing as well as additivity for product distributions. We find that these axioms induce sufficient structure to establish continuity in the interior of the probability simplex and meaningful upper and lower bounds, e.g., we find that every relative entropy satisfying these axioms must lie between the Rényi divergences of order 0 and $\infty $. We further show simple conditions for positive definiteness of such relative entropies and a characterisation in terms of a variant of relative trumping. Our main result is a one-to-one correspondence between entropies and relative entropies. [ABSTRACT FROM AUTHOR]
- Published
- 2021
- Full Text
- View/download PDF
48. The Birthday Problem and Zero-Error List Codes.
- Author
-
Noorzad, Parham, Effros, Michelle, Langberg, Michael, and Kostina, Victoria
- Subjects
INFORMATION theory ,BIRTHDAYS ,ENTROPY (Information theory) ,ERROR probability ,QUANTUM information theory ,INFINITY (Mathematics) ,PROBABILITY theory - Abstract
A key result of classical information theory states that if the rate of a randomly generated codebook is less than the mutual information between the channel’s input and output, then the probability that that codebook has negligible error goes to one as the blocklength goes to infinity. In an attempt to bridge the gap between the probabilistic world of classical information theory and the combinatorial world of zero-error information theory, this work derives necessary and sufficient conditions on the rate so that the probability that a randomly generated codebook operated under list decoding (for any fixed list size) has zero error probability goes to one as the blocklength goes to infinity. Furthermore, this work extends the classical birthday problem to an information-theoretic setting, which results in the definition of a “noisy” counterpart of Rényi entropy, analogous to how mutual information can be considered a noisy counterpart of Shannon entropy. [ABSTRACT FROM AUTHOR]
- Published
- 2021
- Full Text
- View/download PDF
49. Communication Complexity of Distributed High Dimensional Correlation Testing.
- Author
-
Sahasranand, K. R. and Tyagi, Himanshu
- Subjects
RANDOM variables ,INFORMATION theory ,PROBABILITY theory - Abstract
We consider a two-party distributed hypothesis testing problem for correlated Gaussian random variables. For a d-dimensional random vector X and a scalar random variable Y, where X and Y are jointly Gaussian with an unknown correlation vector ρ, parties P
1 and P2 observe independent copies of X and Y, respectively. The parties seek to test if their observations are correlated or not, namely they seek to test if |ρ|2 exceeds τ or is it 0. To that end, they communicate interactively and declare the test output. We show that roughly order d/τ2 bits of communication are sufficient and necessary for resolving the distributed correlation testing problem above. Furthermore, we establish a lower bound of roughly d2 /τ2 bits for the communication needed for distributed estimation of ρ, implying that distributed correlation testing requires less communication than distributed estimation. Both our lower bounds for testing and estimation hold for an arbitrary d and interactive communication with shared randomness, while our distributed test requires only one-way communication with shared randomness. For the one-dimensional case, with one-way communication and with probability of one of the error-types fixed, our bounds are more refined in the dependence on the other error-type and are tight even in the constant. [ABSTRACT FROM AUTHOR]- Published
- 2021
- Full Text
- View/download PDF
50. Finding Compositional Inverses of Permutations From the AGW Criterion.
- Author
-
Niu, Tailin, Li, Kangquan, Qu, Longjiang, and Wang, Qiang
- Subjects
RESEARCH & development ,FINITE fields ,INFORMATION theory ,POLYNOMIALS ,BIJECTIONS - Abstract
Permutation polynomials and their compositional inverses have wide applications in cryptography, coding theory, and combinatorial designs. Motivated by several previous results on finding compositional inverses of permutation polynomials of different forms, we propose a general method for finding these inverses of permutation polynomials constructed by the AGW criterion. As a result, we have reduced the problem of finding the compositional inverse of such a permutation polynomial over a finite field to that of finding the inverse of a bijection over a smaller set. We demonstrate our method by interpreting several recent known results, as well as by providing new explicit results on more classes of permutation polynomials in different types. In addition, we give new criteria for these permutation polynomials being involutions. Explicit constructions are also provided for all involutory criteria. [ABSTRACT FROM AUTHOR]
- Published
- 2021
- Full Text
- View/download PDF
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.