Large constant dimension codes and lexicodes

  title={Large constant dimension codes and lexicodes},
  author={Natalia Silberstein and Tuvi Etzion},
  journal={Adv. in Math. of Comm.},
Constant dimension codes, with a prescribed minimum distance, have found recently an application in network coding. All the codewords in such a code are subspaces of Fq with a given dimension. A computer search for large constant dimension codes is usually inefficient since the search space domain is extremely large. Even so, we found that some constant… CONTINUE READING