The inherent problem of a variable-length code is that even a single bit error can cause loss of synchronization and may lead to error propagation. Synchronizing codewords have been extensively studies as a mean to overcome the drawback and efficiently stop error propagation. In this extended summary, first we prove the restatement [Theorem 2, 13] of a result originally given in [1] in a more straightforward way. Next, we present the necessary conditions for the existence of a binary Huffman equivalent code with shortest synchronizing codeword(s). Finally, with the help of derived conditional equations, a unified approach for constructing a binary Huffman equivalent code with most shortest synchronizing codeword(s) and most other synchronizing codewords is proposed also.