Results 1  10
of
91,300
Iterative decoding of binary block and convolutional codes
 IEEE TRANS. INFORM. THEORY
, 1996
"... Iterative decoding of twodimensional systematic convolutional codes has been termed “turbo” (de)coding. Using loglikelihood algebra, we show that any decoder can he used which accepts soft inputsincluding a priori valuesand delivers soft outputs that can he split into three terms: the soft chann ..."
Abstract

Cited by 610 (43 self)
 Add to MetaCart
channel and a priori inputs, and the extrinsic value. The extrinsic value is used as an a priori value for the next iteration. Decoding algorithms in the loglikelihood domain are given not only for convolutional codes hut also for any linear binary systematic block code. The iteration is controlled by a
An Implementation of the Binary Blocking Flow Algorithm
, 1998
"... Goldberg and Rao recently devised a new binary blocking flow algorithm for computing maximum flows in networks with integer capacities. We describe an implementation of variants of the binary blocking flow algorithm geared towards practical efficiency and report on preliminary experimental result ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
Goldberg and Rao recently devised a new binary blocking flow algorithm for computing maximum flows in networks with integer capacities. We describe an implementation of variants of the binary blocking flow algorithm geared towards practical efficiency and report on preliminary experimental
On Minimal Trellises of Linear Binary Block Codes
, 2002
"... This paper deals with the problem of searching and designing of minimal trellises for linear binary block codes (LBBC), from the generator matrices (GM). Minimal trellises could be used for soft decoding, especially in decoders which utilize the socalled Maximum Likelihood criterion, e.g. in decode ..."
Abstract
 Add to MetaCart
This paper deals with the problem of searching and designing of minimal trellises for linear binary block codes (LBBC), from the generator matrices (GM). Minimal trellises could be used for soft decoding, especially in decoders which utilize the socalled Maximum Likelihood criterion, e
Extended Welch Inner Product Theorem for Systematic Binary Block Codes
"... A Simple extended Welch inner product theorem is investigated in this paper. Several functions to find the largest possible minimum Hamming distance of the systematic binary block codes are also derived by using the extended Welch inner product theorem. The results will be useful to estimate or desi ..."
Abstract
 Add to MetaCart
A Simple extended Welch inner product theorem is investigated in this paper. Several functions to find the largest possible minimum Hamming distance of the systematic binary block codes are also derived by using the extended Welch inner product theorem. The results will be useful to estimate
Nonparametric estimation of average treatment effects under exogeneity: a review
 REVIEW OF ECONOMICS AND STATISTICS
, 2004
"... Recently there has been a surge in econometric work focusing on estimating average treatment effects under various sets of assumptions. One strand of this literature has developed methods for estimating average treatment effects for a binary treatment under assumptions variously described as exogen ..."
Abstract

Cited by 630 (25 self)
 Add to MetaCart
Recently there has been a surge in econometric work focusing on estimating average treatment effects under various sets of assumptions. One strand of this literature has developed methods for estimating average treatment effects for a binary treatment under assumptions variously described
Performance of Interleaved NonBinary Block Codes Over Binary Channels with Memory
, 2007
"... The performance of ReedSolomon codes over two classes of binary channels with memory, the queuebased channel (QBC) and the GilbertElliott channel (GEC) is analyzed under the assumption of bounded distance decoding. In particular, we examine two interleaving strategies encountered when dealing wit ..."
Abstract
 Add to MetaCart
with nonbinary codes over a binary channel; namely, symbol interleaving and bit interleaving. An analytical proof is given demonstrating that perfect (i.e., with infinite interleaving depth) symbol interleaving results in a better performance compared to perfect bit interleaving for any nonbinary block
The ratedistortion function for source coding with side information at the decoder
 IEEE Trans. Inform. Theory
, 1976
"... AbstractLet {(X,, Y,J}r = 1 be a sequence of independent drawings of a pair of dependent random variables X, Y. Let us say that X takes values in the finite set 6. It is desired to encode the sequence {X,} in blocks of length n into a binary stream*of rate R, which can in turn be decoded as a seque ..."
Abstract

Cited by 1060 (1 self)
 Add to MetaCart
AbstractLet {(X,, Y,J}r = 1 be a sequence of independent drawings of a pair of dependent random variables X, Y. Let us say that X takes values in the finite set 6. It is desired to encode the sequence {X,} in blocks of length n into a binary stream*of rate R, which can in turn be decoded as a
Performance of binary block codes at low signaltonoise ratios
 IEEE Trans. Inform. Theory
, 1992
"... AbstractThe performance of general binary block codes on an unquantized additive white Gaussian noise (AWGN) channel at low signaltonoise ratios is considered. Expressions are derived for both the blockerror and the biterror probabilities near the point where the bit signaltonoise ratio is z ..."
Abstract

Cited by 6 (0 self)
 Add to MetaCart
AbstractThe performance of general binary block codes on an unquantized additive white Gaussian noise (AWGN) channel at low signaltonoise ratios is considered. Expressions are derived for both the blockerror and the biterror probabilities near the point where the bit signaltonoise ratio
Finding the Best Path in a Binary Block Interference Network
"... Abstract—A binary Block Interference Channel (BIC) is model of binary channels with memory that allows for a mathematically tractable computation of channel capacity. One can easily imagine interconnecting such channels into a network that allows pointtopoint communication between any two nodes in ..."
Abstract
 Add to MetaCart
Abstract—A binary Block Interference Channel (BIC) is model of binary channels with memory that allows for a mathematically tractable computation of channel capacity. One can easily imagine interconnecting such channels into a network that allows pointtopoint communication between any two nodes
Results 1  10
of
91,300