• Documents
  • Authors
  • Tables
  • Log in
  • Sign up
  • MetaCart
  • DMCA
  • Donate

CiteSeerX logo

Advanced Search Include Citations

Tools

Sorted by:
Try your query at:
Semantic Scholar Scholar Academic
Google Bing DBLP
Results 1 - 10 of 7,913
Next 10 →

On limits of wireless communications in a fading environment when using multiple antennas

by G. J. Foschini, M. J. Gans - Wireless Personal Communications , 1998
"... Abstract. This paper is motivated by the need for fundamental understanding of ultimate limits of bandwidth efficient delivery of higher bit-rates in digital wireless communications and to also begin to look into how these limits might be approached. We examine exploitation of multi-element array (M ..."
Abstract - Cited by 2426 (14 self) - Add to MetaCart
Abstract. This paper is motivated by the need for fundamental understanding of ultimate limits of bandwidth efficient delivery of higher bit-rates in digital wireless communications and to also begin to look into how these limits might be approached. We examine exploitation of multi-element array

Space-time codes for high data rate wireless communication: Performance criterion and code construction

by Vahid Tarokh, Nambi Seshadri, A. R. Calderbank - IEEE TRANS. INFORM. THEORY , 1998
"... We consider the design of channel codes for improving the data rate and/or the reliability of communications over fading channels using multiple transmit antennas. Data is encoded by a channel code and the encoded data is split into n streams that are simultaneously transmitted using n transmit ant ..."
Abstract - Cited by 1782 (28 self) - Add to MetaCart
We consider the design of channel codes for improving the data rate and/or the reliability of communications over fading channels using multiple transmit antennas. Data is encoded by a channel code and the encoded data is split into n streams that are simultaneously transmitted using n transmit

Private Information Retrieval

by Benny Chor, et al.
"... We describe schemes that enable a user to access k replicated copies of a database ( k * 2) and privately retrieve informationstored in the database. This means that each individual database gets no information on the identity of the item retrieved by the user. For a single database, achieving thi ..."
Abstract - Cited by 558 (14 self) - Add to MetaCart
this type of privacy requires communicating the whole database, or n bits (where n is the number of bits in the database). Our schemes use the replication to gain substantial saving. In particular, we have ffl A two database scheme with communication complexity of O(n1=3).ffl

Sensing Reality and Communicating Bits: A Dangerous Liaison

by Michael Gastpar, Martin Vetterli, Pier Luigi Dragotti , 2006
"... [Is digital communication sufficient for sensor networks?] The successful design of sensor network architectures depends crucially on the structure of the sampling, observation, and communication processes. One of the most fundamental questions concerns the sufficiency of discrete approximations in ..."
Abstract - Cited by 21 (1 self) - Add to MetaCart
[Is digital communication sufficient for sensor networks?] The successful design of sensor network architectures depends crucially on the structure of the sampling, observation, and communication processes. One of the most fundamental questions concerns the sufficiency of discrete approximations

Charging and rate control for elastic traffic

by Frank Kelly - European Transactions on Telecommunications , 1997
"... This paper addresses the issues of charging, rate control and routing for a communication network carrying elastic traffic, such as an ATM network offering an available bit rate service. A model is described from which max–min fairness of rates emerges as a limiting special case; more generally, the ..."
Abstract - Cited by 936 (7 self) - Add to MetaCart
This paper addresses the issues of charging, rate control and routing for a communication network carrying elastic traffic, such as an ATM network offering an available bit rate service. A model is described from which max–min fairness of rates emerges as a limiting special case; more generally

Packet Leashes: A Defense against Wormhole Attacks in Wireless Ad Hoc Networks

by Yih-chun Hu , 2003
"... Abstract — As mobile ad hoc network applications are deployed, security emerges as a central requirement. In this paper, we introduce the wormhole attack, a severe attack in ad hoc networks that is particularly challenging to defend against. The wormhole attack is possible even if the attacker has n ..."
Abstract - Cited by 703 (15 self) - Add to MetaCart
not compromised any hosts, and even if all communication provides authenticity and confidentiality. In the wormhole attack, an attacker records packets (or bits) at one location in the network, tunnels them (possibly selectively) to another location, and retransmits them there into the network. The wormhole

Seven principles for good practice in undergraduate education

by W. Chickering, Zelda F. Gamson , 1987
"... Apathetic students, illiterate graduates, incompetent teaching, impersonal campuses-- so rolls the drumfire of criticism of higher education. More than two years of reports have spelled out the problems. States have been quick to respond by holding out carrots and beating with sticks. There are neit ..."
Abstract - Cited by 799 (0 self) - Add to MetaCart
. Develops reciprocity and cooperation among students. 3. Uses active learning techniques. 4. Gives prompt feedback. 5. Emphasizes time on task. 6. Communicates high expectations. 7. Respects diverse talents and ways of learning. We can do it ourselves-- with a little bit of help.... A Focus for Improvement

Error Control and Concealment for Video Communication -- A Review

by Yao Wang, Qin-fan Zhu - PROCEEDINGS OF THE IEEE , 1998
"... The problem of error control and concealment in video communication is becoming increasingly important because of the growing interest in video delivery over unreliable channels such as wireless networks and the Internet. This paper reviews the techniques that have been developed for error control a ..."
Abstract - Cited by 438 (13 self) - Add to MetaCart
The problem of error control and concealment in video communication is becoming increasingly important because of the growing interest in video delivery over unreliable channels such as wireless networks and the Internet. This paper reviews the techniques that have been developed for error control

Spectral Efficiency in the Wideband Regime

by Sergio Verdú , 2002
"... The tradeoff of spectral efficiency (b/s/Hz) versus energy -per-information bit is the key measure of channel capacity in the wideband power-limited regime. This paper finds the fundamental bandwidth--power tradeoff of a general class of channels in the wideband regime characterized by low, but nonz ..."
Abstract - Cited by 393 (29 self) - Add to MetaCart
, but nonzero, spectral efficiency and energy per bit close to the minimum value required for reliable communication. A new criterion for optimality of signaling in the wideband regime is proposed, which, in contrast to the traditional criterion, is meaningful for finite-bandwidth communication.

Bit Commitment Using Pseudo-Randomness

by Moni Naor - Journal of Cryptology , 1991
"... We show how a pseudo-random generator can provide a bit commitment protocol. We also analyze the number of bits communicated when parties commit to many bits simultaneously, and show that the assumption of the existence of pseudo-random generators suffices to assure amortized O(1) bits of communicat ..."
Abstract - Cited by 275 (15 self) - Add to MetaCart
We show how a pseudo-random generator can provide a bit commitment protocol. We also analyze the number of bits communicated when parties commit to many bits simultaneously, and show that the assumption of the existence of pseudo-random generators suffices to assure amortized O(1) bits
Next 10 →
Results 1 - 10 of 7,913
Powered by: Apache Solr
  • About CiteSeerX
  • Submit and Index Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2019 The Pennsylvania State University