|
Problemy Peredachi Informatsii, 1990, Volume 26, Issue 4, Pages 38–55
(Mi ppi628)
|
|
|
|
Information Theory and Coding Theory
Construction of Linear Covering Codes
A. A. Davydov
Abstract:
A linear covering code construction is proposed, which given any binary code with covering radius $R$ constructs an infinite family of binary codes with the same covering radius. Infinite families of $R\ge 2$ linear binary covering codes are constructed with better parameters than known codes.
Received: 21.06.1989 Revised: 25.06.1990
Citation:
A. A. Davydov, “Construction of Linear Covering Codes”, Probl. Peredachi Inf., 26:4 (1990), 38–55; Problems Inform. Transmission, 26:4 (1990), 317–331
Linking options:
https://www.mathnet.ru/eng/ppi628 https://www.mathnet.ru/eng/ppi/v26/i4/p38
|
Statistics & downloads: |
Abstract page: | 295 | Full-text PDF : | 268 |
|