Uniquely Decodable Code Pairs (UDCPs) have been studied in coding theory for several decades. The currently best UDCPs known (having the highest rate) were found by Mattas and Östergård [1] in 2005 by an exhaustive search over small codes. The objective of this project is to find better UDCPs by an expanded search over small codes, leveraging both the increased computing power available today compared to 2005, as well as insights into the structure of good codes to narrow down the search space. [1] Mikael Mattas and Patric R. J. Östergård. “A new bound for the zero-error capacity region of the two-user binary adder channel”. In: IEEE Transactions on Information Theory 51 (9) (2005), pp. 3289–3291.