Practical Strategy to beat the casino over the long haul [duplicate]

Question

This is another iteration of beat the casino. That question did not require a practical, implementable strategy, whereas this one does.

The rules are the same and I list them below. However, the OP answer to that question only had a theoretical result with no concrete strategy, and the accepted answer was not much of an improvement on the naive 2/3 method. I am looking for a practical, implementable result that achieves at least 70% success rate; well within the bounds of the theoretical result.

The rules are the same:

1. Each round, $A$, $B$, and the casino simultaneously decide to show a $0$ or a $1$. If all three numbers match, $A$ and $B$ win that round.
2. $A$ and $B$ are working cooperatively and can communicate before the game begins.
3. $A$ has a method, just before the game starts, to learn the choices the casino will make over all the rounds. However, after learning this information $A$ cannot communicate with $B$ in any way except by her choices in the game.
4. $A$ and $B$ are trying to maximize the fraction $p$ of rounds they win in the worst case.
5. the game lasts for $n$ rounds.

What is the best possible $p$ that $A$ and $B$ can achieve as $n \to \infty$?

NOTE: I answered the referenced question (very late) and was able to achieve 67.8% with a relatively easy to describe strategy. I provided exact details on the strategies of each player, which got fairly complicated. If your strategy is easy to describe but complicated to implement, that is fine, so long as you can show the implementation is possible.

Answer 1

Edit edit: Reverted an answer due to critical math error.

This doesn't achieve 70%, but it's an improvement based on your previous answer, so I'll post it to get started.

Assume we have one bit of information, communicating the most common answer in the next 29 rounds. We'll design a method that cycles every N rounds, and passes such a bit forward for each next iteration of the method. For those 29 rounds, Bob will always pick the answer indicated by the majority bit. Whenever Bob will be answering wrong, Alice can communicate information (14 bits). Alice can also communicate 4 bits by getting one answer wrong that Bob gets right: getting the first wrong communicates 0000, the second communicates 0001, all the way up to getting the fifteenth wrong: 1110. 1111 is represented by Alice choosing to get none of the answers wrong. One of the bits will be the majority bit for the next batch. 15 of those bits can be spent to tell Bob the next 15 answers, (leaving us with 2 bits unspent), and again Alice can get one of those 15 answers wrong to communicate 4 additional bits (again with 1111 being represented by getting all answers right). We then use the remaining 6 bits to communicate the next 6 answers.

So we get 14 of the first 29 right, 14 of the next 15 right, and 6 of the next 6 right, 34/50 = 68%.

This can be improved further: consider three of these 50-game batches: we always win game 45-50, 95-100 and 145-50. By choosing to lose one of those games we can communicate an additional 4 bits of information about the answers for 151-154.

So for every 154-game period, we get 34/50, 34/50, 34/50, -1 for the game we sacrifice from [45-50,95-100,145-150], + 4/4 = 68.2%

We could cut the above a little finer still (instead sacrifice two games from [45-50,95-100,145-150,195-200,245-250] in order to get 8 bits, then look at [251-258, 509-516] and sacrifice one of them to get an additional 4 bits...) but that's a pit of diminishing returns that I doubt will take us above 70%.