Sciweavers

77 search results - page 11 / 16
» LT Codes
Sort
View
CORR
2006
Springer
97views Education» more  CORR 2006»
13 years 7 months ago
Explicit Space-Time Codes Achieving The Diversity-Multiplexing Gain Tradeoff
A recent result of Zheng and Tse states that over a quasi-static channel, there exists a fundamental tradeoff, referred to as the diversity-multiplexing gain (D-MG) tradeoff, betwe...
Petros Elia, K. Raj Kumar, Sameer A. Pawar, P. Vij...
EUROCRYPT
2007
Springer
14 years 2 months ago
Secure Computation from Random Error Correcting Codes
Abstract. Secure computation consists of protocols for secure arithmetic: secret values are added and multiplied securely by networked processors. The striking feature of secure co...
Hao Chen, Ronald Cramer, Shafi Goldwasser, Robbert...
TWC
2008
137views more  TWC 2008»
13 years 7 months ago
Decoding, Performance Analysis, and Optimal Signal Designs for Coordinate Interleaved Orthogonal Designs
Space-time block codes (STBC) using coordinate interleaved orthogonal designs (CIOD) proposed recently by Khan and Rajan allow single-complex symbol decoding and offer higher data ...
Dung Ngoc Dao, Chintha Tellambura
APAL
2008
83views more  APAL 2008»
13 years 8 months ago
Easton's theorem and large cardinals
The continuum function F on regular cardinals is known to have great freedom; if , are regular cardinals, then F needs only obey the following two restrictions: (1) cf(F()) > ...
Sy D. Friedman, Radek Honzik
DM
2006
86views more  DM 2006»
13 years 7 months ago
Decomposing oriented graphs into transitive tournaments
For an oriented graph G with n vertices, let f(G) denote the minimum number of transitive subtournaments that decompose G. We prove several results on f(G). In particular, if G is...
Raphael Yuster