搜索结果: 76-90 共查到“知识库 信息论”相关记录312条 . 查询时间(1.73 秒)
Combinatorial limitations of a strong form of list decoding
Combinatorial limitations strong form of list decoding combinatorics
2012/2/29
We prove the following results concerning the combinatorics of list decoding, motivated by the exponential gap between the known upper bound (of $O(1/\gamma)$) and lower bound (of $\Omega_p(\log (1/\g...
Explicit Bounds for Entropy Concentration under Linear Constraints
maximum entropy concentration bounds linear constraints tolerances
2011/9/23
Abstract: Consider the construction of an object composed of $m$ parts by distributing $n$ units to those parts. For example, say we are assigning $n$ balls to $m$ boxes. Each assignment results in a ...
Minimax-Optimal Bounds for Detectors Based on Estimated Prior Probabilities
Minimax-optimal bounds detector prior probability maximum likelihood estimate statistical learning theory
2011/9/29
Abstract: In many signal detection and classification problems, we have knowledge of the distribution under each hypothesis, but not the prior probabilities. This paper is aimed at providing theory to...
Computing a Function of Correlated Sources
Function of Correlated Sources Information Theory
2011/9/22
Abstract: A receiver wants to compute a function f of two correlated sources X and Y and side information Z. What is the minimum number of bits that needs to be communicated by each transmitter? In th...
Codes as fractals and noncommutative spaces
noncommutative spaces Codes Information Theory
2011/9/22
Abstract: We consider the CSS algorithm relating self-orthogonal classical linear codes to q-ary quantum stabilizer codes and we show that to such a pair of a classical and a quantum code one can asso...
On the Role of Diversity in Sparsity Estimation
Role of Diversity Sparsity Estimation Information Theory
2011/9/22
Abstract: A major challenge in sparsity pattern estimation is that small modes are difficult to detect in the presence of noise. This problem is alleviated if one can observe samples from multiple rea...
Perfect Codes for Uniform Chains Poset Metrics
Disjoint uniform chains perfect codes poset codes
2011/9/22
Abstract: The class of poset metrics is very large and contains some interesting families of metrics. A family of metrics, based on posets which are formed from disjoint chains which have the same siz...
Minimization of Storage Cost in Distributed Storage Systems with Repair Consideration
Minimization of Storage Cost Repair Consideration Information Theory
2011/9/22
Abstract: In a distributed storage system, the storage costs of different storage nodes, in general, can be different. How to store a file in a given set of storage nodes so as to minimize the total s...
Universal Prediction of Selected Bits
Sequence prediction Solomonoff induction online classification discriminative learning algorithmic information theory
2011/10/9
Abstract: Many learning tasks can be viewed as sequence prediction problems. For example, online classification can be converted to sequence prediction with the sequence being pairs of input/target da...
Closed Form Secrecy Capacity of MIMO Wiretap Channels with Two Transmit Antennas
Secrecy capacity MIMO wiretap channel physical layer security
2011/9/22
Abstract: A Gaussian multiple-input multiple-output (MIMO) wiretap channel model is considered. The input is a two-antenna transmitter, while the outputs are the legitimate receiver and an eavesdroppe...
An Algebraic Approach for Decoding Spread Codes
Algebraic Approach Spread Codes Information Theory
2011/9/22
Abstract: We present a family of constant-dimension codes for random linear network coding called spread codes. This is a family of optimal codes with maximum minimum distance. A spread code is constr...
Abstract: In this paper, we study polar codes from a practical point of view. In particular, we study concatenated polar codes and rate-compatible polar codes. First, we propose a concatenation scheme...
Information-theoretically Secure Regenerating Codes for Distributed Storage
Information-theoretically Secure Regenerating Codes Distributed Storage
2011/9/21
Abstract: Regenerating codes are a class of codes for distributed storage networks that provide reliability and availability of data, and also perform efficient node repair. Another important aspect o...
Sparse approximation property and stable recovery of sparse signals from noisy measurements
Sparse approximation property noisy measurements Information Theory
2011/9/21
Abstract: In this paper, we introduce a sparse approximation property of order $s$ for a measurement matrix ${\bf A}$: $$\|{\bf x}_s\|_2\le D \|{\bf A}{\bf x}\|_2+ \beta \frac{\sigma_s({\bf x})}{\sqrt...
Achievable Secrecy Sum-Rate in a Fading MAC-WT with Power Control and without CSI of Eavesdropper
Channel state information Cooperative jamming Fading Channel Multiple Access Channel Secrecy sumrate
2011/9/21
Abstract: We consider a two user fading Multiple Access Channel with a wire-tapper (MAC-WT) where the transmitter has the channel state information (CSI) to the intended receiver but not to the eavesd...