|
Problemy Peredachi Informatsii, 1997, Volume 33, Issue 4, Pages 3–14
(Mi ppi383)
|
|
|
|
This article is cited in 22 scientific papers (total 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.
Received: 18.06.1996
Citation:
P. Charpin, A. Tietäväinen, V. A. Zinov'ev, “On Binary Cyclic Codes with Minimum Distance $d=3$”, Probl. Peredachi Inf., 33:4 (1997), 3–14; Problems Inform. Transmission, 33:4 (1997), 287–296
Linking options:
https://www.mathnet.ru/eng/ppi383 https://www.mathnet.ru/eng/ppi/v33/i4/p3
|
Statistics & downloads: |
Abstract page: | 462 | Full-text PDF : | 192 | First page: | 2 |
|