Results 141 to 150 of about 159,834 (164)

Exact Bounds on the Sizes of Covering Codes

Designs, Codes and Cryptography, 2003
The main goal of this paper is to show how the results of extremal hypergraph theory can be applied to find connections between Turán theory and constant weight covering codes. In particular, for \(n> n_0(r)\), the authors give the exact minimum number of Hamming balls of radius \(r\) required to cover a Hamming ball of radius \(r+2\) in \(\{0,1\}^n\).
Maria Axenovich, Zoltán Füredi
openaire   +2 more sources

Constructions of nonlinear covering codes

IEEE Transactions on Information Theory, 1997
Summary: Constructions of nonlinear covering codes are given. Using any nonlinear starting code of covering radius \(R\geq 2\) these constructions form an infinite family of codes with the same covering radius. A nonlinear code is treated as a union of cosets of a linear code. New infinite families of nonlinear covering codes are obtained. Concepts of \
openaire   +2 more sources

Bounds on the Covering Radius of Linear Codes

Designs, Codes and Cryptography, 2002
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Alexei E. Ashikhmin, Alexander Barg
openaire   +1 more source

Almost cover-free codes

Problems of Information Transmission, 2016
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +2 more sources

Covering codes and combinatorial optimization

1991
It was proved by Ntafos and Hakimi in 1981 (and rediscovered recently by T. Zaslavsky and the author) that cycle codes of graphs could be completely decoded in polynomial time, by reduction to the Chinese Postman problem, and use of the Edmonds and Johnson algorithm.
openaire   +1 more source

The Covering Radius of the Third-Order Reed-Muller Code RM(3,7) is 20

IEEE Transactions on Information Theory, 2023
Jinjie Gao, Haibin Kan, Yuan Li
exaly  

Pair-Covering Codes

2024 IEEE International Symposium on Information Theory (ISIT)
Avital Boruchovsky, Tuvi Etzion, Eitan Yaakobi   +2 more
openaire   +1 more source

AN ALGORITHM FOR COMPUTING THE COVERING RADIUS OF A LINEAR CODE BASED ON VILENKIN-CHRESTENSON TRANSFORM

2022
Iliya Bouyukliev, Stefka Bouyuklieva
exaly  

The minimal covering radius t(15,6) of a six-dimensional binary linear code of length 15 is equal to 4

IEEE Transactions on Information Theory, 1988
J Simonis
exaly  

On the covering radius of the third order Reed–Muller code RM(3, 7)

Designs, Codes, and Cryptography, 2017
Qichun Wang, Chik How Tan, Theo Fanuela Prabowo   +2 more
exaly