114 search results - page 7 / 23 » Hardness of Approximating the Minimum Distance of a Linear C... |
87
Voted
DCC
2008
IEEE
15 years 12 months ago
2008
IEEE
Abstract. Orbits of graphs under the operation edge local complementation (ELC) are defined. We show that the ELC orbit of a bipartite graph corresponds to the equivalence class of...
100
Voted
TCOM
2010
14 years 7 months ago
2010
Abstract--Variable length codes (VLCs), used in data compression, are very sensitive to error propagation in the presence of noisy channels. Addressing this problem with joint sour...
136
click to vote
CORR
2012
Springer
13 years 8 months ago
2012
Springer
A distance oracle is a compact representation of the shortest distance matrix of a graph. It can be queried to retrieve approximate distances and corresponding paths between any p...
100
Voted
DCC
2003
IEEE
15 years 12 months ago
2003
IEEE
This paper introduces a linear programming (LP) technique that performs ratedistortion based optimization for constrained video coding. Given the assumption of piecewise linear an...
105
Voted
CORR
2007
Springer
15 years 10 days ago
2007
Springer
—For a linear block code C, its stopping redundancy is defined as the smallest number of check nodes in a Tanner graph for C, such that there exist no stopping sets of size smal...