  This is a correction by the authors to "Byzantine Agreement in Expected
Polynomial Time" which appeared in the Journal of the ACM in 2016. It corrects
a failure in the paper to consider the adversary's ability to decide the number
of fair coinflips in an iteration, where this number ranges between n(n-t) and
n(n-2t).
