|
Problemy Peredachi Informatsii, 1974, Volume 10, Issue 3, Pages 36–44
(Mi ppi1040)
|
|
|
|
This article is cited in 4 scientific papers (total in 4 papers)
Coding Theory
Construction of a Class of Linear Binary Codes Achieving the Varshamov?Griesmer Bound
B. I. Belov, V. N. Logachev, V. P. Sandimirov
Abstract:
A class of optimal (in the sense of achieving the Varshamov–Griesmer bound) linear binary codes is described; it is strictly included in the class of Solomon–Stiffler codes. A subclass of the given class of codes is constructively defined for the case of relatively small code distances.
Received: 13.02.1973 Revised: 19.02.1974
Citation:
B. I. Belov, V. N. Logachev, V. P. Sandimirov, “Construction of a Class of Linear Binary Codes Achieving the Varshamov?Griesmer Bound”, Probl. Peredachi Inf., 10:3 (1974), 36–44; Problems Inform. Transmission, 10:3 (1974), 211–217
Linking options:
https://www.mathnet.ru/eng/ppi1040 https://www.mathnet.ru/eng/ppi/v10/i3/p36
|
Statistics & downloads: |
Abstract page: | 537 | Full-text PDF : | 461 |
|