Descriptions of Groups of Prime-power Order

We describe in some detail an algorithm which is an important ingredient in the performance of programs for working with descriptions of groups of prime-power order. It is an algorithm for computing a useful power-commutator presentation for thep-covering group of a group given by a power-commutator presentation. We prove that the algorithm is correct and give some examples.