Home > Science > Math > Applications > Communication Theory > Coding Theory > Tables
Tables of codes.
http://www.mathi.uni-heidelberg.de/~yves/Matritzen/Codes/CodeMatIndex.html
Examples for q up to 9.
http://www.tcs.hut.fi/~pat/matrices.html
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.
http://www.eng.tau.ac.il/~litsyn/tablecr/
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.
http://www.mathi.uni-heidelberg.de/~yves/Papers/Sphere.html
A table with the largest densities of sphere packings known to us in dimensions up to 200.
http://www.math.unl.edu/~djaffe2/codes/webcodes/codeform.html
Database of information on binary linear codes of length n and dimension k with n <= 85 or n <= 204 and k <= 14. Searchable.
http://www.mathe2.uni-bayreuth.de/frib/codes/tables.html
And other tables by Harald Fripertinger.
http://www.tcs.hut.fi/~pat/72.html
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.
http://webfiles.portal.chalmers.se/s2/research/kit/bounds/
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.
Home > Science > Math > Applications > Communication Theory > Coding Theory > Tables
Thanks to DMOZ, which built a great web directory for nearly two decades and freely shared it with the web. About us