Guided scrambling (GS) ensures the existence of good line code properties in encoded bit sequences through appropriate augmentation of the source bit stream prior to self-synchronizing scrambling. At the receiver, a framing algorithm is required in order to identify the location of the augmenting bits in the unscrambled bit sequence. This paper proposes and analyzes a self-framing algorithm for achieving frame synchronization in GS line codes. This technique is based on the observation of a large number of transitions at codeword boundaries in the encoded sequence, and does not require any additional overhead. Analysis and simulation results confirm the viability of this technique.