搜索结果: 1-15 共查到“信息科学与系统科学 Decoding”相关记录15条 . 查询时间(0.062 秒)
We describe a successive-cancellation \emph{list} decoder for polar codes, which is a generalization of the classic successive-cancellation decoder of Ar{\i}kan. In the proposed list decoder, up to $L...
An open question about Gabidulin codes is whether polynomial-time list decoding beyond half the minimum distance is possible or not. In this contribution, we give a lower and an upper bound on the lis...
Decomposition Methods for Large Scale LP Decoding
LP Decoding Alternating Direction Method of Multipliers Information Theory
2012/4/18
When binary linear error-correcting codes are used over symmetric channels, a relaxed version of the maximum likelihood decoding problem can be stated as a linear program (LP). This LP decoder can be ...
Unique Decoding of Plane AG Codes Revisited
Unique Decoding Plane AG Codes Revisited Information Theory
2012/4/17
We reformulate a recently introduced interpolation-based unique decoding algorithm of algebraic geometry codes using the theory of Gr\"obner bases of modules on the coordinate ring of the base curve. ...
Approaching Capacity at High-Rates with Iterative Hard-Decision Decoding
Approaching Capacity High-Rates Iterative Hard-Decision Decoding
2012/2/29
A variety of low-density parity-check (LDPC) ensembles have now been observed to approach capacity with message-passing decoding. However, all of them use soft (i.e., non-binary) messages and a poster...
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...
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...
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...
Mathematical Programming Decoding of Binary Linear Codes: Theory and Algorithm
Integer programming LP decoding Mathematical programming ML decoding Polyhedral theory
2011/9/14
Abstract: Mathematical programming is a branch of applied mathematics and has recently been used to derive new decoding approaches, challenging established but often heuristic algorithms based on iter...
Convergence of Weighted Min-Sum Decoding Via Dynamic Programming on Trees
belief propagation max product min sum LDPC codes linear programming decoding
2011/9/9
Abstract: Applying the max-product (and belief-propagation) algorithms to loopy graphs is now quite popular for best assignment problems. This is largely due to their low computational complexity and ...
Abstract: Low density parity-check (LDPC) codes are a class of linear block codes that are decoded by running belief propagation (BP) algorithm or log-likelihood ratio belief propagation (LLR-BP) over...
Abstract: We present a new combinatorial characterization for local-optimality of a codeword in irregular Tanner codes. This characterization is a generalization of [Arora, Daskalakis, Steurer; 2009] ...
Nearest Neighbour Decoding with Pilot-Assisted Channel Estimation for Fading Multiple-Access Channels
Pilot-Assisted Channel Estimation Fading Multiple-Access Channels Information Theory
2011/8/30
Abstract: We study a noncoherent multiple-input multiple-output (MIMO) fading multiple-access channel (MAC), where the transmitters and the receiver are aware of the statistics of the fading, but not ...
Decoding of Matrix-Product Codes
Linear Codes Matrix-Product Codes Decoding Algorithm Minimum Distance
2011/8/30
Abstract: We propose a decoding algorithm for the $(u\mid u+v)$-construction that decodes up to half of the minimum distance of the linear code. We extend this algorithm for a class of matrix-product ...
Beamforming on the MISO interference channel with multi-user decoding capability
the MISO interference channel multi-user decoding capability Information Theory
2011/8/23
Abstract: This paper considers the multiple-input-single-output interference channel (MISO-IC) with interference decoding capability (IDC), so that the interference signal can be decoded and subtracte...