What does an admissible numbering of computable functions look like?
The encodings you mention are admissible. Why do you think they need to be bijections?
In fact, there is no admissible numbering of partial computable maps that is a bijection. If there were one, we could decide equality if partial computable maps, which would allow us to implement the Halting oracle.