搜索结果: 1-5 共查到“信息论 Complexity”相关记录5条 . 查询时间(0.18 秒)
Conditional Kolmogorov Complexity and Universal Probability
Conditional Kolmogorov Complexity Universal Probability Information Theory
2012/6/21
The conditional in conditional Kolmogorov complexity commonly is taken to be a finite binary string. The Coding Theorem of L.A. Levin connects unconditional prefix Kolmogorov complexity with the discr...
An Adaptive Conditional Zero-Forcing Decoder with Full-diversity, Least Complexity and Essentially-ML Performance for STBCs
Adaptive Conditional Zero-Forcing Decoder Full-diversity Essentially-ML Performance STBCs
2012/5/24
A low complexity, essentially-ML decoding technique for the Golden code and the 3 antenna Perfect code was introduced by Sirianunpiboon, Howard and Calderbank. Though no theoretical analysis of the de...
Achieving a vanishing SNR-gap to exact lattice decoding at a subexponential complexity
SNR-gap subexponential complexity Information Theory
2011/9/15
Abstract: The work identifies the first lattice decoding solution that achieves, in the general outage-limited MIMO setting and in the high-rate and high-SNR limit, both a vanishing gap to the error-p...
Linear Complexity Lossy Compressor for Binary Redundant Memoryless Sources
nonlinear function LDGM codes lossy compression replica method
2011/8/30
Abstract: A lossy compression algorithm for binary redundant memoryless sources is presented. The proposed scheme is based on sparse graph codes. By introducing a nonlinear function, redundant memoryl...
The entropy functional, the information path functional's essentials and their connections to Kolmogorov's entropy, complexity and physics
Additive functional Entropy Singularities Natural Border Problem Invariant
2011/8/31
Abstract: The paper introduces the recent results related to an entropy functional on trajectories of a controlled diffusion process, and the information path functional (IPF), analyzing their connect...