RUS  ENG
Full version
JOURNALS // Problemy Peredachi Informatsii // Archive

Probl. Peredachi Inf., 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.

UDC: 621.391.15

Received: 21.06.1989
Revised: 25.06.1990


 English version:
Problems of Information Transmission, 1990, 26:4, 317–331

Bibliographic databases:


© Steklov Math. Inst. of RAS, 2024