Result 1 to 20 of 49 total
A deterministic polynomial‒time algorithm for constructing a multicast coding scheme for linear deterministic relay networks. (English)
Comput. Res. Repos. 2011, Article No. 1101.2937 (2011).
1
Network coding in node-constrained line and star networks (English)
IEEE Transactions on Information Theory 57, No. 7, 4452-4468 (2011).
2
A Max-flow/min-cut algorithm for linear deterministic relay networks (English)
IEEE Transactions on Information Theory 57, No. 5, 3005-3015 (2011).
3
A deterministic polynomialtime algorithm for constructing a multicast coding scheme for linear deterministic relay networks (English)
CISS, 1-6 (2011).
4
On the multimessage capacity region for undirected ring networks (English)
IEEE Transactions on Information Theory 56, No. 4, 1930-1947 (2010).
5
A Max-flow/min-cut algorithm for a class of wireless networks (English)
SODA, 1209-1226 (2010).
6
A lossless circuit layout image compression algorithm for maskless lithography systems (English)
DCC, 109-118 (2010).
7
When Huffman meets Hamming: A class of optimal variable-length error correcting codes (English)
DCC, 327-336 (2010).
8
A SAT-based scheme to determine optimal fix-free codes (English)
DCC, 169-178 (2010).
9
A combinatorial study of linear deterministic relay networks. (English)
Comput. Res. Repos. 2009, Article No. 0904.2401 (2009).
10
On minimum-redundancy fix-free codes (English)
DCC, 3-12 (2009).
11
On one-to-one codes for memoryless cost channels. (English)
IEEE Trans. Inf. Theory 54, No. 1, 367-379 (2008).
12
Network coding on line networks with broadcast (English)
CISS, 781-784 (2008).
13
An approach to graph and netlist compression (English)
DCC, 33-42 (2008).
14
Communicating probability distributions. (English)
IEEE Trans. Inf. Theory 53, No. 2, 518-525 (2007).
15
Dictionary-based English text compression using word endings (English)
DCC, 410 (2007).
16
The capacity region of a collection of multicast sessions in an undirected ring network (English)
ICPP Workshops, 40 (2007).
17
Edge-cut bounds on network coding rates. (English)
J. Netw. Syst. Manag. 14, No. 1, 49-67 (2006).
18
Lossless compression using two-level and multilevel Boolean minimization (English)
SiPS, 148-152 (2006).
19
On networks of two-way channels. (English)
Ashikhmin, Alexei (ed.) et al., Algebraic coding theory and information theory. DIMACS workshop algebraic coding theory and information theory, December 15‒18, 2003, Piscataway, New Jersey. Providence, RI: American Mathematical Society (AMS) (ISBN 0-8218-3626-9/hbk). DIMACS. Series in Discrete Mathematics and Theoretical Computer Science 68, 133-143 (2005).
20
Result 1 to 20 of 49 total