Directory Help Search only in TablesSearch the Web

Tables

Science > Math > Applications > Communication Theory > Coding Theory > Tables

Go to Directory Home

Web Pages

Viewing in Google PageRank order               View in alphabetical order

	Bounds on the Minimum Distance of Linear Codes - http://www.win.tue.nl/~aeb/voorlincod.html 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.
	Constant Weight Binary Codes - http://www.research.att.com/~njas/codes/Andw/ 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.
	Optimal One-Error-Correcting Codes - 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.
	Check or Generator Matrices of Some Linear Codes - http://www.mathi.uni-heidelberg.de/~yves/Matritzen/Codes/CodeMatIndex.html Examples for q up to 9.
	Database on Binary Quasi-Cyclic Codes - http://www.tec.hkr.se/~chen/research/codes/searchqc2.htm Interactive page to find the code parameters (generator polynomials and weight distribution) and references.

	Isometry Classes of Codes - http://www.mathe2.uni-bayreuth.de/frib/codes/tables.html And other tables by Harald Fripertinger.
	Information about Binary Linear Codes - 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.
	Tables of Binary Block Codes - 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.
	Nonlinear Binary Codes - http://www.research.att.com/~njas/codes/And/ 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.
	Covering Codes - 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.

	Dense Sphere Packings from New Codes - 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.
	Classifying Subspaces of Hamming Spaces - 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.
	Lower Bounds and Encoding Circuits for Weakly Self-dual CSS Codes - http://iaks-www.ira.uka.de/home/grassl/QECC/CSS/ A table of codes up to length 32 encoding up to 30 qubits.

Help build the largest human-edited directory on the web. Submit a Site - Open Directory Project - Become an Editor

Modified by Google - ©2009 Google
Advertise with Us - Jobs, Press, Cool Stuff...