• 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 12
Next 10 →

Secret Key Cryptosystem based on Polar Codes over Binary Erasure Channel

by R. Hooshm, M. Koochak Shooshtari, M. R. Aref
"... Abstract — This manuscript proposes an efficient secret key cryptosystem based on polar codes over Binary Erasure Channel. We introduce a method, for the first time to our knowledge, to hide the generator matrix of the polar codes from an attacker. In fact, our main goal is to achieve secure and rel ..."
Abstract - Cited by 2 (1 self) - Add to MetaCart
Abstract — This manuscript proposes an efficient secret key cryptosystem based on polar codes over Binary Erasure Channel. We introduce a method, for the first time to our knowledge, to hide the generator matrix of the polar codes from an attacker. In fact, our main goal is to achieve secure

TO CODE OR NOT TO CODE

by Présentée À La, Faculté Informatique, Et Communications, Section Des, Systèmes De Communication, Du Grade, De Docteur, Ès Sciences, Prof M. Vetterli, Prof B. Rimoldi, Prof R. Gallager, Prof A. Lapidoth, Prof J. Massey, Prof E. Telatar, Prof S. Verdú, Michael Gastpar, Amos Lapidoth, Jim Ma , 2002
"... de nationalité suisse et originaire de Zurich (ZH) et Lucerne (LU) acceptée sur proposition du jury: ..."
Abstract - Add to MetaCart
de nationalité suisse et originaire de Zurich (ZH) et Lucerne (LU) acceptée sur proposition du jury:

An Efficient List Decoder Architecture for Polar Codes

by Jun Lin, Zhiyuan Yan , 2014
"... Long polar codes can achieve the symmetric capacity of arbitrary binary-input discrete memoryless channels under a low complexity successive cancelation (SC) decoding algorithm. However, for polar codes with short and moderate code length, the decoding performance of the SC algorithm is inferior. Th ..."
Abstract - Cited by 3 (2 self) - Add to MetaCart
Long polar codes can achieve the symmetric capacity of arbitrary binary-input discrete memoryless channels under a low complexity successive cancelation (SC) decoding algorithm. However, for polar codes with short and moderate code length, the decoding performance of the SC algorithm is inferior

Secret Key Cryptosystem based on Non-Systematic Polar Codes

by Reza Hooshmand
"... Abstract ˗ Polar codes are provably capacity achieving linear block codes. The generator matrix of these codes is specified by knowing the parameters of transmission channel, length and dimension of the used code. On the other hand, for the cryptosystems based on general decoding problem (i.e. code ..."
Abstract - Add to MetaCart
matrix of polar codes, especially for Binary Erasure Channel on which this matrix can be efficiently specified. In this paper, we introduce a novel method to hide the generator matrix of polar codes in such a way that an attacker cannot construct it in polynomial time even by knowledge of the channel

05 SIMULTANEOUS CLASSICAL-QUANTUM CAPACITIES OF QUANTUM MULTIPLE ACCESS CHANNELS

by Abbas El Gamal, Carl A. Yard , 2005
"... ar ..."
Abstract - Add to MetaCart
Abstract not found

∗IRCTR/CWPC, WMC Group

by Jasper Goseling, Michael Gastpar, Jos H. Weber
"... We consider the effect on the transport capacity of wireless networks of different physical layer coding mechanisms. We compare the performance of traditional channel coding techniques, turning the wireless network in reliable point-to-point channels, with multi-access computation coding, in which n ..."
Abstract - Add to MetaCart
We consider the effect on the transport capacity of wireless networks of different physical layer coding mechanisms. We compare the performance of traditional channel coding techniques, turning the wireless network in reliable point-to-point channels, with multi-access computation coding, in which

RICE UNIVERSITY Regime Change: Sampling Rate vs. Bit-Depth in Compressive Sensing

by Jason Noah Laska , 2011
"... The compressive sensing (CS) framework aims to ease the burden on analog-to-digital converters (ADCs) by exploiting inherent structure in natural and man-made signals. It has been demon-strated that structured signals can be acquired with just a small number of linear measurements, on the order of t ..."
Abstract - Add to MetaCart
The compressive sensing (CS) framework aims to ease the burden on analog-to-digital converters (ADCs) by exploiting inherent structure in natural and man-made signals. It has been demon-strated that structured signals can be acquired with just a small number of linear measurements, on the order of the signal complexity. In practice, this enables lower sampling rates that can be more easily achieved by current hardware designs. The primary bottleneck that limits ADC sam-pling rates is quantization, i.e., higher bit-depths impose lower sampling rates. Thus, the decreased sampling rates of CS ADCs accommodate the otherwise limiting quantizer of conventional ADCs. In this thesis, we consider a different approach to CS ADC by shifting towards lower quantizer bit-depths rather than lower sampling rates. We explore the extreme case where each measurement is quantized to just one bit, representing its sign. We develop a new theoretical framework to analyze this extreme case and develop new algorithms for signal reconstruction from such coarsely quantized measurements. The 1-bit CS framework leads us to scenarios where it may be more appropriate to reduce bit-depth instead of sampling rate. We find that there exist two distinct regimes of operation that correspond to high/low signal-to-noise ratio (SNR). In the measurement

Subspace Communication

by Josep Font-segura, Prof Gregori , 2014
"... We are surrounded by electronic devices that take advantage of wireless technologies, from our computer mice, which require little amounts of information, to our cellphones, which demand increasingly higher data rates. Until today, the coexistence of such a variety of services has been guaranteed by ..."
Abstract - Add to MetaCart
We are surrounded by electronic devices that take advantage of wireless technologies, from our computer mice, which require little amounts of information, to our cellphones, which demand increasingly higher data rates. Until today, the coexistence of such a variety of services has been guaranteed by a fixed assignment of spectrum resources by regulatory agencies. This has resulted into a blind alley, as current wireless spectrum has become an expensive and a scarce resource. However, recent measurements in dense areas paint a very different picture: there is an actual underutilization of the spectrum by legacy sys-tems. Cognitive radio exhibits a tremendous promise for increasing the spectral efficiency for future wireless systems. Ideally, new secondary users would have a perfect panorama of the spectrum usage, and would opportunistically communicate over the available re-sources without degrading the primary systems. Yet in practice, monitoring the spectrum resources, detecting available resources for opportunistic communication, and transmit-ting over the resources are hard tasks. This thesis addresses the tasks of monitoring, de-

Guaranteeing Communication Quality in Real World WSN Deployments

by Fbk-irst Bruno, Kessler Foundation, Matteo Ceriotti, Dr. Amy, L. Murphy, Bruno Kessler Foundation (fbk-irst, Amy L. Murphy, Prof Prabal Dutta, Prof Koen Langendoen, Prof Leo Selavo
"... April 29, 2011Für UnsShe had never before seen a rabbit with either a waistcoat-pocket, or a watch to take out of it, and burning with curiosity, she ran across the field after it Lewis CarrollThe following document, written under the supervision of Dr. reviewed by: ..."
Abstract - Add to MetaCart
April 29, 2011Für UnsShe had never before seen a rabbit with either a waistcoat-pocket, or a watch to take out of it, and burning with curiosity, she ran across the field after it Lewis CarrollThe following document, written under the supervision of Dr. reviewed by:

ACKNOWLEDGMENTS

by Jennifer E. Michaels, Maysam Ghovanloo, James H. Mcclellan, Michael J. Leamy, George W. Woodruff, Laurence J. Jacobs, Thomas E. Michaels , 2011
"... First and foremost, I would like to thank my advisor, Prof. Jennifer E. Michaels. I am most appreciative of your guidance over the last four years, from the basics of elastic waves to both short- and long-term career advice. I have grown a tremendous amount, both profes-sionally and personally, and ..."
Abstract - Add to MetaCart
First and foremost, I would like to thank my advisor, Prof. Jennifer E. Michaels. I am most appreciative of your guidance over the last four years, from the basics of elastic waves to both short- and long-term career advice. I have grown a tremendous amount, both profes-sionally and personally, and am deeply grateful for your mentorship, patience, and support. I would also like to thank my Ph.D. committee for their valuable insight and sugges-
Next 10 →
Results 1 - 10 of 12
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