Pages that link to "Item:Q4158944"

The following pages link to On the covering radius of binary codes (Corresp.) (Q4158944):

Displaying 38 items.

• On the least covering radius of binary linear codes of dimension 6 (Q540386) (← links)
• On triple-sum-sets and two or three weights codes (Q795016) (← links)
• Covering radius and dual distance (Q811480) (← links)
• 9-variable Boolean functions with nonlinearity 242 in the generalized rotation symmetric class (Q963062) (← 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)
• The covering radius of extreme binary 2-surjective codes (Q1008977) (← links)
• On the minimum size of binary codes with length \(2R+4\) and covering radius \(R\) (Q1009034) (← links)
• Good coverings of Hamming spaces with spheres (Q1068057) (← links)
• The covering radius of spherical designs (Q1178026) (← links)
• A note on the covering radius of optimum codes (Q1180145) (← links)
• Trace codes and families of algebraic curves (Q1188024) (← links)
• The covering radius of Hadamard codes in odd graphs (Q1199453) (← links)
• An optimal polynomial for a covering radius problem (Q1199501) (← links)
• Some inequalities about the covering radius of Reed-Muller codes (Q1200290) (← links)
• On the covering radius of Reed-Solomon codes (Q1318799) (← links)
• Weight distribution and dual distance (Q1320444) (← links)
• On the covering radius of an unrestricted code as a function of the rate and dual distance (Q1383375) (← links)
• Asymptotically optimal Boolean functions (Q1734702) (← links)
• On deep holes of Gabidulin codes (Q1800701) (← links)
• Further results on the covering radii of the Reed-Muller codes (Q1802196) (← links)
• On upper bounds for code distance and covering radius of designs in polynomial metric spaces (Q1805056) (← links)
• On covering radius lower bound for a class of binary codes (Q1897944) (← links)
• Highly nonlinear functions over finite fields (Q2302588) (← links)
• The covering radius of the Reed-Muller code \(\text{RM}(2, 7)\) is \(40\) (Q2329210) (← links)
• Covering radii are not matroid invariants (Q2484374) (← links)
• Optimal binary covering codes of length 2j (Q3376666) (← links)
• Improving the Upper Bounds on the Covering Radii of Binary Reed–Muller Codes (Q3548051) (← links)
• (Q3620562) (← links)
• Do most binary linear codes achieve the Goblick bound on the covering radius? (Corresp.) (Q3752296) (← links)
• Subcodes and covering radius (Corresp.) (Q3757823) (← links)
• Some new upper bounds on the covering radius of binary linear codes (Q3824229) (← links)
• (Q4510805) (← links)
• On the size of optimal binary codes of length 9 and covering radius 1 (Q4544695) (← links)
• A Super-Set of Patterson--Wiedemann Functions: Upper Bounds and Possible Nonlinearities (Q4601216) (← links)
• Theoretical upper bounds on the covering radii of Boolean functions (Q4670760) (← links)
• A Super-Set of Patterson-Wiedemann Functions – Upper Bounds and Possible Nonlinearities (Q5267804) (← links)
• Quantum Algorithms Related to $$\textit{HN}$$ -Transforms of Boolean Functions (Q5739043) (← links)
• The covering radius of doubled 2-designs in \(2O_ k\) (Q5905437) (← links)