Dense Sphere Packings from New Codes - A table with the largest densities of sphere packings known to us in dimensions up to 200. 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. 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. 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. Check or Generator Matrices of Some Linear Codes - Examples for q up to 9. Isometry Classes of Codes - And other tables by Harald Fripertinger. 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 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.