On the covering radius of binary codes (Corresp.)

DOI10.1109/TIT.1978.1055928zbMATH Open0379.94017OpenAlexW2065404462MaRDI QIDQ4158944FDOQ4158944

Torleiv Kløve, Tor Helleseth, Johannes Mykkeltveit

Publication date: 1978

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/tit.1978.1055928

Recommendations

scientific article; zbMATH DE number 1522570
On the covering radius of codes
On covering radius lower bound for a class of binary codes
Asymptotic bounds on the covering radius of binary codes
On the covering radius of some binary cyclic codes
scientific article; zbMATH DE number 721640
scientific article
On the covering radius of Simplex codes
Binary codes with covering radius one: Some new lower bounds
Publication:4886131

zbMATH Keywords

covering radius first-order Reed-Muller code

Mathematics Subject Classification ID

Other types of codes (94B60) Applications of the theory of convex sets and geometry of numbers (covering radius, etc.) to coding theory (94B75)

Cited In (41)

On the covering radius of an unrestricted code as a function of the rate and dual distance
A Super-Set of Patterson--Wiedemann Functions: Upper Bounds and Possible Nonlinearities
On the least covering radius of binary linear codes of dimension 6
9-variable Boolean functions with nonlinearity 242 in the generalized rotation symmetric class
A Super-Set of Patterson-Wiedemann Functions – Upper Bounds and Possible Nonlinearities
The covering radius of Hadamard codes in odd graphs
Title not available (Why is that?)
Quantum Algorithms Related to $$\textit{HN}$$ -Transforms of Boolean Functions
Title not available (Why is that?)
Some new upper bounds on the covering radius of binary linear codes
On the combinatorial structure of a class of $\left[ \binom m 2, \binom{m-1}{2}, 3\right]$ shortened Hamming codes and their dual-codes
The covering radius of extreme binary 2-surjective codes
On triple-sum-sets and two or three weights codes
On the minimum size of binary codes with length $2R+4$ and covering radius $R$
Covering radii are not matroid invariants
The covering radius of doubled 2-designs in $2O_ k$
Asymptotic bounds on the covering radius of binary codes
Theoretical upper bounds on the covering radii of Boolean functions
Optimal binary covering codes of length 2j
Subcodes and covering radius (Corresp.)
Weight distribution and dual distance
An optimal polynomial for a covering radius problem
On covering radius lower bound for a class of binary codes
The covering radius of spherical designs
Asymptotically optimal Boolean functions
On upper bounds for code distance and covering radius of designs in polynomial metric spaces
On the size of optimal binary codes of length 9 and covering radius 1
On deep holes of Gabidulin codes
Trace codes and families of algebraic curves
Title not available (Why is that?)
Title not available (Why is that?)
Do most binary linear codes achieve the Goblick bound on the covering radius? (Corresp.)
Some inequalities about the covering radius of Reed-Muller codes
On the covering radius of Reed-Solomon codes
On the covering radius of binary (14, 6) codes containing the all-one vector
Improving the Upper Bounds on the Covering Radii of Binary Reed–Muller Codes
Highly nonlinear functions over finite fields
Another upper bound on covering radius
Further results on the covering radii of the Reed-Muller codes
Covering radius and dual distance
Good coverings of Hamming spaces with spheres

This page was built for publication: On the covering radius of binary codes (Corresp.)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4158944)