Information Transmission;
Projective Geometry;
Primitive Element;
Coordinate Position;
Simple Component;
D O I:
暂无
中图分类号:
学科分类号:
摘要:
We suggest a construction of perfect q-ary codes by sequential switchings of special-type components (called simple components) of the Hamming code. We prove that such components are minimal. The construction yields a lower bound on the number of different q-ary codes; this is presently the best known bound. We show that this bound cannot be substantially improved using switchings of components of this type.