Pages that link to "Item:Q3799949"
From MaRDI portal
The following pages link to Improved sphere bounds on the covering radius of codes (Q3799949):
Displaying 30 items.
- (Total) domination in prisms (Q510330) (← links)
- Memoryless near-collisions via coding theory (Q663464) (← links)
- Frequency computation and bounded queries (Q671360) (← links)
- Upper bounds for football pool problems and mixed covering codes (Q753795) (← links)
- On the non-existence of certain perfect mixed codes (Q753797) (← links)
- Generalized bounds and binary/ternary mixed packing and covering codes (Q803109) (← links)
- Lower asymptotic bound on the number of linear code words in a sphere of given radius in \(F_ q^ n\). (Q1098823) (← links)
- The solution to Berlekamp's switching game (Q1115849) (← links)
- Bounds on packings and coverings by spheres in \(q\)-ary and mixed Hamming spaces (Q1176382) (← links)
- All binary codes with covering radius one are subnormal (Q1182971) (← links)
- Bounds for binary multiple covering codes (Q1261015) (← links)
- On lower bounds for covering codes (Q1281409) (← links)
- Lower bounds for \(q\)-ary coverings by spheres of radius one (Q1331134) (← links)
- Binary codes with covering radius one: Some new lower bounds (Q1377682) (← links)
- Improved linear programming bounds for antipodal spherical codes. (Q1611074) (← links)
- Random and conditional \((t,k)\)-diagnosis of hypercubes (Q1679217) (← links)
- Switching of covering codes (Q1744765) (← links)
- Constructive spherical codes near the Shannon bound (Q1934239) (← links)
- Upper bounds for energies of spherical codes of given cardinality and separation (Q2200514) (← links)
- Partial sums of binomials, intersecting numbers, and the excess bound in Rosenbloom-Tsfasman space (Q2322444) (← links)
- Independent domination in hypercubes (Q2367974) (← links)
- Improved Delsarte bounds for spherical codes in small dimensions (Q2642026) (← links)
- Optimal Covering Codes for Finding Near-Collisions (Q3084254) (← links)
- Sphere-bound-achieving coset codes and multilevel coset codes (Q4503580) (← links)
- Upper bounds on the minimum distance of spherical codes (Q4896843) (← links)
- On the general excess bound for binary codes with covering radius one (Q5891409) (← links)
- On the general excess bound for binary codes with covering radius one (Q5900076) (← links)
- On domatic and total domatic numbers of Cartesian products of graphs (Q6102218) (← links)
- Improved lower bounds on the domination number of hypercubes and binary codes with covering radius one (Q6184529) (← links)
- Packings in bipartite prisms and hypercubes (Q6197743) (← links)
