A Simple Deterministic Measurement Matrix Based on GMW Pseudorandom Sequence

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Frequent Directions: Simple and Deterministic Matrix Sketching

We describe a new algorithm called Frequent Directions for deterministic matrix sketching in the row-updates model. The algorithm is presented an arbitrary input matrix A ∈ Rn×d one row at a time. It performed O(d`) operations per row and maintains a sketch matrix B ∈ R`×d such that for any k < ` ‖AA−BB‖2 ≤ ‖A−Ak‖F /(`− k) and ‖A− πBk(A)‖F ≤ ( 1 + k `− k ) ‖A−Ak‖F . Here, Ak stands for the mini...

متن کامل

Pseudorandom Number Generators Based on the Weyl Sequence

Some modifications of the pseudorandom number generator proposed recently by Holian et al. [B. L. Holian, O. E. Percus, T. T. Warnock, P. A. Whitlock, Phys. Rev. E50, 1607 (1994)] are presented.

متن کامل

Efficient RFID authentication protocols based on pseudorandom sequence generators

In this paper, we introduce a new class of PRSGs, called partitioned pseudorandom sequence generators(PPRSGs), and propose an RFID authentication protocol using a PPRSG, called S-protocol. Since most existing stream ciphers can be regarded as secure PPRSGs, and stream ciphers outperform other types of symmetric key primitives such as block ciphers and hash functions in terms of power, performan...

متن کامل

A VoIP-based Covert Communication Scheme Using Compounded Pseudorandom Sequence

Steganography over real-time streaming media is a novel and promising research subject. This paper performs steganography over a typical streaming media, Voice over IP (VoIP), and suggests a new covert communication scheme for interactive secret messages. To resist the statistical detection, a sophisticated compounded pseudorandom sequence, produced by a compounded pseudorandom number generator...

متن کامل

Note on GMW Designs

Let N and n be integers such that n|N and 2 < n < N . Let q be a prime power. The difference sets introduced by Gordon, Mills and Welch in [1] produce symmetric designs with the same parameters v = (q N −1)/(q−1), k = (q N−1−1)/(q−1), λ = (q N−2−1)/(q−1) as the point-hyperplane design of PG(N − 1, q). The purpose of this note is to prove that inequivalent difference sets of this sort produce no...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEICE Transactions on Information and Systems

سال: 2019

ISSN: 0916-8532,1745-1361

DOI: 10.1587/transinf.2018edp7324