The following pages link to On the covering radius of codes (Q3712236):
Displaying 37 items.
- Memoryless near-collisions via coding theory (Q663464) (← links)
- A Graham-Sloane type construction for \(s\)-surjective matrices (Q685994) (← links)
- The covering radius of the cycle code of a graph (Q686525) (← links)
- Upper bounds for football pool problems and mixed covering codes (Q753795) (← links)
- Completely regular codes and completely transitive codes (Q911558) (← links)
- On the covering radius of a code and its subcodes (Q917524) (← links)
- Density of constant radius normal binary covering codes (Q941385) (← links)
- 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 (Q1003680) (← links)
- A new approach to the covering radius of codes (Q1086543) (← links)
- The solution to Berlekamp's switching game (Q1115849) (← links)
- A note on the covering radius of optimum codes (Q1180145) (← links)
- All binary codes with covering radius one are subnormal (Q1182971) (← links)
- Covering bounds for codes (Q1186114) (← links)
- Orphan structure of the first-order Reed--Muller codes (Q1193446) (← links)
- Covering machines (Q1199588) (← links)
- On lengthening of covering codes (Q1199613) (← links)
- Bounds for binary multiple covering codes (Q1261015) (← links)
- Classification of cosets of the Reed-Muller code \(R(m-3,m)\) (Q1322184) (← links)
- On the normality of multiple covering codes (Q1322275) (← links)
- On \((p,1)\)-subnormal \(q\)-ary covering codes (Q1331896) (← links)
- Long binary narrow-sense BCH codes are normal (Q1352424) (← links)
- New upper bounds for binary covering codes (Q1377844) (← links)
- On saturating sets in small projective geometries (Q1580668) (← links)
- An efficient algorithm for solving the partial sum query problem (Q1602518) (← links)
- On the string consensus problem and the Manhattan sequence consensus problem (Q1698720) (← links)
- On deep holes of Gabidulin codes (Q1800701) (← links)
- Asymmetric binary covering codes. (Q1865393) (← links)
- Consensus string problem for multiple regular languages (Q2042725) (← links)
- On normal \(q\)-ary codes in Rosenbloom-Tsfasman metric (Q2449270) (← links)
- Minimal 1-saturating sets and complete caps in binary projective spaces. (Q2490862) (← links)
- Maximal metrically regular sets (Q2633509) (← links)
- Construction of new codes and its related parameters (Q2832937) (← links)
- Optimization of $$\mathsf {LPN}$$ Solving Algorithms (Q2958144) (← links)
- Optimal Covering Codes for Finding Near-Collisions (Q3084254) (← links)
- On the Covering Radius Problem for Codes I. Bounds on Normalized Covering Radius (Q3786402) (← links)
- On the Covering Radius Problem for Codes II. Codes of Low Dimension; Normal and Abnormal Codes (Q3786403) (← links)
- Upper bounds on the length function for covering codes with covering radius \(R\) and codimension \(tR+1\) (Q6112225) (← links)
