The following pages link to (Q4342497):
Displaying 50 items.
- On the ensemble of optimal identifying codes in a twin-free graph (Q267807) (← links)
- Quasi-perfect linear codes from planar and APN functions (Q269565) (← links)
- On the second-order nonlinearity of the hidden weighted bit function (Q323078) (← links)
- On the number of solutions of certain diagonal equations over finite fields (Q324291) (← links)
- Further results on multiple coverings of the farthest-off points (Q326345) (← links)
- Variation on correlation immune Boolean and vectorial functions (Q340189) (← links)
- Saturating Sperner families (Q367051) (← links)
- On optimal binary codes with unbalanced coordinates (Q371241) (← links)
- Remoteness of permutation codes (Q427818) (← links)
- The lower bound on the second-order nonlinearity of a class of Boolean functions with high nonlinearity (Q429740) (← links)
- Random low-degree polynomials are hard to approximate (Q430841) (← links)
- On the covering radius of some modular codes (Q476335) (← links)
- Supersaturation and stability for forbidden subposet problems. (Q490923) (← links)
- A new binary code of length 16 and minimum distance 3 (Q495687) (← links)
- Bent vectorial functions and linear codes from o-polynomials (Q499659) (← links)
- On the nonlinearity of S-boxes and linear codes (Q507951) (← links)
- Lower bound of covering radius of binary irreducible Goppa codes (Q510450) (← links)
- A survey and classification of Sierpiński-type graphs (Q516890) (← links)
- On perfect codes in Cartesian products of graphs (Q627927) (← links)
- Switching codes and designs (Q658111) (← links)
- Memoryless near-collisions via coding theory (Q663464) (← links)
- On identifying codes in binary Hamming spaces (Q696908) (← links)
- New bounds on the distance distribution of extended Goppa codes (Q700157) (← links)
- Covering and radius-covering arrays: constructions and classification (Q708354) (← links)
- Weighted codes in Lee metrics (Q735023) (← links)
- The string guessing problem as a method to prove lower bounds on the advice complexity (Q744093) (← links)
- On the resilience of Even-Mansour to invariant permutations (Q831175) (← links)
- On the lower bounds of the second order nonlinearities of some Boolean functions (Q845338) (← links)
- On a new class of identifying codes in graphs (Q845971) (← links)
- Further results on the covering radius of small codes (Q861794) (← links)
- Small complete caps in Galois affine spaces (Q871280) (← links)
- Improved algorithms for quantum identification of Boolean oracles (Q884445) (← links)
- The covering problem in Rosenbloom-Tsfasman spaces (Q888588) (← links)
- Galois geometries and coding theory (Q908053) (← links)
- Density of constant radius normal binary covering codes (Q941385) (← links)
- New bounds on binary identifying codes (Q947104) (← links)
- Adaptive identification in graphs (Q958720) (← links)
- Improved bounds on identifying codes in binary Hamming spaces (Q966138) (← links)
- Bounds for short covering codes and reactive tabu search (Q968171) (← links)
- Quotients of Gaussian graphs and their application to perfect codes (Q975827) (← links)
- Lower bounds on covering codes via partition matrices (Q1003655) (← 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)
- On the minimum size of binary codes with length \(2R+4\) and covering radius \(R\) (Q1009034) (← links)
- Upper bounds for binary identifying codes (Q1012154) (← links)
- Linear programming bounds for codes via a covering argument (Q1017926) (← links)
- On the size of identifying codes in binary hypercubes (Q1024996) (← links)
- A remark on Haas' method (Q1025956) (← links)
- Linear codes for high payload steganography (Q1028424) (← links)
- Coverings, centered codes, and combinatorial steganography (Q1049396) (← links)
- Covering and packing problems in lattices associated with the \(n\)-cube (Q1348769) (← links)
