On the Construction of Transitive Codes

Problems of Information Transmission - Tập 41 - Trang 204-211 - 2005
F. I. Solov'eva1
1Sobolev Institute of Mathematics, Siberian Branch RAS, Novosibirsk, Russia

Tóm tắt

Application of some known methods of code construction (such as the Vasil'ev, Plotkin, and Mollard methods) to transitive codes satisfying certain auxiliary conditions yields infinite classes of large-length transitive codes, in particular, at least ⌊k/2⌋2 nonequivalent perfect transitive codes of length n = 2 k − 1, k > 4. A similar result is valid for extended perfect transitive codes.

Tài liệu tham khảo

Malyugin, S.A., Transitive Perfect Codes of Length 15, in Proc. Int. Workshop on Discrete Analysis and Operation Research, Novosibirsk, Russia, 2004, p. 96.

Malyugin, S.A., On Equivalence Classes of Perfect Binary Codes of Length 15, Preprint of Inst. Math., Siberian Branch of the RAS, Novosibirsk, 2004, no. 138.

Vasil'ev, Yu.L., On Nongroup Closely Packed Codes, Probl. Kibern., 1962, vol. 8, pp. 337–339.

Borges, J., Phelps, K.T., and Rifa, J., The Rank and Kernel of Extended 1-Perfect ℤ4-Linear and Additive Non-ℤ4-Linear Codes, IEEE Trans. Inform. Theory, 2003, vol. 49, no.8, pp. 2028–2034.

Solov'eva, F.I., On Transitive Codes, in Proc. Int. Workshop on Discrete Analysis and Operation Research, Novosibirsk, Russia, 2004, p. 99.