Small weight bases for Hamming codes

AbstractWe present constructions of bases for a Hamming code having small width and height, i.e. number of 1s in each row and column in the corresponding matrix. Apart from being combinatorially interesting in their own right, these bases also lead to improved embeddings of a hypercube of cliques into a same-sized hypercube

Simple Quantum Error Correcting Codes

Methods of finding good quantum error correcting codes are discussed, and many example codes are presented. The recipe C_2^{\perp} \subseteq C_1, where C_1 and C_2 are classical codes, is used to obtain codes for up to 16 information qubits with correction of small numbers of errors. The results are tabulated. More efficient codes are obtained by allowing C_1 to have reduced distance, and introducing sign changes among the code words in a systematic manner. This systematic approach leads to single-error correcting codes for 3, 4 and 5 information qubits with block lengths of 8, 10 and 11 qubits respectively.Comment: Submitted to Phys. Rev. A. in May 1996. 21 pages, no figures. Further information at http://eve.physics.ox.ac.uk/ASGhome.htm