Digital logic design /circuit
The boolean expression A'BC+AB'C+ ABC' corresponds to the following K-Map:

As you can see, there are no adjacent 1 values in the map, therefore the S.O.P expression above is in fact, the most minimized.
If you don't want to use a K-Map, or want to double check your answer, you can use sites like these.