249 search results - page 17 / 50 » Characterization Results for Time-Varying Codes |
ICSE
2010
IEEE-ACM
14 years 19 days ago
2010
IEEE-ACM
The size and high rate of change of source code comprising a software system make it difficult for software developers to keep up with who on the team knows about particular parts...
CORR
2007
Springer
13 years 7 months ago
2007
Springer
We relate the notion of matroid pathwidth to the minimum trellis state-complexity (which we term trellis-width) of a linear code, and to the pathwidth of a graph. By reducing from ...
ICIP
2007
IEEE
14 years 9 months ago
2007
IEEE
In this paper we present a novel video coding scheme to compress stereo video sequences. We consider a wireless sensor network scenario, where the sensing nodes cannot communicate...
DCC
2007
IEEE
14 years 7 months ago
2007
IEEE
We find lower bounds on the minimum distance and characterize codewords of small weight in low-density parity check codes defined by (dual) classical generalized quadrangles. We a...
TIT
2008
13 years 7 months ago
2008
Abstract--In linear programming (LP) decoding of a low-density parity-check (LDPC) code one minimizes a linear functional, with coefficients related to log-likelihood ratios, over ...