This article is cited in 15 papers

Coding Theory

On Construction of Transitive Codes

F. I. Solov'eva

Sobolev Institute of Mathematics, Siberian Branch of the Russian Academy of Sciences

Abstract: 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 $\lfloor k/2\rfloor^2$ nonequivalent perfect transitive codes of length $n=2^k-1$, $k>4$. A similar result is valid for extended perfect transitive codes.

UDC: 621.391.15

Received: 05.04.2005
Revised: 30.05.2005

 English version: Problems of Information Transmission, 2005, 41:3, 204–211

Bibliographic databases:

• 
•