It is known that random quantum codes almost surely have linear distance, and in fact almost surely attain the so-called quantum Gilbert-Varshamov bound. I list two families of random quantum codes:
- random subspaces (the least structure)
- random stabilizer codes (impose at least some stabilizer structure)
Concatenated quantum codes can also attain the Gilbert-Varshamov bound. For example, one can concatenate the quantum Reed-Solomon outer code with random inner codes.
For explicit codes with large linear distance, there are the algebraic geometry codes, and also the quantum Justesen codes, and also many more. When making quantum codes on qudits, provided that the dimension of the qudit is more than 7, the algebraic geometry codes outperform the random codes almost surely
Kitaev's toric code does not have linear distance. The ratio of the distance to the number of qubits approaches zero as the number of qubits approaches infinity.