The following pages link to Alexander A. Davydov (Q175151):
Displayed 50 items.
- Upper bounds on the smallest size of a complete arc in a finite Desarguesian projective plane based on computer search (Q265614) (← links)
- On constructions and parameters of symmetric configurations \(v_k\) (Q300392) (← links)
- Further results on multiple coverings of the farthest-off points (Q326345) (← links)
- Codes for MIMO transmission based on orthogonal sequences (Q375964) (← links)
- The minimum order of complete caps in \(PG(4,4)\) (Q534515) (← links)
- Linear nonbinary covering codes and saturating sets in projective spaces (Q534526) (← links)
- (Q591377) (redirect page) (← links)
- Use of noise-tolerant encoding for protection of data from operator error (Q593799) (← links)
- On sizes of complete arcs in \(PG(2,q)\) (Q658122) (← links)
- Special sequences as subcodes of Reed-Solomon codes (Q764087) (← links)
- Error correction in main memory of a high-capacity computer (Q921936) (← links)
- Quasiperfect linear binary codes with distance 4 and complete caps in projective geometry (Q923058) (← links)
- Complete \((q^2+q+8)/2\)-caps in the spaces \(\mathrm{PG}(3,q)\), \(q\equiv 2 \pmod 3\) an odd prime, and a complete 20-cap in \(\mathrm{PG}(3,5)\) (Q1009126) (← links)
- On sharply transitive sets in \(\mathrm{PG}(2,g)\). (Q1022870) (← links)
- On sizes of complete caps in projective spaces \(\mathrm{PG}(n, q)\) and arcs in planes \(\mathrm{PG}(2, q)\) (Q1037215) (← links)
- Number of minimal-weight words in block codes (Q1122559) (← links)
- Optimization of shortened Hamming codes (Q1168284) (← links)
- New linear codes with covering radius 2 and odd basis (Q1283217) (← links)
- On saturating sets in projective spaces. (Q1399903) (← links)
- New quaternary linear codes with covering radius 2 (Q1570227) (← links)
- On saturating sets in small projective geometries (Q1580668) (← links)
- Finite field towers: Iterated presentation and complexity of arithmetic. (Q1609402) (← links)
- New bounds for linear codes of covering radius 2 (Q1705496) (← links)
- Conjectural upper bounds on the smallest size of a complete cap in \(\mathrm{PG}(N,q)\), \(N\geq 3\) (Q1743270) (← links)
- Upper bounds on the smallest size of a complete cap in \(\mathrm{PG}(3, q)\) and \(\mathrm{PG}(4, q)\) (Q1743271) (← links)
- Length-4 byte error and double independent error correction by BCH code in semiconductor memories (Q1813447) (← links)
- Complete caps in projective spaces PG\((n,q)\) (Q1882440) (← links)
- Some combinatorial aspects of constructing bipartite-graph codes (Q1950398) (← links)
- New upper bounds on the smallest size of a complete arc in a finite Desarguesian projective plane (Q1956326) (← links)
- On planes through points off the twisted cubic in \(\mathrm{PG}(3,q)\) and multiple covering codes (Q1994925) (← links)
- Multiple coverings of the farthest-off points with small density from projective geometry (Q2018430) (← links)
- Twisted cubic and plane-line incidence matrix in \(\mathrm{PG}(3,q)\) (Q2147366) (← links)
- Twisted cubic and point-line incidence matrix in \(\operatorname{PG}(3,q)\) (Q2232117) (← links)
- Linear codes with covering radius 3 (Q2267791) (← links)
- On the smallest size of an almost complete subset of a conic in \(\mathrm{PG}(2, q)\) and extendability of Reed-Solomon codes (Q2314145) (← links)
- New bounds for linear codes of covering radii 2 and 3 (Q2325293) (← links)
- New covering codes of radius \(R\), codimension \(tr\) and \(tr+\frac{R}{2}\), and saturating sets in projective spaces (Q2334437) (← links)
- New types of estimates for the smallest size of complete arcs in a finite Desarguesian projective plane (Q2352466) (← links)
- Upper bounds on the smallest size of a complete arc in \(\mathrm{PG}(2, {q})\) under a certain probabilistic conjecture (Q2352635) (← links)
- A 3-cycle construction of complete arcs sharing \((q+3)/2\) points with a conic (Q2391418) (← links)
- Minimal 1-saturating sets and complete caps in binary projective spaces. (Q2490862) (← links)
- Nonsymmetrical burst error correcting code in data exchange between computers (Q2560204) (← links)
- Constructions of small complete caps in binary projective spaces (Q2572978) (← links)
- Computer search in projective planes for the sizes of complete arcs (Q2573749) (← links)
- Construction of linear covering codes (Q2640576) (← links)
- Linear codes with covering radius 2 and other new covering codes (Q3199331) (← links)
- (Q3382213) (← links)
- Locally Optimal (Nonshortening) Linear Covering Codes and Minimal Saturating Sets in Projective Spaces (Q3546771) (← links)
- Linear Codes With Covering Radius<tex>$2$</tex>,<tex>$3$</tex>and Saturating Sets in Projective Geometry (Q3546772) (← links)
- New inductive constructions of complete caps in<i>PG</i>(<i>N, q</i>),<i>q</i>even (Q3576976) (← links)