386 search results - page 50 / 78 » The Weights in MDS Codes |
COMBINATORICS
1999
14 years 11 months ago
1999
This is a continuation of our paper "A Theory of Pfaffian Orientations I: Perfect Matchings and Permanents". We present a new combinatorial way to compute the generating...
101
click to vote
COCO
2009
Springer
15 years 6 months ago
2009
Springer
Locally testable codes (LTCs) are error-correcting codes for which membership, in the code, of a given word can be tested by examining it in very few locations. Most known constru...
INFOCOM
2007
IEEE
15 years 6 months ago
2007
IEEE
— We consider the problem of serving multicast flows in a crossbar switch. We show that linear network coding across packets of a flow can sustain traffic patterns that cannot...
ICMCS
2006
IEEE
15 years 6 months ago
2006
IEEE
A joint rate-distortion-complexity H.264 motion search framework is proposed to balance the encoder’s coding efficiency and complexity in an embedded system environment. Under ...
TON
2010
14 years 6 months ago
2010
In this paper, we develop a distributed rate-control algorithm for networks with multiple unicast sessions when network coding is allowed across different sessions. Building on rec...