Let's say that I have a file that I really don't want to lose.
I want to convert the original file into $n$ files in the way that will allow me to recover the original file if I have any $m$ of the converted files. I want an algorithm that will solve this problem for any given $m$ and $n$, where $0 < m < n$.
A trivial way to do it would be to just have $n$ copies of the original file but I want the converted files to be as small as possible.
Is there a name for the problem that I am trying to describe? I tried googling things like "redundant encoding" but I was not able to find what I am looking for. Error-correction algorithms seem to deal with some bits of the file lost or corrupted but in my case each of the converted files is either lost completely or fully available and uncorrupt.
I would really appreciate if someone would tell me where to look for existing approaches to solving this problem. Thanks in advance!