Sciweavers

1579 search results - page 132 / 316
» On the Constructions of Constant-Weight Codes
Sort
View
CORR
2008
Springer
57views Education» more  CORR 2008»
14 years 10 months ago
Square Complex Orthogonal Designs with Low PAPR and Signaling Complexity
Abstract--Space-Time Block Codes from square complex orthogonal designs (SCOD) have been extensively studied and most of the existing SCODs contain large number of zero. The zeros ...
Smarajit Das, B. Sundar Rajan
ENTCS
2008
91views more  ENTCS 2008»
14 years 10 months ago
Implementing Real Numbers With RZ
RZ is a tool which translates axiomatizations of mathematical structures to program specifications using the realizability interpretation of logic. This helps programmers correctl...
Andrej Bauer, Iztok Kavkler
DAM
2007
76views more  DAM 2007»
14 years 10 months ago
Super-simple (v, 5, 4) designs
Super-simple designs are useful in constructing codes and designs such as superimposed codes and perfect hash families. Recently, Gronau et al determined the existence of super-si...
Kejun Chen, Ruizhong Wei
IJNSEC
2007
156views more  IJNSEC 2007»
14 years 10 months ago
Another Look at PMAC
We can view an existing Message Authentication Code (MAC) as a Carter-Wegman MAC in spite of the fact it may not have been designed as one. This will make the analysis easier than...
Dayin Wang, Dongdai Lin, Wenling Wu
JSAC
2007
86views more  JSAC 2007»
14 years 10 months ago
Asymptotically optimal cooperative wireless networks with reduced signaling complexity
Abstract— This paper considers an orthogonal amplify-andforward (OAF) protocol for cooperative relay communication over Rayleigh-fading channels in which the intermediate relays ...
Petros Elia, Frédérique E. Oggier, P...