On the covering radius of codes
From MaRDI portal
Recommendations
Cited in
(83)- 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 the covering radius of cyclic linear codes and arithmetic codes
- A new approach to the covering radius of codes
- The solution to Berlekamp's switching game
- A note on the covering radius of optimum codes
- All binary codes with covering radius one are subnormal
- Covering bounds for codes
- Orphan structure of the first-order Reed--Muller codes
- An optimal polynomial for a covering radius problem
- Covering machines
- On lengthening of covering codes
- Some inequalities about the covering radius of Reed-Muller codes
- Bounds for binary multiple covering codes
- Classification of cosets of the Reed-Muller code R(m-3,m)
- On the normality of multiple covering codes
- On \((p,1)\)-subnormal \(q\)-ary covering codes
- Long binary narrow-sense BCH codes are normal
- New upper bounds for binary covering codes
- On saturating sets in small projective geometries
- An efficient algorithm for solving the partial sum query problem
- On the string consensus problem and the Manhattan sequence consensus problem
- On deep holes of Gabidulin codes
- Asymmetric binary covering codes.
- On codes with covering radius 1 and minimum distance 2
- On covering radius lower bound for a class of binary codes
- On the packing radius and the covering radius of equal-weight codes
- Consensus string problem for multiple regular languages
- On normal \(q\)-ary codes in Rosenbloom-Tsfasman metric
- Minimal 1-saturating sets and complete caps in binary projective spaces.
- Maximal metrically regular sets
- Asymptotic minimum covering radius of block codes
- Construction of new codes and its related parameters
- A coding theoretic application of Zsolt Baranyai's factorization theorem
- Optimization of \(\mathsf {LPN}\) solving algorithms
- scientific article; zbMATH DE number 4016768 (Why is no real title available?)
- Optimal covering codes for finding near-collisions
- The complexity of computing the covering radius of a code
- On octonary codes and their covering radii
- scientific article; zbMATH DE number 4160649 (Why is no real title available?)
- scientific article; zbMATH DE number 5543120 (Why is no real title available?)
- Covering radius---Survey and recent results
- Subcodes and covering radius (Corresp.)
- scientific article; zbMATH DE number 4008282 (Why is no real title available?)
- On the Covering Radius Problem for Codes I. Bounds on Normalized Covering Radius
- On the Covering Radius Problem for Codes II. Codes of Low Dimension; Normal and Abnormal Codes
- On the covering radius of binary (14, 6) codes containing the all-one vector
- Improved sphere bounds on the covering radius of codes
- scientific article; zbMATH DE number 4095515 (Why is no real title available?)
- Short codes with a given covering radius
- On the covering radius of binary codes (Corresp.)
- scientific article; zbMATH DE number 1284421 (Why is no real title available?)
- scientific article; zbMATH DE number 1057770 (Why is no real title available?)
- On the covering radius of Simplex codes
- On the Newton and covering radii of linear codes
- scientific article; zbMATH DE number 1522570 (Why is no real title available?)
- A Brief Survey of Covering Radius
- Covering properties of convolutional codes and associated lattices
- scientific article; zbMATH DE number 910954 (Why is no real title available?)
- scientific article; zbMATH DE number 1456813 (Why is no real title available?)
- On metric complements and metric regularity in finite metric spaces
- Covering radius of matrix codes endowed with the rank metric
- Consensus string problem for multiple regular languages
- Closest substring problems for regular languages
- Relations between the covering and Newton radii of binary codes
- Upper bounds on the length function for covering codes with covering radius R and codimension tR+1
- On the covering radii of extremal doubly even self-dual codes
- scientific article; zbMATH DE number 1505644 (Why is no real title available?)
- On covering problems in hierarchical poset spaces
- Further results on covering codes with radius R and codimension tR+1
- Memoryless near-collisions via coding theory
- Covering radius 1985-1994
- A Graham-Sloane type construction for \(s\)-surjective matrices
- The covering radius of the cycle code of a graph
- Constructions of covering sequences and 2D-sequences
- Cardinalities of g-difference sets
- Near-optimal covering sequences
- Upper bounds for football pool problems and mixed covering codes
- Further results on the covering radius of small codes
- Completely regular codes and completely transitive codes
- On the covering radius of a code and its subcodes
- Some optimal codes from algebraic geometry and their covering radii
- Density of constant radius normal binary covering codes
This page was built for publication: On the covering radius of codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3712236)
