Temporal compression protocol
There are two flaws in your idea.

First, compression ratio is not the right metric.  The right metric for evaluating your scheme is the transmission rate: how long does it take to send a $n$-bit message?  The answer is that your scheme fares very poorly under that metric: it takes $\Theta(2^n)$ units of time to send a $n$-bit message.  Therefore, your scheme has very poor performance, both theoretically and practically.

Transmission rate is the right metric for a scheme that sends data over a communication channel.  Compression ratio would be suitable for a compression scheme of the form $C:\{0,1\}^n \to \{0,1\}^*$, but crucially, this requires that the output of the compression scheme can be expressed in bits.  Your protocol doesn't have that property: the output is actually trits.

This leads me to the second flaw in your idea.  Your protocol requires a communication channel that has three states (i.e., can convey one of three symbols at any point in time): "1", "0", or "I have nothing to send right now".  In other words, you need a communication channel that can send trits (0, 1, or 2), not just bits (0 or 1).  But if we had a communication channel like that, we could already achieve higher transmission rate than your scheme.  So, you're not comparing to the right baseline.

For these reasons, your scheme does not beat any information-theoretic bound and does not contradict any theoretical barrier.  It also probably won't be effective or useful in practice.