One-bit message

Known as: One bit message 
A one-bit message is a type of communication that has no personalized or specified content, and as such transmits only a single binary bit of… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1983-2013
01219832013

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2011
2011
This paper describes a new tree based anti-collision algorithm for Radio Frequency Identification (RFID) systems. The proposed… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 6
Is this relevant?
2010
2010
In this paper we engage in AWGN watermark for grayscale image (the message is embedded by adding of white Gaussian noise matrix… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2009
2009
Audio digital watermarking technology is the new means of audio reproduction, which can pre-implant the special data as a… (More)
  • figure 3
  • table 1
  • figure 4
Is this relevant?
2007
2007
A novel algorithm for robust audio watermarking based on quantization in DCT domain is proposed. DC and AC DCT coefficient play… (More)
  • figure 2
  • table 2
  • figure 3
  • table 1
Is this relevant?
Highly Cited
2005
Highly Cited
2005
Consider a situation where a set of distributed sensors and a fusion center wish to cooperate to estimate an unknown parameter… (More)
Is this relevant?
2002
2002
Randomization is vital in cryptography: secret keys should be randomly generated and most cryptographic primitives (e.g… (More)
Is this relevant?
2001
2001
Suppose that there are players in two hierarchical groups and a computationally unlimited eavesdropper. Using a random deal of… (More)
  • figure 1
Is this relevant?
Review
2000
Review
2000
Security of ordinary digital signature schemes relies on a computational assumption. Fail-stop signature schemes provide security… (More)
Is this relevant?
1991
1991
Three main parameters characterize the efficiency of algorithms that solve the Consensus Problem: the ratio between the total… (More)
  • figure 1
  • figure 4
Is this relevant?
1983
1983
We define the class of trapdoor pseudo-random number generators, and introduce a new technique for using these in cryptography… (More)
Is this relevant?