Search for
Home > Science > Math > Applications > Communication Theory > Coding Theory >

Tables
New! Submit a site
 
whatUseek Collection Sites (submit a site ):
 
Give your site great placement in this category in as little as two business days!
 
 

whatUseek Directory Site Listings:
 
Bounds on Constant Weight Codes - Tables of upper and lower bounds for the maximum size A(n,d,w) of a binary code of length n, distance d and constant weight w. Compiled by Erik Agrell, Chalmers.
 
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.
 
Dense Sphere Packings from New Codes - A table with the largest densities of sphere packings known to us in dimensions up to 200.
 
Information about Binary Linear Codes - Database of information on binary linear codes of length n (up to 300) and dimension k.
 
Isometry Classes of Codes - And other tables by Harald Fripertinger.
 
List of Tables - Links to coding theory tables.
 
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.
 
Table of 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.
 
Table of 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.
 
Table of 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.
Help build the largest human-edited directory on the web.
  Submit a Site - Open Directory Project - Become an Editor  
About   Help   Content Filter   Terms   Privacy Policy

© 2018 whatUseek