17,444 results
Search Results
102. 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
103. IEEE Transactions on Information Theory information for authors.
- Subjects
INFORMATION theory ,OPEN access publishing - Abstract
The article provides information on the periodical "Institute of Electrical and Electronics Engineers (IEEE) Transactions on Information Theory," including emphasis of the publication on the transmission, processing and utilization of information, abstract requirements for the submitted paper, and the copyright policy of the IEEE.
- Published
- 2021
- Full Text
- View/download PDF
104. 2004 IEEE Communications Society and Information Theory Society Joint Paper Award.
- Subjects
- *
INFORMATION theory , *ASSOCIATIONS, institutions, etc. , *COMMUNICATION , *PUBLICATIONS , *AWARDS - Abstract
The article presents information about the 2004 IEEE Communications Society and Information Theory Society Joint Paper Award. The award was presented to Giuseppe Caire and Shlomo Shamai for their paper "On the Achievable Throughput of a Multiantenna Gaussian Broadcast Channel," which appeared in the IEEE Transactions on Information Theory's July 2003 issue. The award consisting of a plaque and an honorarium, is given annually for an outstanding paper that appeared in any of the two societies' publications during the preceding year. The purpose of the award, established in 1999, is to recognize exceptional published works in research areas of common interest to the two societies. The award winner Guseppe Caire was born in Torino in Italy in 1965. He received the B.Sc. degree in electrical engineering from the Princeton University in 1992. He did his Ph.D.degree from Politecnino di Torino in 1994. The other winner Shlomo Shamai received the B.Sc., M.Sc. and Ph.D. degrees in electrical engineering from the Tecnion-Israel Institute of Technology, Haifa, 1975, 1981 and 1986 respectively.
- Published
- 2005
- Full Text
- View/download PDF
105. Quasi-Orthogonal Z-Complementary Pairs and Their Applications in Fully Polarimetric Radar Systems.
- Author
-
Wang, Jiahuan, Fan, Pingzhi, Zhou, Zhengchun, and Yang, Yang
- Subjects
RADAR ,DISTRIBUTED algorithms ,DOPPLER radar ,APPROXIMATION algorithms - Abstract
One objective of this paper is to propose a novel class of sequence pairs, called “quasi-orthogonal Z-complementary pairs (QOZCPs)”, each depicting Z-complementary property for their aperiodic auto-correlation sums and also having a low correlation zone when their aperiodic cross-correlation is considered. Construction of QOZCPs based on Successively Distributed Algorithms under Majorization Minimization (SDAMM) is presented. Another objective of this paper is to apply the proposed QOZCPs in fully polarimetric radar systems and analyse the corresponding ambiguity functions. It turns out that QOZCP waveforms are much more Doppler resilient than the known Golay complementary waveforms. [ABSTRACT FROM AUTHOR]
- Published
- 2021
- Full Text
- View/download PDF
106. Cyclic Bent Functions and Their Applications in Sequences.
- Author
-
Abdukhalikov, Kanat, Ding, Cunsheng, Mesnager, Sihem, Tang, Chunming, and Xiong, Maosheng
- Subjects
BENT functions ,BOOLEAN functions ,CODING theory ,SPECIAL functions ,INFORMATION theory - Abstract
Let m be an even positive integer. A Boolean bent function ƒ on F
2m-1 × F2 is called a cyclic bent function if for any a ≠ b ∈ F2m-1 and ε ∈ F2 , ƒ(ax1 , x2 )+ ƒ(bx1 , x2 + ε) is always bent, where x1 ∈ F2m-1 , x2 ∈ F2 . Cyclic bent functions look extremely rare. This paper focuses on cyclic bent functions on F2m-1 × F2 and their applications. The first objective of this paper is to establish a link between quadratic cyclic bent functions and a special type of prequasifields, and construct a class of quadratic cyclic bent functions from the Kantor-Williams prequasifields. The second objective is to use cyclic bent functions to construct families of optimal sequences. The results of this paper show that cyclic bent functions have nice applications in several fields such as coding theory, symmetric cryptography, and CDMA communication. [ABSTRACT FROM AUTHOR]- Published
- 2021
- Full Text
- View/download PDF
107. On Non-Detectability of Non-Computability and the Degree of Non-Computability of Solutions of Circuit and Wave Equations on Digital Computers.
- Author
-
Boche, Holger and Pohl, Volker
- Subjects
TURING machines ,DIFFERENTIABLE functions ,QUANTUM computing ,DIFFERENTIABLE dynamical systems ,WAVE equation ,COMPUTERS - Abstract
It is known that there exist mathematical problems of practical relevance which cannot be computed on a Turing machine. An important example is the calculation of the first derivative of continuously differentiable functions. This paper precisely classifies the non-computability of the first derivative, and of the maximum-norm of the first derivative in the Zheng-Weihrauch hierarchy. Based on this classification, the paper investigates whether it is possible that a Turing machine detects this non-computability of the first derivative by observing the data of the problem, and whether it is possible to detect upper bounds for the peak value of the first derivative of continuously differentiable functions. So from a practical point of view, the question is whether it is possible to implement an exit-flag functionality for observing non-computability of the first derivative. This paper even studies two different types of exit-flag functionality. A strong one, where the Turing machine always has to stop, and a weak one, where the Turing machine stops if and only if the input lies within the corresponding set of interest. It will be shown that non-computability of the first derivative is not detectable by a Turing machine for two concrete examples, namely for the problem of computing the input–output behavior of simple analog circuits and for solutions of the three-dimensional wave equation. In addition, it is shown that it is even impossible to detect an upper bound for the maximum norm of the first derivative. In particular, it is shown that all three problems are not even semidecidable. Finally, we briefly discuss implications of these results for analog and quantum computing. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
108. Polar Codes for Quantum Reading.
- Author
-
Pereira, Francisco Revson F. and Mancini, Stefano
- Subjects
QUANTUM states ,SQUARE root ,READING ,ERROR probability ,OPEN-ended questions - Abstract
Quantum readout provides a general framework for formulating statistical discrimination of quantum channels. Several paths have been taken for such this problem. However, there is much to be done in the avenue of optimizing channel discrimination using classical codes. At least two open questions can be pointed out: how to construct low complexity encoding schemes that are interesting for channel discrimination and, more importantly, how to develop capacity-achieving protocols. This paper aims at presenting a solution to these questions using polar codes. Firstly, we characterize the information rate and reliability parameter of the channels under polar encoding. We also show that the error probability of the scheme proposed decays exponentially with the square root of the code length. Secondly, an analysis of the optimal quantum states to be used as probes is given. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
109. Cache-Aided Matrix Multiplication Retrieval.
- Author
-
Wan, Kai, Sun, Hua, Ji, Mingyue, Tuninetti, Daniela, and Caire, Giuseppe
- Subjects
MATRIX multiplications ,CACHE memory ,LIBRARY users ,MACHINE learning - Abstract
Coded caching is a promising technique to smooth out network traffic by storing part of the library content at the users’ local caches. The seminal work on coded caching for single file retrieval by Maddah-Ali and Niesen (MAN) showed the existence of a global caching gain that scales with the total memory in the system, in addition to the known local caching gain in uncoded systems. This paper formulates a novel cache-aided matrix multiplication retrieval problem, relevant for data analytics and machine learning applications. In the considered problem, each cache-aided user requests the product of two matrices from the library. A structure-agnostic solution is to treat each possible matrix product as an independent file and use the MAN coded caching scheme for single file retrieval. This paper proposes two structure-aware schemes, which partition each matrix in the library by either rows or columns and let a subset of users cache some sub-matrices, that improve on the structure-agnostic scheme. For the case where the library matrices are “fat” matrices, the structure-aware row-partition scheme is shown to be order optimal under some constraint. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
110. Improved Rank-Modulation Codes for DNA Storage With Shotgun Sequencing.
- Author
-
Beeri, Niv and Schwartz, Moshe
- Subjects
SHOTGUN sequencing ,DNA ,DE Bruijn graph ,ABSOLUTE value - Abstract
A common method for reading information stored in DNA molecules is shotgun sequencing. This method outputs a histogram of the frequencies of all the molecules’ substrings of a given length $\ell $. To protect against noisy readings, the rank-modulation scheme encodes the information in the relative ranking of the substring frequencies, instead of their absolute values. However, the best rank-modulation codes for shotgun sequencing have low rates which are asymptotically vanishing. In this paper we propose new constructions of rank-modulation codes for shotgun sequencing. The first code construction is systematic, allowing the user to arbitrarily set the frequencies of a large subset of the substrings, which the encoder then completes to a permutation that may be realized by a DNA molecule. The construction is then improved by allowing the user to set the frequencies of additional substrings, at the cost of imposing constraints on the frequencies. The resulting codes have higher, non-vanishing rates, compared with previously known codes. As an example, for histograms of substrings of length $\ell =2$ , and an alphabet of size 4 (as in DNA molecules), we are able to construct a code with rate $\approx 0.909$ , whereas previously, the best construction resulted in a code with rate $\approx 0.654$. Additionally, the encoded information in our construction may be written to shorter DNA molecules than possible before. We also prove that the systematic codes constructed in this paper are the largest possible among all systematic codes. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
111. Iterative Message Passing Algorithm for Vertex-Disjoint Shortest Paths.
- Author
-
Dai, Guowei, Guo, Longkun, Gutin, Gregory, Zhang, Xiaoyan, and Zhang, Zan-Bo
- Subjects
TANNER graphs ,CODING theory ,ALGORITHMS ,DIRECTED graphs ,ARTIFICIAL intelligence ,GRAPH algorithms ,NP-hard problems ,WEIGHTED graphs - Abstract
As an algorithmic framework, message passing is extremely powerful and has wide applications in the context of different disciplines including communications, coding theory, statistics, signal processing, artificial intelligence and combinatorial optimization. In this paper, we investigate the performance of a message-passing algorithm called min-sum belief propagation (BP) for the vertex-disjoint shortest $k$ -path problem ($k$ -VDSP) on weighted directed graphs, and derive the iterative message-passing update rules. As the main result of this paper, we prove that for a weighted directed graph $G$ of order $n$ , BP algorithm converges to the unique optimal solution of $k$ -VDSP on $G$ within $O(n^{2}w_{max})$ iterations, provided that the weight $w_{e}$ is nonnegative integral for each arc $e\in E(G)$ , where $w_{max}=\max \{w_{e}: e\in E(G)\}$. To the best of our knowledge, this is the first instance where BP algorithm is proved correct for NP-hard problems. Additionally, we establish the extensions of $k$ -VDSP to the case of multiple sources or sinks. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
112. IEEE Transactions on Information Theory information for authors.
- Subjects
PERIODICAL publishing ,AUTHORS ,INFORMATION theory - 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
113. IEEE Transactions on Information Theory information for authors.
- Subjects
INFORMATION theory - Abstract
The article discusses about theoretical and experimental papers concerned with the transmission, processing, and utilization of information.
- Published
- 2021
- Full Text
- View/download PDF
114. 2007 IEEE Communications Society and Information Theory Society Joint Paper Award.
- Subjects
- *
AWARDS , *INFORMATION theory , *ELECTRICAL engineering , *UNIVERSITIES & colleges - Abstract
The article offers information on the recipients of the 2007 IEEE Information Theory Society Paper Award. Hanan Weingarten has masteral and doctorate degrees in electrical engineering from the Technion-Israel Institute of Technology. Yossef Steinberg was a Lady Davis Fellow in the Department of Electrical Engineering and held visiting appointments in the Department of Electrical Engineering at Princeton University in New Jersey. Shlomo Shamai has research interests which encompasses a wide spectrum of topics in information theory and statistical communications.
- Published
- 2008
- Full Text
- View/download PDF
115. Improved Bounds on Lossless Source Coding and Guessing Moments via Rényi Measures.
- Author
-
Sason, Igal and Verdu, Sergio
- Subjects
CODING theory ,CRYPTOGRAPHY ,SEQUENTIAL decoding ,GAUSSIAN function ,STATISTICAL hypothesis testing - Abstract
This paper provides upper and lower bounds on the optimal guessing moments of a random variable taking values on a finite set when side information may be available. These moments quantify the number of guesses required for correctly identifying the unknown object and, similarly to Arikan’s bounds, they are expressed in terms of the Arimoto-Rényi conditional entropy. Although Arikan’s bounds are asymptotically tight, the improvement of the bounds in this paper is significant in the non-asymptotic regime. Relationships between moments of the optimal guessing function and the MAP error probability are also established, characterizing the exact locus of their attainable values. The bounds on optimal guessing moments serve to improve non-asymptotic bounds on the cumulant generating function of the codeword lengths for fixed-to-variable optimal lossless source coding without prefix constraints. Non-asymptotic bounds on the reliability function of discrete memoryless sources are derived as well. Relying on these techniques, lower bounds on the cumulant generating function of the codeword lengths are derived, by means of the smooth Rényi entropy, for source codes that allow decoding errors. [ABSTRACT FROM PUBLISHER]
- Published
- 2018
- Full Text
- View/download PDF
116. Learning Graphical Models From the Glauber Dynamics.
- Author
-
Bresler, Guy, Gamarnik, David, and Shah, Devavrat
- Subjects
GRAPHICAL modeling (Statistics) ,MARKOV random fields ,LEARNING modules ,ESTIMATION theory ,MATHEMATICAL variables ,ALGORITHMS - Abstract
In this paper, we consider the problem of learning undirected graphical models from data generated according to the Glauber dynamics (also known as the Gibbs sampler). The Glauber dynamics is a Markov chain that sequentially updates individual nodes (variables) in a graphical model and it is frequently used to sample from the stationary distribution (to which it converges given sufficient time). Additionally, the Glauber dynamics is a natural dynamical model in a variety of settings. This paper deviates from the standard formulation of graphical model learning in the literature, where one assumes access to independent identically distributed samples from the distribution. Much of the research on graphical model learning has been directed toward finding algorithms with low computational cost. As the main result of this paper, we establish that the problem of reconstructing binary pairwise graphical models is computationally tractable when we observe the Glauber dynamics. Specifically, we show that a binary pairwise graphical model on p nodes with maximum degree d can be learned in time f(d)p^2\log p , for a function f(d) defined explicitly in this paper, using nearly the information-theoretic minimum number of samples. [ABSTRACT FROM AUTHOR]
- Published
- 2018
- Full Text
- View/download PDF
117. IEEE Transactions on Information Theory information for authors.
- Subjects
INFORMATION theory ,TRANSACTION systems (Computer systems) - Abstract
The article presents information for authors interested submitting their manuscripts to be included in the "IEEE Transactions on Information Theory" journal, including the scope and limitations of the theoretical and experimental papers, the format for each paper and the Open Researcher and Contributor Identification (ORCID) requirement.
- Published
- 2020
- Full Text
- View/download PDF
118. IEEE Transactions on Information Theory information for authors.
- Subjects
IEEE 802 standard ,INFORMATION theory - Published
- 2022
- Full Text
- View/download PDF
119. On Infinite Families of Narrow-Sense Antiprimitive BCH Codes Admitting 3-Transitive Automorphism Groups and Their Consequences.
- Author
-
Liu, Qi, Ding, Cunsheng, Mesnager, Sihem, Tang, Chunming, and Tonchev, Vladimir D.
- Subjects
AUTOMORPHISM groups ,ALGEBRAIC coding theory ,REPRESENTATIONS of groups (Algebra) ,DATA transmission systems ,QUANTUM information science ,GROUP theory ,LINEAR codes ,CYCLIC codes - Abstract
The Bose-Chaudhuri-Hocquenghem (BCH) codes are a well-studied subclass of cyclic codes that have found numerous applications in error correction and notably in quantum information processing. They are widely used in data storage and communication systems. A subclass of attractive BCH codes is the narrow-sense BCH codes over the Galois field ${\mathrm {GF}}(q)$ with length $q+1$ , which are closely related to the action of the projective general linear group of degree two on the projective line. Despite its interest, not much is known about this class of BCH codes. This paper aims to study some of the codes within this class and specifically narrow-sense antiprimitive BCH codes (these codes are also linear complementary duals (LCD) codes that have interesting practical recent applications in cryptography, among other benefits). We shall use tools and combine arguments from algebraic coding theory, combinatorial designs, and group theory (group actions, representation theory of finite groups, etc.) to investigate narrow-sense antiprimitive BCH Codes and extend results from the recent literature. Notably, the dimension, the minimum distance of some $q$ -ary BCH codes with length $q+1$ , and their duals are determined in this paper. The dual codes of the narrow-sense antiprimitive BCH codes derived in this paper include almost MDS codes. Furthermore, the classification of ${\mathrm {PGL}}(2, p^{m})$ -invariant codes over ${\mathrm {GF}}(p^{h})$ is completed. As an application of this result, the $p$ -ranks of all incidence structures invariant under the projective general linear group ${\mathrm {PGL}}(2, p^{m})$ are determined. Furthermore, infinite families of narrow-sense BCH codes admitting a 3-transitive automorphism group are obtained. Via these BCH codes, a coding-theory approach to constructing the Witt spherical geometry designs is presented. The BCH codes proposed in this paper are good candidates for permutation decoding, as they have a relatively large group of automorphisms. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
120. Phase Transition Analysis for Covariance-Based Massive Random Access With Massive MIMO.
- Author
-
Chen, Zhilin, Sohrabi, Foad, Liu, Ya-Feng, and Yu, Wei
- Subjects
FISHER information ,PHASE transitions ,MAXIMUM likelihood statistics ,COVARIANCE matrices ,ERROR probability ,BEHAVIORAL assessment - Abstract
This paper considers a massive random access problem in which a large number of sporadically active devices wish to communicate with a base station (BS) equipped with massive multiple-input multiple-output (MIMO) antennas. Each device is preassigned a unique signature sequence, and the BS identifies the active devices by detecting which sequences are transmitted. This device activity detection problem can be formulated as a maximum likelihood estimation (MLE) problem for which the sample covariance matrix of the received signal is a sufficient statistic. The goal of this paper is to characterize the feasible set of problem parameters under which this covariance based approach is able to successfully recover the device activities in the massive MIMO regime. Through an analysis of the asymptotic behaviors of MLE via its associated Fisher information matrix, this paper derives a necessary and sufficient condition on the Fisher information matrix to ensure a vanishing probability of detection error as the number of antennas goes to infinity, based on which a numerical phase transition analysis is obtained. This condition is also examined from a perspective of covariance matching, which relates the phase transition analysis to a recently derived scaling law. Further, we provide a characterization of the distribution of the estimation error in MLE, based on which the error probabilities in device activity detection can be accurately predicted. Finally, this paper studies a random access scheme with joint device activity and data detection and analyzes its performance in a similar way. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
121. 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
- 2020
- Full Text
- View/download PDF
122. Fundamental Limits of Cloud and Cache-Aided Interference Management With Multi-Antenna Edge Nodes.
- Author
-
Zhang, Jingjing and Simeone, Osvaldo
- Subjects
SIGNAL-to-noise ratio ,EDGES (Geometry) ,WIRELESS channels - Abstract
In fog-aided cellular systems, content delivery latency can be minimized by jointly optimizing edge caching and transmission strategies. In order to account for the cache capacity limitations at the edge nodes (ENs), transmission generally involves both fronthaul transfer from a cloud processor with access to the content library to the ENs and wireless delivery from the ENs to the users. In this paper, the resulting problem is studied from an information-theoretic viewpoint by making the following practically relevant assumptions: 1) the ENs have multiple antennas; 2) only uncoded fractional caching is allowed; 3) the fronthaul links are used to send fractions of contents; and 4) the ENs are constrained to use one-shot linear zero-forcing precoding on the wireless channel. Assuming off-line proactive caching and focusing on a high signal-to-noise ratio (SNR) latency metric, the optimal information-theoretic performance is investigated under both serial and pipelined fronthaul-edge transmission modes. The analysis characterizes the minimum high-SNR latency in terms of normalized delivery time (NDT) for worst case users’ demands. The characterization is exact for a subset of system parameters and is generally optimal within a multiplicative factor of 3/2 for the serial case and 2 for the pipelined case. The results bring insights into the optimal interplay between edge and cloud processing in fog-aided wireless networks as a function of system resources, including the number of antennas at the ENs, the ENs’ cache capacity, and the fronthaul capacity. [ABSTRACT FROM AUTHOR]
- Published
- 2019
- Full Text
- View/download PDF
123. Blind Group Testing.
- Author
-
Huleihel, Wasim, Elishco, Ohad, and Medard, Muriel
- Subjects
ROBUST control ,NOISE measurement - Abstract
The main goal in group testing is to recover a small subset of defective items from a larger population while efficiently reducing the total number of (possibly noisy) required tests/measurements. Under the assumption that the input-output statistical relationship (i.e., channel law) is known to the recovery algorithm, the fundamental as well as the computational limits of the group testing problem are relatively better understood than when these statistical relationships are unknown. Practical considerations, however, render this assumption inapplicable, and “blind” recovery/estimation procedures, independent of the input-output statistics, are desired. In this paper, we analyze the fundamental limits of a general noisy group testing problem, when this relationship is unknown. Specifically, in the first part of this paper, we propose an efficient scheme, based on the idea of separate-decoding of items (where each item is recovered separately), for which we derive sufficient conditions on the number of tests required for exact recovery. The difficulty in obtaining these conditions stems from the fact that we allow the number of defective items to grow with the population size, which in turn requires delicate concentration analysis of certain probabilities. Furthermore, we show that in several scenarios, our proposed scheme achieves the same performance as that of the corresponding non-blind recovery algorithm (where the input-output statistics are known), implying that the proposed blind scheme is robust/universal. Finally, in the second part of this paper, we propose also an inefficient combinatorial-based scheme (or, “joint-decoding”), for which we derive similar sufficient conditions. [ABSTRACT FROM AUTHOR]
- Published
- 2019
- Full Text
- View/download PDF
124. Explicit Construction of Optimal Locally Recoverable Codes of Distance 5 and 6 via Binary Constant Weight Codes.
- Author
-
Jin, Lingfei
- Subjects
CIPHERS ,LINEAR codes ,CONSTRUCTION ,DISTANCES - Abstract
In a paper by Guruswami et al., it was shown that the length $n$ of a $q$ -ary linear locally recoverable code with distance $d \geqslant 5$ is upper bounded by $O(dq^{3})$. Thus, it is a challenging problem to construct $q$ -ary locally recoverable codes with distance $d \geqslant 5$ and length approaching the upper bound. The same paper also gave an algorithmic construction of $q$ -ary locally recoverable codes with locality $r$ and length $n=\Omega _{r}(q^{2})$ for $d=5$ and 6, where $\Omega _{r}$ means that the implicit constant depends on locality $r$. In this paper, we present an explicit construction of $q$ -ary locally recoverable codes of distance $d= 5$ and 6 via binary constant weight codes. It turns out that 1) our construction is simpler and more explicit and 2) the length of our codes is greater than previously known. [ABSTRACT FROM AUTHOR]
- Published
- 2019
- Full Text
- View/download PDF
125. Secret-Key Generation in Many-to-One Networks: An Integrated Game-Theoretic and Information-Theoretic Approach.
- Author
-
Chou, Remi A. and Yener, Aylin
- Subjects
RANDOM variables ,GENERATIONS ,PUBLIC communication ,GAME theory ,SELF-interest - Abstract
This paper considers secret-key generation between several agents and a base station that observe independent and identically distributed realizations of correlated random variables. Each agent wishes to generate the longest possible individual key with the base station by means of public communication. All keys must be jointly kept secret from all external entities. In this many-to-one secret-key generation setting, it can be shown that the agents can take advantage of a collective protocol to increase the sum rate of their generated keys. However, when each agent is only interested in maximizing its own secret-key rate, agents may be unwilling to participate in a collective protocol. Furthermore, when such a collective protocol is employed, how to fairly allocate individual key rates arises as a valid issue. This paper studies the tension between cooperation and self-interest with a game-theoretic treatment. This paper establishes that cooperation is in the best interest of all individualistic agents and that there exist individual secret-key rate allocations that incentivize the agents to follow the protocol. In addition, an explicit coding scheme that achieves such allocations is proposed. [ABSTRACT FROM AUTHOR]
- Published
- 2019
- Full Text
- View/download PDF
126. Wiretap Channels: Nonasymptotic Fundamental Limits.
- Author
-
Yang, Wei, Schaefer, Rafael F., and Poor, H. Vincent
- Subjects
WIRETAPPING ,GAUSSIAN channels ,INFORMATION-theoretic security ,ERROR probability ,SECRECY - Abstract
This paper investigates the maximal secret communication rate over a wiretap channel subject to reliability and secrecy constraints at a given blocklength. New achievability and converse bounds are derived, which are uniformly tighter than existing bounds, and lead to the tightest bounds on the second-order coding rate for discrete memoryless and Gaussian wiretap channels. The exact second-order coding rate is established for semi-deterministic wiretap channels, which characterizes the optimal tradeoff between reliability and secrecy in the finite-blocklength regime. Underlying our achievability bounds are two new privacy amplification results, which not only refine the classic privacy amplification results, but also achieve secrecy under the stronger semantic-security metric. [ABSTRACT FROM AUTHOR]
- Published
- 2019
- Full Text
- View/download PDF
127. On the Capacity of the Peak Power Constrained Vector Gaussian Channel: An Estimation Theoretic Perspective.
- Author
-
Dytso, Alex, Al, Mert, Poor, H. Vincent, and Shamai Shitz, Shlomo
- Subjects
CAPACITY management (Computers) ,GAUSSIAN channels ,HARMONIC functions ,STANDARD deviations ,ESTIMATION theory - Abstract
This paper studies the capacity of an $n$ -dimensional vector Gaussian noise channel subject to the constraint that an input must lie in the ball of radius $R$ centered at the origin. It is known that in this setting, the optimizing input distribution is supported on a finite number of concentric spheres. However, the number, the positions, and the probabilities of the spheres are generally unknown. This paper characterizes necessary and sufficient conditions on the constraint $R$ , such that the input distribution supported on a single sphere is optimal. The maximum $\bar {R}_{n}$ , such that using only a single sphere is optimal, is shown to be a solution of an integral equation. Moreover, it is shown that $\bar {R}_{n}$ scales as $\sqrt {n}$ and the exact limit of $\frac {\bar {R}_{n}}{\sqrt {n}}$ is found. [ABSTRACT FROM AUTHOR]
- Published
- 2019
- Full Text
- View/download PDF
128. The Repair Problem for Reed–Solomon Codes: Optimal Repair of Single and Multiple Erasures With Almost Optimal Node Size.
- Author
-
Tamo, Itzhak, Ye, Min, and Barg, Alexander
- Subjects
BANDWIDTHS ,ENCODING ,REED-Solomon codes ,DISTRIBUTED databases ,CODING theory - Abstract
The repair problem in distributed storage addresses recovery of the data encoded using an erasure code, for instance, a Reed–Solomon (RS) code. We consider the problem of repairing a single node or multiple nodes in RS-coded storage systems using the smallest possible amount of inter-nodal communication. According to the cut-set bound, communication cost of repairing $h\geqslant 1$ failed nodes for an $(n,k=n-r)$ maximum distance separable (MDS) code using $d$ helper nodes is at least $dhl/(d+h-k)$ , where $l$ is the size of the node. Guruswami and Wootters (2016) initiated the study of efficient repair of RS codes, showing that they can be repaired using a smaller bandwidth than under the trivial approach. At the same time, their work as well as follow-up papers stopped short of constructing RS codes (or any scalar MDS codes) that meet the cut-set bound with equality. In this paper, we construct the families of RS codes that achieve the cut-set bound for repair of one or several nodes. In the single-node case, we present the RS codes of length $n$ over the field ${\mathbb F}_{q^{l}}, l=\exp ((1+o(1))n\log n)$ that meet the cut-set bound. We also prove an almost matching lower bound on $l$ , showing that super-exponential scaling is both necessary and sufficient for scalar MDS codes to achieve the cut-set bound using linear repair schemes. For the case of multiple nodes, we construct a family of RS codes that achieve the cut-set bound universally for the repair of any $h=1,2, {\dots },r$ failed nodes from any subset of $d$ helper nodes, $k\leqslant d\leqslant n-h$. For a fixed number of parities $r$ , the node size of the constructed codes is close to the smallest possible node size for codes with such properties. [ABSTRACT FROM AUTHOR]
- Published
- 2019
- Full Text
- View/download PDF
129. Blind Gain and Phase Calibration via Sparse Spectral Methods.
- Author
-
Li, Yanjun, Lee, Kiryung, and Bresler, Yoram
- Subjects
ARRAY processing ,NOISE measurement ,SPARSE matrices ,SYNTHETIC aperture radar ,GREEDY algorithms - Abstract
Blind gain and phase calibration (BGPC) is a bilinear inverse problem involving the determination of unknown gains and phases of the sensing system, and the unknown signal, jointly. BGPC arises in numerous applications, e.g., blind albedo estimation in inverse rendering, synthetic aperture radar autofocus, and sensor array auto-calibration. In some cases, sparse structure in the unknown signal alleviates the ill-posedness of BGPC. Recently, there has been renewed interest in solutions to BGPC with careful analysis of error bounds. In this paper, we formulate BGPC as an eigenvalue/eigenvector problem and propose to solve it via power iteration, or in the sparsity or joint sparsity case, via truncated power iteration. Under certain assumptions, the unknown gains, phases, and the unknown signal can be recovered simultaneously. Numerical experiments show that power iteration algorithms work not only in the regime predicted by our main results, but also in regimes where theoretical analysis is limited. We also show that our power iteration algorithms for BGPC compare favorably with competing algorithms in adversarial conditions, e.g., with noisy measurement or with a bad initial estimate. [ABSTRACT FROM AUTHOR]
- Published
- 2019
- Full Text
- View/download PDF
130. Message Transmission Over Classical Quantum Channels With a Jammer With Side Information: Message Transmission Capacity and Resources.
- Author
-
Boche, Holger, Cai, Minglai, and Cai, Ning
- Subjects
QUANTUM information theory ,RADAR interference ,HILBERT space ,QUANTUM communication ,ENCODING ,RANDOM variables - Abstract
In this paper, a new model for arbitrarily varying classical-quantum channels is proposed. In this model, a jammer has side information. The communication scenario in which a jammer can select only classical inputs as a jamming sequence is considered in the first part of the paper. This situation corresponds to the standard model of arbitrarily varying classical-quantum channels. Two scenarios are considered. In the first scenario, the jammer knows the channel input, while in the second scenario the jammer knows both the channel input and the message. The transmitter and receiver share a secret random key with a vanishing key rate. The capacity for both average and maximum error criteria for both scenarios is determined in this paper. A strong converse is also proved. It is shown that all these corresponding capacities are equal, which means that additionally revealing the message to the jammer does not change the capacity. The communication scenario with a fully quantum jammer is considered in the second part of the paper. A single letter characterization for the capacity with secret random key as assistance for both average and maximum error criteria is derived in the paper. [ABSTRACT FROM AUTHOR]
- Published
- 2019
- Full Text
- View/download PDF
131. Network Estimation From Point Process Data.
- Author
-
Mark, Benjamin, Raskutti, Garvesh, and Willett, Rebecca
- Subjects
BIOLOGICAL neural networks ,NEURONS ,TIME series analysis ,POINT processes ,SPARSE matrices - Abstract
Consider observing a collection of discrete events within a network that reflect how network nodes influence one another. Such data are common in spike trains recorded from biological neural networks, interactions within a social network, and a variety of other settings. Data of this form may be modeled as self-exciting point processes, in which the likelihood of future events depends on the past events. This paper addresses the problem of estimating self-excitation parameters and inferring the underlying functional network structure from self-exciting point process data. Past work in this area was limited by strong assumptions which are addressed by the novel approach here. Specifically, in this paper we 1) incorporate saturation in a point process model which both ensures stability and models non-linear thresholding effects; 2) impose general low-dimensional structural assumptions that include sparsity, group sparsity, and low-rankness that allows bounds to be developed in the high-dimensional setting; and 3) incorporate long-range memory effects through moving average and higher-order auto-regressive components. Using our general framework, we provide a number of novel theoretical guarantees for high-dimensional self-exciting point processes that reflect the role played by the underlying network structure and long-term memory. We also provide simulations and real data examples to support our methodology and main results. [ABSTRACT FROM AUTHOR]
- Published
- 2019
- Full Text
- View/download PDF
132. Factorizations of Binomial Polynomials and Enumerations of LCD and Self-Dual Constacyclic Codes.
- Author
-
Wu, Yansheng and Yue, Qin
- Subjects
FACTORIZATION ,BINOMIAL equations ,LINEAR codes ,POLYNOMIALS ,MATHEMATICS theorems - Abstract
Constacyclic codes are well-known generalizations of cyclic and negacyclic codes. Due to their rich algebraic structure, constacyclic codes are used to construct quantum codes and symbol-pair codes. Let ${\mathbb {F}}_{q}$ be a finite field with order $q$ , where $q$ is a positive power of a prime $p$. Suppose that $n$ is a positive integer and the product of distinct prime factors of $n$ divides $q-1$ , i.e., $rad(n)\mid (q-1)$. In this paper, we explicitly factorize the polynomial $x^{n}-\lambda $ for each $\lambda \in {\mathbb {F}}_{q}^{*}$. As applications, first, we obtain all repeated-root $\lambda $ -constacyclic codes and their dual codes of length $np^{s}$ over ${\mathbb {F}}_{q}$ ; second, we determine all simple-root LCD cyclic codes and LCD negacyclic codes of length $n$ over ${\mathbb {F}}_{q}$ ; third, we list all self-dual repeated-root negacyclic codes of length $np^{s}$ over ${\mathbb {F}}_{q}$. In contrast to known results, the lengths of constacyclic codes in this paper have more flexible parameters. [ABSTRACT FROM AUTHOR]
- Published
- 2019
- Full Text
- View/download PDF
133. Nearly Optimal Constructions of PIR and Batch Codes.
- Author
-
Asi, Hilal and Yaakobi, Eitan
- Subjects
ERROR-correcting codes ,INFORMATION retrieval ,MATHEMATICS theorems ,NUMERICAL analysis ,CODING theory - Abstract
In this paper, we study two families of codes with availability, namely, private information retrieval (PIR) codes and batch codes. While the former requires that every information symbol has $k$ mutually disjoint recovering sets, the latter imposes this property for each multiset request of $k$ information symbols. The main problem under this paradigm is to minimize the number of redundancy symbols. We denote this value by $r_{P}(n,k)$ and $r_{B}(n,k)$ , for PIR codes and batch codes, respectively, where $n$ is the number of information symbols. Previous results showed that for any constant $k$ , $r_{P}(n,k) = \Theta (\sqrt {n})$ and $r_{B}(n,k)= {\mathcal{ O}}(\sqrt {n}\log (n))$. In this paper, we study the asymptotic behavior of these codes for non-constant $k$ and specifically for $k=\Theta (n^\epsilon)$. We also study the largest value of $k$ such that the rate of the codes approaches 1 and show that for all $\epsilon < 1$ , $r_{P}(n,n^\epsilon) = o(n)$ and $r_{B}(n,n^\epsilon) = o(n)$. Furthermore, several more results are proved for the case of fixed $k$. [ABSTRACT FROM AUTHOR]
- Published
- 2019
- Full Text
- View/download PDF
134. Game of Duels: Information-Theoretic Axiomatization of Scoring Rules.
- Author
-
Cvitanic, Jaksa, Prelec, Drazen, Radas, Sonja, and Sikic, Hrvoje
- Subjects
BAYESIAN analysis ,AXIOMS ,INFORMATION theory ,PEERS ,RESPONDENTS - Abstract
This paper aims to develop the insights into Bayesian truth serum (BTS) mechanism by postulating a sequence of seven natural conditions reminiscent of axioms in information theory. The condition that reduces a larger family of mechanisms to BTS is additivity, akin to the axiomatic development of entropy. The seven conditions identify BTS as the unique scoring rule for ranking respondents in situations in which respondents are asked to choose an alternative from a finite set and provide predictions of their peers’ propensities to choose, for finite or infinite sets of respondents. [ABSTRACT FROM AUTHOR]
- Published
- 2019
- Full Text
- View/download PDF
135. Calculating the Hilbert Transform on Spaces With Energy Concentration: Convergence and Divergence Regions.
- Author
-
Boche, Holger and Pohl, Volker
- Subjects
HILBERT transform ,BEHAVIOR ,ENERGY conservation ,ALGORITHMS ,SIGNALS & signaling - Abstract
In many different applications, it is important to determine the Hilbert transform of a given function. However, it is generally impossible to calculate it in closed form. Therefore Hilbert transform approximations are used. This paper studies the convergence and divergence behavior of general classes of such approximation methods. These classes are characterized by two very natural axioms and they include basically all known traditional numerical algorithms. The convergence of these methods is investigated on a family of signal spaces of continuous functions with finite energy. These spaces are parametrized by a number which measures the energy concentration in the low frequency components of the signal. It is shown that stable methods only exist on signal spaces with a sufficient energy concentration and this paper gives some explicit examples of convergent methods. On all other spaces in the family of signal spaces, every sampling-based Hilbert transform approximation shows a blowup behavior of its peak value, i.e., on these spaces, every sampling-based Hilbert transform approximation diverges. [ABSTRACT FROM AUTHOR]
- Published
- 2019
- Full Text
- View/download PDF
136. A Joint Typicality Approach to Compute–Forward.
- Author
-
Lim, Sung Hoon, Feng, Chen, Pastore, Adriano, Nazer, Bobak, and Gastpar, Michael
- Subjects
INFORMATION technology ,TELEMATICS ,DATA transmission systems ,DIGITAL communications ,ELECTRONIC systems ,INFORMATION theory ,SIGNAL processing - Abstract
This paper presents a joint typicality framework for encoding and decoding nested linear codes in multi-user networks. This framework provides a new perspective on compute–forward within the context of discrete memoryless networks. In particular, it establishes an achievable rate region for computing a linear combination over a discrete memoryless multiple-access channel (MAC). When specialized to the Gaussian MAC, this rate region recovers and improves upon the lattice-based compute–forward rate region of Nazer and Gastpar, thus providing a unified approach for discrete memoryless and Gaussian networks. Furthermore, our framework provides some valuable insights on establishing the optimal decoding rate region for compute–forward by considering joint decoders, progressing beyond most previous works that consider successive cancellation decoding. Specifically, this paper establishes an achievable rate region for simultaneously decoding two linear combinations of nested linear codewords from $K$ senders. [ABSTRACT FROM AUTHOR]
- Published
- 2018
- Full Text
- View/download PDF
137. Simultaneous Partial Inverses and Decoding Interleaved Reed–Solomon Codes.
- Author
-
Yu, Jiun-Hung and Loeliger, Hans-Andrea
- Subjects
CODING theory ,DATA compression ,DIGITAL electronics ,INFORMATION theory ,MACHINE theory ,SIGNAL theory - Abstract
This paper introduces the simultaneous partial-inverse problem (SPI) for polynomials and develops its application to decoding interleaved Reed–Solomon codes beyond half the minimum distance. While closely related both to standard key equations and to well-known Padé approximation problems, the SPI problem stands out in several respects. First, the SPI problem has a unique solution (up to a scale factor), which satisfies a natural degree bound. Second, the SPI problem can be transformed (monomialized) into an equivalent SPI problem where all moduli are monomials. Third, the SPI problem can be solved by an efficient algorithm of the Berlekamp–Massey type. Fourth, decoding interleaved Reed–Solomon codes (or subfield-evaluation codes) beyond half the minimum distance can be analyzed in terms of a partial-inverse condition for the error pattern: if that condition is satisfied, then the (true) error locator polynomial is the unique solution of a standard key equation and can be computed in many different ways, including the well-known multi-sequence Berlekamp–Massey algorithm and the SPI algorithm of this paper. Two of the best performance bounds from the literature (the Schmidt–Sidorenko–Bossert bound and the Roth–Vontobel bound) are generalized to hold for the partial-inverse condition and thus to apply to several different decoding algorithms. [ABSTRACT FROM AUTHOR]
- Published
- 2018
- Full Text
- View/download PDF
138. State-Dependent Gaussian Multiple Access Channels: New Outer Bounds and Capacity Results.
- Author
-
Yang, Wei, Liang, Yingbin, Shamai Shitz, Shlomo, and Poor, H. Vincent
- Subjects
GAUSSIAN measures ,DATA transmission systems ,GAUSSIAN processes ,SIGNAL processing ,MEASURE theory ,COMPUTER security - Abstract
This paper studies a two-user state-dependent Gaussian multiple-access channel (MAC) with state noncausally known at one encoder. Two scenarios are considered: 1) each user wishes to communicate an independent message to the common receiver; and 2) the two encoders send a common message to the receiver and the non-cognitive encoder (i.e., the encoder that does not know the state) sends an independent individual message (this model is also known as the MAC with degraded message sets). For both scenarios, new outer bounds on the capacity region are derived, which improve uniformly over the best known outer bounds. In the first scenario, the two corner points of the capacity region as well as the sum rate capacity are established, and it is shown that a single-letter solution is adequate to achieve both the corner points and the sum rate capacity. Furthermore, the full capacity region is characterized in situations in which the sum rate capacity is equal to the capacity of the helper problem. The proof exploits the optimal-transportation idea of Polyanskiy and Wu (which was used previously to establish an outer bound on the capacity region of the interference channel) and the worst case Gaussian noise result for the case in which the input and the noise are dependent. [ABSTRACT FROM AUTHOR]
- Published
- 2018
- Full Text
- View/download PDF
139. A Factor-Graph Approach to Algebraic Topology, With Applications to Kramers–Wannier Duality.
- Author
-
Al-Bashabsheh, Ali and Vontobel, Pascal O.
- Subjects
TOPOLOGY ,MATHEMATICS ,MATHEMATICAL analysis ,GRAPH theory ,COMPUTER science ,COMPUTER engineering - Abstract
Algebraic topology studies topological spaces with the help of tools from abstract algebra. The main focus of this paper is to show that many concepts from algebraic topology can be conveniently expressed in terms of (normal) factor graphs. As an application, we give an alternative proof of a classical duality result of Kramers and Wannier, which expresses the partition function of the 2-D Ising model at a low temperature in terms of the partition function of the 2-D Ising model at a high temperature. Moreover, we discuss analogous results for the 3-D Ising model and the Potts model. [ABSTRACT FROM AUTHOR]
- Published
- 2018
- Full Text
- View/download PDF
140. Forest Learning From Data and its Universal Coding.
- Author
-
Suzuki, Joe
- Subjects
GRAPHICAL modeling (Statistics) ,ACCESS to information ,SIGNAL processing ,CODING theory ,PROBABILITY theory - Abstract
This paper considers structure learning from data with $n$ samples of $p$ variables, assuming that the structure is a forest, using the Chow–Liu algorithm. Specifically, for incomplete data, we construct two model selection algorithms that complete in $O(p^{2})$ steps: one obtains a forest with the maximum posterior probability given the data and the other obtains a forest that converges to the true one as $n$ increases. We show that the two forests are generally different when some values are missing. In addition, we present estimations for benchmark data sets to demonstrate that both algorithms work in realistic situations. Moreover, we derive the conditional entropy provided that no value is missing, and we evaluate the per-sample expected redundancy for the universal coding of incomplete data in terms of the number of non-missing samples. [ABSTRACT FROM AUTHOR]
- Published
- 2018
- Full Text
- View/download PDF
141. Finite Sample Analysis of Approximate Message Passing Algorithms.
- Author
-
Rush, Cynthia and Venkataramanan, Ramji
- Subjects
MESSAGE passing (Computer science) ,COMPRESSED sensing ,ASYMPTOTIC efficiencies ,LARGE deviations (Mathematics) ,GAUSSIAN processes - Abstract
Approximate message passing (AMP) refers to a class of efficient algorithms for statistical estimation in high-dimensional problems such as compressed sensing and low-rank matrix estimation. This paper analyzes the performance of AMP in the regime where the problem dimension is large but finite. For concreteness, we consider the setting of high-dimensional regression, where the goal is to estimate a high-dimensional vector $\beta _{0}$ from a noisy measurement $y=A \beta _{0} + w$. AMP is a low-complexity, scalable algorithm for this problem. Under suitable assumptions on the measurement matrix $A$ , AMP has the attractive feature that its performance can be accurately characterized in the large system limit by a simple scalar iteration called state evolution. Previous proofs of the validity of state evolution have all been asymptotic convergence results. In this paper, we derive a concentration inequality for AMP with Gaussian matrices with independent and identically distributed (i.i.d.) entries and finite dimension $n \times N$. The result shows that the probability of deviation from the state evolution prediction falls exponentially in $n$. This provides theoretical support for empirical findings that have demonstrated excellent agreement of AMP performance with state evolution predictions for moderately large dimensions. The concentration inequality also indicates that the number of AMP iterations $t$ can grow no faster than order $({\log n}/{\log \log n})$ for the performance to be close to the state evolution predictions with high probability. The analysis can be extended to obtain similar non-asymptotic results for AMP in other settings such as low-rank matrix estimation. [ABSTRACT FROM AUTHOR]
- Published
- 2018
- Full Text
- View/download PDF
142. On Zero-Error Capacity of Binary Channels With One Memory.
- Author
-
Cao, Qi, Cai, Ning, Guo, Wangmei, and Yeung, Raymond W.
- Subjects
INFORMATION theory ,ERROR correction (Information theory) ,FINITE state machines ,BINARY codes ,MATHEMATICAL bounds - Abstract
The zero-error capacity of a channel is defined as the maximum rate at which it is possible to transmit information with zero probability of error. In this paper, we settle all previously unsolved cases for the zero-error capacity of binary channels with one memory. [ABSTRACT FROM AUTHOR]
- Published
- 2018
- Full Text
- View/download PDF
143. Beta–Beta Bounds: Finite-Blocklength Analog of the Golden Formula.
- Author
-
Yang, Wei, Collins, Austin, Durisi, Giuseppe, Polyanskiy, Yury, and Poor, H. Vincent
- Subjects
MATHEMATICAL bounds ,CHANNEL coding ,NEYMAN-Pearson theorem ,RAYLEIGH fading channels ,STATISTICAL hypothesis testing - Abstract
It is well known that the mutual information between two random variables can be expressed as the difference of two relative entropies that depend on an auxiliary distribution, a relation sometimes referred to as the golden formula. This paper is concerned with a finite-blocklength extension of this relation. This extension consists of two elements: 1) a finite-blocklength channel-coding converse bound by Polyanskiy and Verdú, which involves the ratio of two Neyman–Pearson $\beta $ functions (beta–beta converse bound); and 2) a novel beta–beta channel-coding achievability bound, expressed again as the ratio of two Neyman–Pearson $\beta $ functions. To demonstrate the usefulness of this finite-blocklength extension of the golden formula, the beta–beta achievability and converse bounds are used to obtain a finite-blocklength extension of Verdú’s wideband-slope approximation. The proof parallels the derivation of the latter, with the beta–beta bounds used in place of the golden formula. The beta–beta (achievability) bound is also shown to be useful in cases where the capacity-achieving output distribution is not a product distribution due to, e.g., a cost constraint or structural constraints on the codebook, such as orthogonality or constant composition. As an example, the bound is used to characterize the channel dispersion of the additive exponential-noise channel and to obtain a finite-blocklength achievability bound (the tightest to date) for multiple-input multiple-output Rayleigh-fading channels with perfect channel state information at the receiver. [ABSTRACT FROM AUTHOR]
- Published
- 2018
- Full Text
- View/download PDF
144. 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
- 2020
- Full Text
- View/download PDF
145. IEEE Transactions on Information Theory information for authors.
- Subjects
INFORMATION theory ,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
- 2020
- Full Text
- View/download PDF
146. IEEE Transactions on Information Theory information for authors.
- Subjects
INFORMATION theory - Published
- 2022
- Full Text
- View/download PDF
147. 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
148. Comments on “New Inner and Outer Bounds for the Memoryless Cognitive Interference Channel and Some New Capacity Results”.
- Author
-
Vaezi, Mojtaba
- Subjects
- *
PAPER arts , *MEMORYLESS systems , *DECODERS & decoding , *CAPACITY management (Computers) , *CHANNEL coding - Abstract
In a recent paper [1], Rini et al. proved a capacity result for the discrete memoryless cognitive interference channel, under the condition named “better cognitive decoding.” We show that this capacity region is the same as the capacity region characterized by Wu et al. in [2]. [ABSTRACT FROM PUBLISHER]
- Published
- 2013
- Full Text
- View/download PDF
149. Vanishing Flats: A Combinatorial Viewpoint on the Planarity of Functions and Their Application.
- Author
-
Li, Shuxing, Meidl, Wilfried, Polujan, Alexandr, Pott, Alexander, Riera, Constanza, and Stanica, Pantelimon
- Subjects
VECTOR spaces ,NONLINEAR functions ,UNIFORMITY ,FINITE fields ,POLYNOMIALS - Abstract
For a function $f$ from $\mathbb {F}_{2}^{n}$ to $\mathbb {F}_{2}^{n}$ , the planarity of $f$ is usually measured by its differential uniformity and differential spectrum. In this paper, we propose the concept of vanishing flats, which supplies a combinatorial viewpoint on the planarity. First, the number of vanishing flats of $f$ can be regarded as a measure of the distance between $f$ and the set of almost perfect nonlinear functions. In some cases, the number of vanishing flats serves as an “intermediate” concept between differential uniformity and differential spectrum, which contains more information than differential uniformity, however less than the differential spectrum. Secondly, the set of vanishing flats forms a combinatorial configuration called partial quadruple system, since it conveys a detailed structural information about $f$. We initiate this study by considering the number of vanishing flats and the partial quadruple systems associated with monomials and Dembowski-Ostrom polynomials. In addition, we present an application of vanishing flats to the partition of a vector space into disjoint equidimensional affine spaces. We conclude the paper with several further questions and challenges. [ABSTRACT FROM AUTHOR]
- Published
- 2020
- Full Text
- View/download PDF
150. 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
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.