Summary: ``Levenshtein first put forward the sequence reconstruction problem in 2001. This problem sets a model in which a sequence from some set is transmitted over multiple channels, and the decoder receives the different outputs. In this model, the sequence reconstruction problem is to find the minimum number of channels required to exactly recover the transmitted sequence. In the combinatorial context, the problem is equivalent to determining the maximum intersection between two balls of radius $r$, where the distance between their centers is at least $d$. The sequence reconstruction problem was studied for strings, permutations and so on. In this paper, we extend the study by Konstantinova et al. for reconstruction of permutations distorted by single Kendall $\tau$-errors. While they solved the case where the transmitted permutation can be arbitrary and the erroneous patterns are distorted by at most two Kendall $\tau$-errors, we study the setup where the transmitted permutation belongs to a permutation code of length $n$ and the erroneous patterns are distorted by at most three Kendall $\tau$-errors. In this scenario, it is shown that $n^2-n+1$ erroneous patterns are required in order to reconstruct an unknown permutation from some permutation code of minimum Kendall $\tau$-distance 2 or an arbitrary unknown permutation for any $n\geq 3$.''