Results 1  10
of
287
Near Shannon limit errorcorrecting coding and decoding
, 1993
"... Abstract This paper deals with a new class of convolutional codes called Turbocodes, whose performances in terms of Bit Error Rate (BER) are close to the SHANNON limit. The TurboCode encoder is built using a parallel concatenation of two Recursive Systematic Convolutional codes and the associated ..."
Abstract

Cited by 1776 (6 self)
 Add to MetaCart
and the associated decoder, using a feedback decoding rule, is implemented as P pipelined identical elementary decoders. Consider a binary rate R=1/2 convolutional encoder with constraint length K and memory M=K1. The input to the encoder at time k is a bit dk and the corresponding codeword
Efficient erasure correcting codes
 IEEE TRANSACTIONS ON INFORMATION THEORY
, 2001
"... We introduce a simple erasure recovery algorithm for codes derived from cascades of sparse bipartite graphs and analyze the algorithm by analyzing a corresponding discretetime random process. As a result, we obtain a simple criterion involving the fractions of nodes of different degrees on both si ..."
Abstract

Cited by 360 (26 self)
 Add to MetaCart
We introduce a simple erasure recovery algorithm for codes derived from cascades of sparse bipartite graphs and analyze the algorithm by analyzing a corresponding discretetime random process. As a result, we obtain a simple criterion involving the fractions of nodes of different degrees on both
The benefits of coding over routing in a randomized setting
 In Proceedings of 2003 IEEE International Symposium on Information Theory
, 2003
"... Abstract — We present a novel randomized coding approach for robust, distributed transmission and compression of information in networks. We give a lower bound on the success probability of a random network code, based on the form of transfer matrix determinant polynomials, that is tighter than the ..."
Abstract

Cited by 361 (44 self)
 Add to MetaCart
the SchwartzZippel bound for general polynomials of the same total degree. The corresponding upper bound on failure probability is on the order of the inverse of the size of the finite field, showing that it can be made arbitrarily small by coding in a sufficiently large finite field, and that it decreases
Mean Codeword Lengths and Their Correspondence with Entropy Measures
"... Abstract—The objective of the present communication is to develop new genuine exponentiated mean codeword lengths and to study deeply the problem of correspondence between well known measures of entropy and mean codeword lengths. With the help of some standard measures of entropy, we have illustrate ..."
Abstract
 Add to MetaCart
Abstract—The objective of the present communication is to develop new genuine exponentiated mean codeword lengths and to study deeply the problem of correspondence between well known measures of entropy and mean codeword lengths. With the help of some standard measures of entropy, we have
The length of a typical Huffman codeword
 IEEE Trans. Inform. Theory
, 1994
"... If pi (i = 1,...,N) is the probability of the ith letter of a memoryless source, the length li of the corresponding binary Huffman codeword can be very different from the value − log ∑pi. For a typical letter, however, li ∑ ≈ − log pi. More prepj < 2 −c(m−2)+2 cisely, P − m = where c ≈ 2.27. ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
If pi (i = 1,...,N) is the probability of the ith letter of a memoryless source, the length li of the corresponding binary Huffman codeword can be very different from the value − log ∑pi. For a typical letter, however, li ∑ ≈ − log pi. More prepj < 2 −c(m−2)+2 cisely, P − m = where c ≈ 2.27.
Bounds on Minimal Codewords in Linear Codes
, 1994
"... The notion of minimal codewords in linear codes was introduced recently by Massey. In this paper two weight bounds on minimal codewords are proved; an upper bound above which no codewords are minimal and a lower bound below which all codewords are minimal. It is shown for Hamming codes that every we ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
The notion of minimal codewords in linear codes was introduced recently by Massey. In this paper two weight bounds on minimal codewords are proved; an upper bound above which no codewords are minimal and a lower bound below which all codewords are minimal. It is shown for Hamming codes that every
Symmetries of Codeword Stabilized Quantum Codes
"... Symmetry is at the heart of coding theory. Codes with symmetry, especially cyclic codes, play an essential role in both theory and practical applications of classical errorcorrecting codes. Here we examine symmetry properties for codeword stabilized (CWS) quantum codes, which is the most general fr ..."
Abstract
 Add to MetaCart
Symmetry is at the heart of coding theory. Codes with symmetry, especially cyclic codes, play an essential role in both theory and practical applications of classical errorcorrecting codes. Here we examine symmetry properties for codeword stabilized (CWS) quantum codes, which is the most general
Communication over fading channels with delay constraints
 IEEE Transactions on Information Theory
, 2002
"... We consider a user communicating over a fading channel with perfect channel state information. Data is assumed to arrive from some higher layer application and is stored in a buffer until it is transmitted. We study adapting the user's transmission rate and power based on the channel state info ..."
Abstract

Cited by 252 (7 self)
 Add to MetaCart
information as well as the buffer occupancy; the objectives are to regulate both the longterm average transmission power and the average buffer delay incurred by the traffic. Two models for this situation are discussed; one corresponding to fixedlength/variablerate codewords and one corresponding
Human action recognition by sequence of movelet codewords
 in Proceedings of the 1st EURASIP Journal on Advances in Signal Processing 9 International Symposium on 3D Data Processing Visualization and Transmission
, 2002
"... An algorithm for the recognition of human actions in image sequences is presented. The algorithm consists of 3 stages: background subtraction, body pose classi cation, and action recognition. A pose is represented in spacetime { we call it `movelet'. A movelet is a collection of the shape, m ..."
Abstract

Cited by 28 (1 self)
 Add to MetaCart
, motion and occlusion of image patches corresponding to the main parts of the body. The (innite) set of all possible movelets is quantized into codewords obtained by vector quantization. For every pair of frames each codeword is assigned a probability. Recognition is performed by si
Correspondence
"... The transcoding of MPEG video streams is important in a variety of situations such as in rate reduction for small bandwidth downstream channels and in extracting a fast visual playback stream for digital video cassette recorders. This paper addresses transcoding of MPEG intracoded frames by selecti ..."
Abstract
 Add to MetaCart
by selectively copying DCT AC coefficients from the primary MPEG stream into the secondary MPEG stream. A ratedistortion optimal transcoding approach is presented, as well as several computationally more attractive suboptimal approaches. The proposed solutions outperform the more traditional codeword extraction
Results 1  10
of
287