search for good CSS codes and give a table for parameters [n,k,(d_x,d_z)]. The distance is estimated by Covering Set algorithm, (sometimes refered as random window algorithm). It is fast, but only gives an upper bound on the distance, which approches to the actual distance when repeated long enough. The convergence speed decay exponentially with code size.
a summary is given in css.md in increasing order of n, k. each entry is the maximum d_z found for that [n, k, (d_x)]. An empty entry means nothing found for that entry.
- save corresponding codes for each entry in the table.
This table is inspired by code table