RUS  ENG
Full version
JOURNALS // Problemy Peredachi Informatsii // Archive
Probl. Peredachi Inf., 1997 Volume 33, Issue 4, Pages 3–14 (Mi ppi383)
This article is cited in 22 papers

Information Theory and Coding Theory

On Binary Cyclic Codes with Minimum Distance $d=3$

P. Charpin, A. Tietäväinen, V. A. Zinov'ev


Abstract: We consider binary cyclic codes of length $2^m-1$ generated by a product of two or several minimal polynomials. Sufficient conditions for the minimum distance of such a code to be equal to three are found.

UDC: 621.391.15

Received: 18.06.1996


 English version: Problems of Information Transmission, 1997, 33:4, 287–296

Bibliographic databases:

© Steklov Math. Inst. of RAS, 2024