On Generalized Concatenated Constructions of Perfect Binary Nonlinear Codes

Problemy Peredachi Informatsii, Vol. 36, No. 4, pp. 3-17, 2000 (en russe). Traduction anglaise : Problems of Information Transmission, Vol. 36, No. 4, pp. 336-348, 2000.

Victor ZINOVIEV,
Institute for Problems of Information Transmission,
Russian Academy of Sciences,
Bol'shoi Karetnyi, 19, GSP-4, Moscow, 101447, Russia,
zinov@ippi.ras.ru

&

Antoine LOBSTEIN,
Centre National de la Recherche Scientifique,
Ecole Nationale Supérieure des Télécommunications,
46 rue Barrault, 75634 Paris cédex 13, France,
lobstein@infres.enst.fr

Abstract. Using variations of the generalized concatenation of appropriately chosen codes, we give new constructions of binary nonlinear perfect codes with minimum distance three and lowerbound the number of different codes obtained by these constructions.

 


Revenir à la page d'accueil