Sciweavers

40 search results - page 5 / 8
» Linear Codes and Character Sums
Sort
View
CORR
2010
Springer
88views Education» more  CORR 2010»
13 years 7 months ago
Network Codes Resilient to Jamming and Eavesdropping
Abstract--We consider the problem of communicating information over a network secretly and reliably in the presence of a hidden adversary who can eavesdrop and inject malicious err...
Hongyi Yao, Danilo Silva, Sidharth Jaggi, Michael ...
SIAMDM
2008
105views more  SIAMDM 2008»
13 years 6 months ago
Average Spectra and Minimum Distances of Low-Density Parity-Check Codes over Abelian Groups
Ensembles of regular low-density parity-check codes over any finite Abelian group G are studied. The nonzero entries of the parity matrix are randomly chosen, independently and uni...
Giacomo Como, Fabio Fagnani
DCC
2005
IEEE
14 years 6 months ago
When is Bit Allocation for Predictive Video Coding Easy?
This paper addresses the problem of bit allocation among frames in a predictively encoded video sequence. Finding optimal solutions to this problem potentially requires making an ...
Yegnaswamy Sermadevi, Jun Chen, Sheila S. Hemami, ...
SIAMSC
2010
165views more  SIAMSC 2010»
13 years 5 months ago
Algebraic Multigrid for Markov Chains
Abstract. An algebraic multigrid (AMG) method is presented for the calculation of the stationary probability vector of an irreducible Markov chain. The method is based on standard ...
Hans De Sterck, Thomas A. Manteuffel, Stephen F. M...
CORR
2008
Springer
87views Education» more  CORR 2008»
13 years 7 months ago
The Rate Loss of Single-Letter Characterization: The "Dirty" Multiple Access Channel
For general memoryless systems, the typical information theoretic solution - when exists - has a "single-letter" form. This reflects the fact that optimum performance ca...
Tal Philosof, Ram Zamir