Tables Coding Theory Communication Theory Applications

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.

• Top/Science/Math/Reference/Tables

• Database on Binary Quasi-Cyclic Codes - Interactive page to find the code parameters (generator tables polynomials and weight distribution) and references.
• Optimal One-Error-Correcting Codes - Optimal binary one-error-correcting codes of length 10 have tables 72 codewords. coding theory Tables to supplement the paper tables published in IEEE-IT coding theory 45 by P.R.J. Östergård, tables T. Baicheva and E. Kolev.
• Classifying Subspaces of Hamming Spaces - By P. R. J. Östergård. The following tables codes with coding theory minimum distance greater than or equal tables to 3 are classified: coding theory binary codes up to tables length 14, ternary codes up to coding theory length 11, tables and quaternary codes up to length 10.
• Tables of Binary Block Codes - Tables of bounds on the size of binary unrestricted codes, communication theory constant-weight codes, doubly-bounded-weight codes, and doubly-constant-weight codes. Compiled communication theory by Erik Agrell, Chalmers.
• Check or Generator Matrices of Some Linear Codes - Examples for q up to 9.
• Nonlinear Binary Codes - Lower bounds (and in some cases exact values) for A(n,d), communication theory the size of the largest binary code of length n communication theory and minimal distance d.
• Information about Binary Linear Codes - Database of information on binary linear codes of coding theory length n and dimension k with n <= coding theory 85 or n <= 204 and k <= coding theory 14. Searchable.
• Bounds on the Minimum Distance of Linear Codes - Fill in q, n, k, and get bounds communication theory on communication theory the maximal minimum distance of the linear communication theory codes communication theory over GF(q) with length n and communication theory dimension k.
• Isometry Classes of Codes - And other tables by Harald Fripertinger.
• Constant Weight Binary Codes - Lower bounds (and in some cases exact values) for A(n,d,w), communication theory the size of the largest binary code of length n, communication theory distance d and constant weight w.
• Dense Sphere Packings from New Codes - A table with the largest densities of sphere coding theory packings known to us in dimensions up coding theory to 200.
• Lower Bounds and Encoding Circuits for Weakly Self-dual CSS Codes - A table of codes up to length 32 encoding up to 30 qubits.
• Covering Codes - The best known bounds on the size of communication theory binary covering codes of length up to 33 communication theory and covering radius up to 10. Compiled communication theory by Simon Litsyn.

   MySQL - Cache Direct