 |
|  |
||||||||||
 |
||||||||||||
  |
||||||||||||
|
Check or Generator Matrices of Some Linear Codes
Examples for q up to 9.
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.
Database on Binary Quasi-Cyclic Codes
Interactive page to find the code parameters (generator polynomials and weight distribution) and references.
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.
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.
|
|
||
 |
|||