The following pages link to P. G. Boyvalenkov (Q510490):
Displayed 50 items.
- Universal lower bounds on energy and LP-extremal polynomials for \((4, 24)\)-codes (Q1743285) (← links)
- Covering a ball with smaller equal balls in \(\mathbb R^n\) (Q1764179) (← links)
- Lattices of optimal finite lattice packings (Q1769065) (← links)
- Optimal substructures in optimal and approximate circle packings (Q1770344) (← links)
- New results on codes with covering radius 1 and minimum distance \(2\) (Q1781002) (← links)
- Some constructions of superimposed codes in Euclidean spaces. (Q1811096) (← links)
- The answer to Woodall's musquash problem (Q1817562) (← links)
- Linear programming bounds for codes in infinite projective spaces (Q1818899) (← links)
- Perfect square packings (Q1841223) (← links)
- All lambda-designs with \(\lambda = 2 p\) are type-1 (Q1841522) (← links)
- Ternary constant weight codes (Q1856335) (← links)
- On minimum kissing numbers of finite translative packings of a convex body (Q1856596) (← links)
- Power-sequence terraces for \({\mathbb Z}_n\) where \(n\) is an odd prime power (Q1861280) (← links)
- Existence of cyclic \(k\)-cycle systems of the complete graph (Q1861284) (← links)
- Improvement of the Delsarte bound for \(\tau\)-designs when it is not the best bound possible (Q1869830) (← links)
- Lattice packings with gap defects are not completely saturated (Q1875921) (← links)
- Extremal polynomials for obtaining bounds for spherical codes and designs (Q1895969) (← links)
- Computing distance distributions of spherical designs (Q1899412) (← links)
- A method for cutting squares into distinct squares (Q1961234) (← links)
- Divisible designs associated with translation planes admitting a 2-transitive collineation group on the points at infinity (Q1972870) (← links)
- Linear programming bounds for covering radius of spherical designs (Q2038844) (← links)
- A cap covering theorem (Q2064753) (← links)
- From primary to dual affine variety codes over the Klein quartic (Q2115735) (← links)
- Rationality of the inner products of spherical \(s\)-distance \(t\)-designs for \(t \geq 2s - 2\), \(s \geq 3\) (Q2134559) (← links)
- On \(q\)-ary codes with two distances \(d\) and \(d+1\) (Q2190983) (← links)
- Upper bounds for energies of spherical codes of given cardinality and separation (Q2200514) (← links)
- Upper energy bounds for spherical designs of relatively small cardinalities (Q2223636) (← links)
- Investigation of binary orthogonal arrays via their distance distributions (Q2262981) (← links)
- Refinements of Levenshtein bounds in \(q\)-ary Hamming spaces (Q2278701) (← links)
- Energy bounds for codes in polynomial metric spaces (Q2318064) (← links)
- Lower bounds for \(q\)-ary codes with large covering radius (Q2380299) (← links)
- The cardinality of sets of \(k\)-independent vectors over finite fields (Q2385075) (← links)
- New nonexistence results for spherical designs (Q2391415) (← links)
- Partitioning 3-homogeneous Latin bitrades (Q2427434) (← links)
- Triplewhist tournaments with the three person property (Q2459497) (← links)
- Best partial covering of a convex domain by congruent circles of a given total area (Q2464360) (← links)
- Covering a triangle with positive and negative homothetic copies (Q2464361) (← links)
- Maximum packing for perfect four-triple configurations (Q2470441) (← links)
- A new packing density bound in 3-space (Q2572586) (← links)
- On two-weight codes (Q2659228) (← links)
- Hamiltonian cycles in 7-tough \((P_3 \cup 2P_1)\)-free graphs (Q2675828) (← links)
- Bounds for the sum of distances of spherical sets of small size (Q2689513) (← links)
- On polarization of spherical codes and designs (Q2695978) (← links)
- (Q2717194) (← links)
- Linear Cryptanalysis and Modified DES with Embedded Parity Check in the S-boxes (Q2802416) (← links)
- (Q3838678) (← links)
- (Q3838679) (← links)
- (Q3838680) (← links)
- (Q3838732) (← links)
- (Q3838734) (← links)