On binary cyclic codes with d=3


Pascale Charpin
INRIA, projet CODES
BP 105
78153 Le Chesnay Cedex, France
Pascale.Charpin@inria.fr

Aimo Tietavainen
Department of Mathematics
University of Turku
FIN-20014 Turku, Finland

Victor Zinoviev
Institute for Problems of Information Transmission
Bol'shoi Karetnyi 19
GSP-4 Moscow 101447, Russia

Problems of Information Transmission, 33(3): 3-14, 1997.

Abstract

We consider binary cyclic codes of length 2m-1 generated by a product of two or several minimal polynomials. Sufficient conditions, that the minimum distance of such a code is three, are found. We point out the link with the factorization of some trinomials.