Results 1  10
of
792
Cooperative strategies and capacity theorems for relay networks
 IEEE TRANS. INFORM. THEORY
, 2005
"... Coding strategies that exploit node cooperation are developed for relay networks. Two basic schemes are studied: the relays decodeandforward the source message to the destination, or they compressandforward their channel outputs to the destination. The decodeandforward scheme is a variant of ..."
Abstract

Cited by 739 (19 self)
 Add to MetaCart
Coding strategies that exploit node cooperation are developed for relay networks. Two basic schemes are studied: the relays decodeandforward the source message to the destination, or they compressandforward their channel outputs to the destination. The decodeandforward scheme is a variant
Loopy belief propagation for approximate inference: An empirical study. In:
 Proceedings of Uncertainty in AI,
, 1999
"... Abstract Recently, researchers have demonstrated that "loopy belief propagation" the use of Pearl's polytree algorithm in a Bayesian network with loops can perform well in the context of errorcorrecting codes. The most dramatic instance of this is the near Shannonlimit performanc ..."
Abstract

Cited by 676 (15 self)
 Add to MetaCart
limit performance of "Turbo Codes" codes whose decoding algorithm is equivalent to loopy belief propagation in a chainstructured Bayesian network. In this paper we ask: is there something spe cial about the errorcorrecting code context, or does loopy propagation work as an ap proximate inference scheme
List Decoding: Algorithms and Applications
 SIGACT News
, 2000
"... Over the years coding theory and complexity theory have benefited from a number of mutually enriching connections. This article focuses on a new connection that has emerged between the two topics in the recent years. This connection is centered around the notion of "listdecoding" for ..."
Abstract

Cited by 36 (0 self)
 Add to MetaCart
Over the years coding theory and complexity theory have benefited from a number of mutually enriching connections. This article focuses on a new connection that has emerged between the two topics in the recent years. This connection is centered around the notion of "listdecoding
Life above threshold: From list decoding to area theorem and MSE
 IEEE INFORMATION THEORY WORKSHOP
, 2004
"... We consider communication over memoryless channels using lowdensity paritycheck code ensembles above the iterative (belief propagation) threshold. What is the computational complexity of decoding (i.e., of reconstructing all the typical input codewords for a given channel output) in this regime? ..."
Abstract

Cited by 33 (11 self)
 Add to MetaCart
We consider communication over memoryless channels using lowdensity paritycheck code ensembles above the iterative (belief propagation) threshold. What is the computational complexity of decoding (i.e., of reconstructing all the typical input codewords for a given channel output) in this regime
Ideal forms of Coppersmith’s theorem and GuruswamiSudan list decoding
, 2011
"... We develop a framework for solving polynomial equations with size constraints on solutions. We obtain our results by showing how to apply a technique of Coppersmith for finding small solutions of polynomial equations modulo integers to analogous problems over polynomial rings, number fields, and f ..."
Abstract

Cited by 12 (1 self)
 Add to MetaCart
of the GuruswamiSudan algorithm for list decoding of ReedSolomon codes, and (3) an algorithm for list decoding of algebraicgeometric codes that handles both singlepoint and multipoint codes. Coppersmith’s algorithm uses lattice basis reduction to find a short vector in a carefully constructed lattice
Theorems on listcoloring
"... Abstract: Graph coloring is a wellknown and wellstudied area of graph theory with many applications. In this paper, we will consider two generalizations of graph coloring. In particular, listcoloring and sumlistcoloring. ..."
Abstract
 Add to MetaCart
Abstract: Graph coloring is a wellknown and wellstudied area of graph theory with many applications. In this paper, we will consider two generalizations of graph coloring. In particular, listcoloring and sumlistcoloring.
1 Channel capacities of classical and quantum list decoding
, 2006
"... Abstract — We focus on classical and quantum list decoding, and derived their channel capacities. We prove that the list decoding does not improve the channel capacity by using Nagaoka’s simple proof for strong converse theorem for channel capacity. Also, we succeeded in simplification of strong con ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Abstract — We focus on classical and quantum list decoding, and derived their channel capacities. We prove that the list decoding does not improve the channel capacity by using Nagaoka’s simple proof for strong converse theorem for channel capacity. Also, we succeeded in simplification of strong
Limits to list decoding ReedSolomon codes
 STOC’05: Proceedings of the 37th Annual ACM Symposium on Theory of Computing, 602–609, ACM
, 2005
"... In this paper, we prove the following two results that expose some combinatorial limitations to list decoding ReedSolomon codes. 1. Given n distinct elements α1,..., αn from a field F, and n subsets S1,..., Sn of F each of size at most ℓ, the list decoding algorithm of Guruswami and Sudan [7] can i ..."
Abstract

Cited by 10 (3 self)
 Add to MetaCart
In this paper, we prove the following two results that expose some combinatorial limitations to list decoding ReedSolomon codes. 1. Given n distinct elements α1,..., αn from a field F, and n subsets S1,..., Sn of F each of size at most ℓ, the list decoding algorithm of Guruswami and Sudan [7] can
The ChenReedHellesethTruong Decoding Algorithm and the GianniKalkbrenner Gröbner Shape Theorem
 Appl. Algebra Engrg. Comm. Comput
, 2002
"... In a paper from Chen, Reed, Helleseth and Truong, [4] (cf. also Loustaunau and York [10]) Grobner bases are applied as a preprocessing tool in order to devise an algorithm for decoding a cyclic code over GF (q) of length n. The Grobner basis computation of a suitable ideal allows us to produce two ..."
Abstract

Cited by 12 (2 self)
 Add to MetaCart
two nite ordered lists of polynomials over GF (q), f i (X1 ; : : : ; Xs )g and fG i (X1 ; : : : ; X s ; Z)g; upon the receipt of a codeword, one needs to compute the syndromes fs1 ; : : : ; ss g and then to compute the maximal value of the index i s.t.
Results 1  10
of
792