搜索结果: 91-105 共查到“知识库 信息论”相关记录312条 . 查询时间(2.343 秒)
Multilevel polarization for nonbinary codes and parallel channels
Polar codes nonbinary channels parallel channels
2011/9/20
Abstract: We study polarization for nonbinary channels with input alphabet of size q=2^r,r=2,3,... Using Arikan's successive cancellation decoding, we prove that the virtual channels that arise in the...
An iterative feature selection method for GRNs inference by exploring topological properties
SFS SFFS feature selection reverse-engineering gene networks inference systems biology bioinformatics
2011/10/9
Abstract: An important problem in bioinformatics is the inference of gene regulatory networks (GRN) from temporal expression profiles. In general, the main limitations faced by GRN inference methods i...
Threshold Improvement of Low-Density Lattice Codes via Spatial Coupling
Low-Density Lattice Codes Spatial Coupling Information Theory
2011/9/20
Abstract: Spatially-coupled low-density lattice codes (LDLC) are constructed using protographs. Using Monte Carlo density evolution using single-Gaussian messages, we observe that the threshold of the...
Optimal Selective Feedback Policies for Opportunistic Beamforming
Opportunistic beamforming vector broadcast channels selective feedback sum-rate majorization
2011/9/20
Abstract: This paper studies the structure of downlink sum-rate maximizing selective decentralized feedback policies for opportunistic beamforming under finite feedback constraints on the average numb...
On Krawtchouk Transforms
Krawtchouk Transforms Information Theory Classical Analysis and ODEs
2011/8/31
Abstract: Krawtchouk polynomials appear in a variety of contexts, most notably as orthogonal polynomials and in coding theory via the Krawtchouk transform. We present an operator calculus formulation ...
An Achievable Region for a General Multi-terminal Network and its Chain Graph Representation
General Multi-terminal Network Achievable Region Information Theory
2011/9/19
Abstract: Random coding, along with various standard techniques such as coded time-sharing, superposition coding, ratesplitting and binning, are traditionally used in obtaining achievable rate regions...
On the Achievability of Interference Alignment for Three-Cell Multi-User MIMO Cellular Networks
Interference channel interference alignment degrees of freedom Multi-User MIMO
2011/9/19
Abstract: An interference alignment (IA) based scheme is proposed by joint design of transmit precoding matrices and receive beamforming matrices for the three-cell Multi-User MIMO (MU-MIMO) cellular ...
Abstract: We describe a novel extension of subspace codes for noncoherent networks, suitable for use when the network is viewed as a communication system that introduces both dimension and symbol erro...
Efficient variational inference in large-scale Bayesian compressed sensing
large-scale Bayesian variational inference Computer Vision and Pattern Recognition
2011/10/9
Abstract: We study linear models under heavy-tailed priors from a probabilistic viewpoint. Instead of computing a single sparse most probable (MAP) solution as in standard deterministic approaches, th...
Non-adaptive probabilistic group testing with noisy measurements: Near-optimal bounds with efficient algorithms
Non-adaptive probabilistic group noisy measurements Near-optimal bounds efficient algorithms
2011/9/19
Abstract: We consider the problem of detecting a small subset of defective items from a large set via non-adaptive "random pooling" group tests. We consider both the case when the measurements are noi...
Abstract: This note presents some new information on how the minimum distance of the generalized toric code corresponding to a fixed set of integer lattice points S in R^2 varies with the base field. ...
Short Huffman Codes Producing 1s Half of the Time
Short Huffman Codes Producing 1s Half the Time Information Theory
2011/9/19
Abstract: The design of the channel part of a digital communication system (e.g., error correction, modulation) is heavily based on the assumption that the data to be transmitted forms a fair bit stre...
Effective Capacity of Two-Hop Wireless Communication Systems
Two-hop wireless links fading channels effective capacity quality of service (QoS) constraints buffer violation probability
2011/9/16
Abstract: A two-hop wireless communication link in which a source sends data to a destination with the aid of an intermediate relay node is studied. It is assumed that there is no direct link between ...
A computability challenge: asymptotic bounds and isolated error-correcting codes
asymptotic bounds isolated error-correcting codes Information Theory
2011/9/16
Abstract: Consider the set of all error--correcting block codes over a fixed alphabet with $q$ letters. It determines a recursively enumerable set of points in the unit square with coordinates $(R,\de...
Interference minimization in physical model of wireless networks
interference wireless networks graph connectivity set cover randomized rounding
2011/10/9
Abstract: Interference minimization problem in wireless sensor and ad-hoc networks is considered. That is to assign a transmission power to each node of a network such that the network is connected an...