This document defines an Experimental Protocol for the Internet community. This document is a product of the Internet Engineering Task Force (IETF). It represents the consensus of the IETF community. It has received public review and has been approved for publication by the Internet Engineering Steering Group (IESG). Not all documents approved by the IESG are a candidate for any level of Intern...

For a single transmit and receive antenna system, a new constellation design is proposed to combat errors in the phase estimate of the channel coefficient. The proposed constellation is a combination of PSK and PAM constellations, where PSK is used to provide protection against phase errors, while PAM is used to increase the transmission rate using the knowledge of the magnitude of the channel ...

This paper generalizes previous optimal upper bounds on the minimum Euclidean distance for phase shift keying (PSK) block codes, that are explicit in three parameters: alphabet size, block length and code size. The bounds are primarily generalized from codes over symmetric PSK to codes over asymmetric PSK and also to general alphabet size. Furthermore, block codes are optimized in the presence ...

Sybil attacks pose a serious threat for Wireless Sensor Networks (WSN) security. They can create problems in routing, voting schemes, decision making, distributed storage and sensor re-programming. In a Sybil attack, the attacker masquerades as multiple sensor identities that are actually controlled by one or a few existing attacker nodes. Sybil identities are fabricated out of stolen keys, obt...

The extension problem is solved for the Lee and Euclidean weights over three families of rings of the form Z/NZ: N = 2, N = 3, or N = p = 2q + 1 with p and q prime. The extension problem is solved for the Euclidean PSK weight over Z/NZ for all N . 2010 MSC: 94B05

We present a general algorithm for generating arbitrary standard complementary pairs of sequences (including binary, polyphase, M-PSK and QAM) of length 2 using Boolean functions. The algorithm follows our earlier paraunitary algorithm, but does not require matrix multiplications. The algorithm can be easily and efficiently implemented in hardware. As a special case, it reduces to the non-recur...

In this correspondence, we show that for any (Q×M) space-time code S having a fixed, finite signal constellation, there is a tradeoff between the transmission rate R and the transmit diversity gain ν achieved by the code. The tradeoff is characterized by R ≤ Q−ν +1, where Q is the number of transmit antennas. When either BPSK or QPSK is used as the signal constellation, a systematic constructio...