The following pages link to (Q4342497):
Displayed 50 items.
- Ternary covering codes derived from BCH codes (Q1374190) (← links)
- Tiling Hamming space with few spheres (Q1374207) (← links)
- On saturating sets in projective spaces. (Q1399903) (← links)
- \(K_{5}(7,3) \leqslant 100\). (Q1421340) (← links)
- New quaternary linear codes with covering radius 2 (Q1570227) (← links)
- On saturating sets in small projective geometries (Q1580668) (← links)
- Optimal codes for strong identification (Q1612759) (← links)
- Families of optimal codes for strong identification (Q1613402) (← links)
- Explicit characterization of two classes of regular bent functions (Q1633169) (← links)
- Two infinite classes of rotation symmetric bent functions with simple representation (Q1647742) (← links)
- On regular and new types of codes for location-domination (Q1671339) (← links)
- Dimension 1 sequences are close to randoms (Q1680550) (← links)
- Binary frames with prescribed dot products and frame operator (Q1684559) (← links)
- On the covering radius of the third order Reed-Muller code \(\mathrm{RM}(3, 7)\) (Q1692157) (← links)
- Saturating sets in projective planes and hypergraph covers (Q1699553) (← links)
- New bounds on the covering radius of the second order Reed-Muller code of length 128 (Q1733981) (← links)
- Asymptotically optimal Boolean functions (Q1734702) (← links)
- Lower bound of the covering radius of irreducible Goppa codes (Q1743278) (← links)
- Switching of covering codes (Q1744765) (← links)
- De Bruijn covering codes with arbitrary alphabets (Q1775727) (← links)
- Covering radius for sets of permutations (Q1779486) (← links)
- Several infinite families of \(p\)-ary weakly regular bent functions (Q1783727) (← links)
- A connection between sumsets and covering codes of a module (Q1785002) (← links)
- The domination complexity and related extremal values of large 3D torus (Q1791110) (← links)
- The existence of perfect codes in a family of generalized Fibonacci cubes (Q1799596) (← links)
- Bounds for optimal coverings (Q1827869) (← links)
- A deterministic \((2-2/(k+1))^{n}\) algorithm for \(k\)-SAT based on local search. (Q1853552) (← links)
- Asymmetric binary covering codes. (Q1865393) (← links)
- How long does it take to generate a group? (Q1868919) (← links)
- Generating binary spaces. (Q1873815) (← links)
- An improved upper bound for the football pool problem for nine matches (Q1873825) (← links)
- On coset leader graphs of structured linear codes (Q1985294) (← links)
- On planes through points off the twisted cubic in \(\mathrm{PG}(3,q)\) and multiple covering codes (Q1994925) (← links)
- A trigonometric sum sharp estimate and new bounds on the nonlinearity of some cryptographic Boolean functions (Q1999897) (← links)
- On a conjecture regarding identification in Hamming graphs (Q2001977) (← links)
- Multiple coverings of the farthest-off points with small density from projective geometry (Q2018430) (← links)
- On the higher-order nonlinearity of a Boolean bent function class (constructed via Niho power functions) (Q2088953) (← links)
- Hat problem: a new strategy based on quantum stabilizer codes (Q2107049) (← links)
- More permutations and involutions for constructing bent functions (Q2119853) (← links)
- On cutting blocking sets and their codes (Q2121527) (← links)
- Constructing saturating sets in projective spaces using subgeometries (Q2168075) (← links)
- Several new classes of self-dual bent functions derived from involutions (Q2179494) (← links)
- A new lower bound on the second-order nonlinearity of a class of monomial bent functions (Q2179505) (← links)
- On metric regularity of Reed-Muller codes (Q2220768) (← links)
- The multicovering radius problem for some types of discrete structures (Q2248636) (← links)
- On \(t\)-revealing codes in binary Hamming spaces (Q2272993) (← links)
- Tolerant location detection in sensor networks (Q2280052) (← links)
- Constructions of \(r\)-identifying codes and \((r, \leq l)\)-identifying codes (Q2283219) (← links)
- Covering radius of permutation groups with infinity-norm (Q2297719) (← links)
- Partition-balanced families of codes and asymptotic enumeration in coding theory (Q2299619) (← links)