Let's assume I want to send a secret message to $N$ recipients in an asymmetric way.
My message could be encrypted with $N$ different public keys $p_i$ one after another and send to each user individually. In practice only a symmetric key $k$ is sent in an asymmetric way I guess, but that's not the point.
Even direct symmetric encryption comes into mind where the key $k$ is encrypted with each $p_i$ once and attached to message body afterwards. Of course the message length grows with rising $N$.
So I wonder if there is an encryption function having $N$ public keys as input. This fixed length encrypted message should be decrypted by corresponding private keys only. Is this possible?
By the way: Is this concept similar to TV channel encryption?