Results 281 to 290 of about 87,508 (304)
Some of the next articles are maybe not open access.
On the covering radius of convolutional codes
1994We consider a problem of calculating covering capabilities for convolutional codes. An upper bound on covering radius for convolutional code is obtained by random coding arguments. The estimates on covering radius for some codes with small constraint length are presented.
Irina E. Bocharova, Boris D. Kudryashov
openaire +1 more source
Exact Bounds on the Sizes of Covering Codes
Designs, Codes and Cryptography, 2003The 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, 1997Summary: 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, 2002zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Alexei E. Ashikhmin, Alexander Barg
openaire +1 more source
Problems of Information Transmission, 2016
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
Covering codes and combinatorial optimization
1991It 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
2024 IEEE International Symposium on Information Theory (ISIT)
Avital Boruchovsky +2 more
openaire +1 more source
Avital Boruchovsky +2 more
openaire +1 more source
Packing and Covering Properties of Rank Metric Codes
IEEE Transactions on Information Theory, 2008Maximilien Gadouleau, Zhiyuan Yan
exaly
Divisibility properties for covering radius of certain cyclic codes
IEEE Transactions on Information Theory, 2003O Moreno
exaly