Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:0711.0356

Data Transmission in the Fourth Dimension

Serge Burckel

Published Nov 2, 2007• 2 citations
arXivHTMLPDF

Abstract

Alice wants to send an arbitrary binary word to Bob. We show here that there is no problem for her to do that with only two bits. Of course, we consider here information like a signal in 4D.
DOI
10.48550/arxiv.0711.0356

Related papers

Sending a Message with Unknown Noise

Abhinav Aggarwal, Varsha Dani, Thomas P. Hayes +1 more

Alice and Bob are connected via a two-way channel, and Alice wants to send a message of L bits to Bob. An adversary flips an arbitrary but finite number of bits, T, on the channel. This adversary knows our algorithm and Alice's message, but does not know any private random bits generated by Alice or Bob, nor the bits sent over the channel, except when these bits can be predicted by knowledge of Alice's message or our algorithm. We want Bob to receive Alice's message and for both players to terminate, with error probability at most δ > 0, where δ is a parameter known to both Alice and Bob. Unfortunately, the value T is unknown in advance to either Alice or Bob, and the value L is unknown in advance to Bob.

arXiv:1605.04486•International Conference on Distributed Computing and Networking (ICDCN)•Jan 4, 2018•5 citations

How many bits are needed to transmit a qubit reliably?

P. K. Aravind

Physics Letters A•May 1, 1998•3 citations

Secure transmission with different security requirements based on covert communication and information-theoretic security in the presence of friendly jammer

Seyyed Mohammad Javad Asgari Tabatabaee, Farid Samsami Khodadad, Moslem Forouzesh +1 more

Abstract This paper addresses the power allocation problem in a network where joint information-theoretic secrecy and covert communication are required. In this network, a single transmitter (Alice) sends information to two legitimate users (Bob and Carol). There is also an untrusted user who attempts to detect the content of Bob’s message and a warden (Willie) who wants to detect the existence of communication between Alice and the two users. Thus, Carol requires covert transmission, and Bob requires secure and covert communication. The network utilizes a friendly jammer to address these demands and overcome the low transmission rate of covert communication. To achieve covert communication, Alice sends both users’ data simultaneously in selected time slots to hide it from Willie, while the jammer continuously transmits signals in all time slots. The objective is to maximize the average transmission rate over the allocated powers of Bob, Carol, and the jammer while meeting the two users’ requirements. A novel iterative algorithm is proposed to obtain an effective solution. Simulation results indicate that the proposed method can enhance the network’s average rate while satisfying the users’ demands.

arXiv:2107.00210•Frequenz•Feb 19, 2026•0 citations

Four-photon, five-dimensional entanglement for quantum communication

Chunhui Li

Physics Letters A•Jun 30, 2003•3 citations

Quantum Communication With A 2-bit Message Coding For Each Transmitted Photon

Kazuo Shimizu, T. Mukai

Conference on Lasers and Electro-Optics Pacific Rim (CLEO-PR)•Jan 1, 1997•0 citations

Information theoretic reductions among disclosure problems

Gilles Brassard, Claude Crépeau, Jean-Marc Robert

Alice disposes of some number of secrets. She is willing to disclose one of them to Bob. Although she agrees to let him choose which secret he wants, she is not willing to allow him to gain any information on more than one secret. On the other hand, Bob does not want Alice to know which secret he wishes. An all-or-nothing disclosure is one by which, as soon as Bob has gained any information whatsoever on one of Alice's secrets, he has wasted his chances to learn anything about the other secrets. We assume that Alice is honest when she claims to be willing to disclose one secret to Bob (i.e. she is not about to send junk). The only cheating Alice is susceptible of trying is to figure out which secret is of interest to Bob. We address the following question from an information theoretic point of view: what is the most elementary disclosure problem? The main result is that the general all-or-nothing disclosure of secrets is equivalent to a much simpler problem, which we call the two-bit problem.

Annual Symposium on Foundations of Computer Science•Oct 1, 1986•149 citations
Alice and Bob are connected via a two-way channel, and Alice wants to send a message of L bits to Bob. An adversary flips an arbitrary but finite number of bits, T, on the channel. This adversary knows our algorithm and Alice's message, but does not know any private random bits generated by Alice or Bob, nor the bits sent over the channel, except when these bits can be predicted by knowledge of Alice's message or our algorithm. We want Bob to receive Alice's message and for both players to terminate, with error probability at most δ > 0, where δ is a parameter known to both Alice and Bob. Unfortunately, the value T is unknown in advance to either Alice or Bob, and the value L is unknown in advance to Bob.
Abstract This paper addresses the power allocation problem in a network where joint information-theoretic secrecy and covert communication are required. In this network, a single transmitter (Alice) sends information to two legitimate users (Bob and Carol). There is also an untrusted user who attempts to detect the content of Bob’s message and a warden (Willie) who wants to detect the existence of communication between Alice and the two users. Thus, Carol requires covert transmission, and Bob requires secure and covert communication. The network utilizes a friendly jammer to address these demands and overcome the low transmission rate of covert communication. To achieve covert communication, Alice sends both users’ data simultaneously in selected time slots to hide it from Willie, while the jammer continuously transmits signals in all time slots. The objective is to maximize the average transmission rate over the allocated powers of Bob, Carol, and the jammer while meeting the two users’ requirements. A novel iterative algorithm is proposed to obtain an effective solution. Simulation results indicate that the proposed method can enhance the network’s average rate while satisfying the users’ demands.
Alice disposes of some number of secrets. She is willing to disclose one of them to Bob. Although she agrees to let him choose which secret he wants, she is not willing to allow him to gain any information on more than one secret. On the other hand, Bob does not want Alice to know which secret he wishes. An all-or-nothing disclosure is one by which, as soon as Bob has gained any information whatsoever on one of Alice's secrets, he has wasted his chances to learn anything about the other secrets. We assume that Alice is honest when she claims to be willing to disclose one secret to Bob (i.e. she is not about to send junk). The only cheating Alice is susceptible of trying is to figure out which secret is of interest to Bob. We address the following question from an information theoretic point of view: what is the most elementary disclosure problem? The main result is that the general all-or-nothing disclosure of secrets is equivalent to a much simpler problem, which we call the two-bit problem.