Tables (Coding Theory)

Tables Sites:

Information about Binary Linear Codes Information about Binary Linear Codes: Database of information on binary linear codes of length n and dimension k with n <= 85 or n <= 204 and k <= 14. Searchable. (Tables) http://www.math.unl.edu/~djaffe/codes/webcodes/codeform.html Covering Codes Covering Codes: The best known bounds on the size of binary covering codes of length up to 33 and covering radius up to 10. Compiled by Simon Litsyn. (Tables) http://www.eng.tau.ac.il/~litsyn/tablecr/ Classifying Subspaces of Hamming Spaces Classifying Subspaces of Hamming Spaces: By P. R. J. Östergård. The following codes with minimum distance greater than or equal to 3 are classified: binary codes up to length 14, ternary codes up to length 11, and quaternary codes up to length 10. (Tables) http://www.tcs.hut.fi/~pat/matrices.html Constant Weight Binary Codes Constant Weight Binary Codes: Lower bounds (and in some cases exact values) for A(n,d,w), the size of the largest binary code of length n, distance d and constant weight w. (Tables) http://www.research.att.com/~njas/codes/Andw/ Lower Bounds and Encoding Circuits for Weakly Self-dual CSS Codes Lower Bounds and Encoding Circuits for Weakly Self-dual CSS Codes: A table of codes up to length 32 encoding up to 30 qubits. (Tables) http://iaks-www.ira.uka.de/home/grassl/QECC/CSS/ Isometry Classes of Codes Isometry Classes of Codes: And other tables by Harald Fripertinger. (Tables) http://www.mathe2.uni-bayreuth.de/frib/codes/tables.html Optimal One-Error-Correcting Codes Optimal One-Error-Correcting Codes: Optimal binary one-error-correcting codes of length 10 have 72 codewords. Tables to supplement the paper published in IEEE-IT 45 by P.R.J. Östergård, T. Baicheva and E. Kolev. (Tables) http://www.tcs.hut.fi/~pat/72.html Nonlinear Binary Codes Nonlinear Binary Codes: Lower bounds (and in some cases exact values) for A(n,d), the size of the largest binary code of length n and minimal distance d. (Tables) http://www.research.att.com/~njas/codes/And/ Database on Binary Quasi-Cyclic Codes Database on Binary Quasi-Cyclic Codes: Interactive page to find the code parameters (generator polynomials and weight distribution) and references. (Tables) http://www.tec.hkr.se/~chen/research/codes/searchqc2.htm Tables of Binary Block Codes Tables of Binary Block Codes: Tables of bounds on the size of binary unrestricted codes, constant-weight codes, doubly-bounded-weight codes, and doubly-constant-weight codes. Compiled by Erik Agrell, Chalmers. (Tables) http://www.s2.chalmers.se/~agrell/bounds/ Check or Generator Matrices of Some Linear Codes Check or Generator Matrices of Some Linear Codes: Examples for q up to 9. (Tables) http://www.mathi.uni-heidelberg.de/~yves/Matritzen/Codes/CodeMatIndex.html Bounds on the Minimum Distance of Linear Codes Bounds on the Minimum Distance of Linear Codes: Fill in q, n, k, and get bounds on the maximal minimum distance of the linear codes over GF(q) with length n and dimension k. (Tables) http://www.win.tue.nl/~aeb/voorlincod.html Dense Sphere Packings from New Codes Dense Sphere Packings from New Codes: A table with the largest densities of sphere packings known to us in dimensions up to 200. (Tables) http://www.mathi.uni-heidelberg.de/~yves/Papers/Sphere.html