The following pages link to (Q3285920):
Displaying 50 items.
- Generalized packing designs (Q385379) (← links)
- Uniform hypergraphs containing no grids (Q390731) (← links)
- Combinatorial constructions for maximum optical orthogonal signature pattern codes (Q394296) (← links)
- New inequalities for \(q\)-ary constant-weight codes (Q398941) (← links)
- Multi-trial Guruswami-Sudan decoding for generalised Reed-Solomon codes (Q398959) (← links)
- Group homomorphisms as error correcting codes (Q490299) (← links)
- Orbit-disjoint regular \((n, 3, 1)\)-CDPs and their applications to multilength OOCs (Q492000) (← links)
- Some simple consequences of coding theory for combinatorial problems of packings and coverings (Q581409) (← links)
- Further results on optimal \((v,4,2,1)\)-OOCs (Q658057) (← links)
- Generalising Fisher's inequality to coverings and packings (Q681600) (← links)
- Genetic algorithms in coding theory -- a table for \(A_ 3(n, d)\) (Q686527) (← links)
- Collapsing and separating completeness notions under average-case and worst-case hypotheses (Q693053) (← links)
- Power error locating pairs (Q782853) (← links)
- New families of asymptotically optimal doubly periodic arrays with ideal correlation constraints (Q892502) (← links)
- On packing designs with block size 5 and index 4 (Q911603) (← links)
- On the construction of \(q\)-ary equidistant codes (Q941879) (← links)
- Constructions for strictly cyclic 3-designs and applications to optimal OOCs with \(\lambda =2\) (Q958756) (← links)
- Upper bounds for constant weight and Lee codes slightly outside the Plotkin range (Q1095110) (← links)
- Optimal packings of \(K_4\)'s into a \(K_n\) (Q1259551) (← links)
- Packing pairs by quintuples with index 2: \(v\) odd, \(v\not\equiv 13\pmod{20}\) (Q1318789) (← links)
- On the upper bound of the size of the \(r\)-cover-free families (Q1328402) (← links)
- On the difference between asymptotically good packings and coverings (Q1345524) (← links)
- Some combinatorial constructions for optical orthogonal codes (Q1584233) (← links)
- Combinatorial constructions of optimal \((m,n,4,2)\) optical orthogonal signature pattern codes (Q1647564) (← links)
- A modified Guruswami-Sudan algorithm for decoding Reed-Solomon codes (Q1675777) (← links)
- Classifying optimal binary subspace codes of length 8, constant dimension 4 and minimum distance 6 (Q1727355) (← links)
- Remark on balanced incomplete block designs, near-resolvable block designs, and \(q\)-ary constant-weight codes (Q1752296) (← links)
- Power decoding Reed-Solomon codes up to the Johnson radius (Q1783708) (← links)
- Further results on the existence of super-simple pairwise balanced designs with block sizes 3 and 4 (Q1783730) (← links)
- A sharpening of the Johnson bound for binary linear codes and the nonexistence of linear codes with Preparata parameters (Q1802186) (← links)
- Packing pairs by quintuples: The case of zero congruence mod 4 (Q1804219) (← links)
- The packing problem for projective geometries over GF(3) with dimension greater than five (Q1839443) (← links)
- A systematic approach to some block design constructions (Q1881684) (← links)
- Optimal binary constant weight codes and affine linear groups over finite fields (Q1999901) (← links)
- Maximum \(w\)-cyclic holey group divisible packings and their application to three-dimensional optical orthogonal codes (Q2075507) (← links)
- Subspace packings: constructions and bounds (Q2200513) (← links)
- New asymptotically optimal three-dimensional wave-length/space/time optical orthogonal codes for OCDMA systems (Q2202916) (← links)
- The clique distribution in powers of hypercubes (Q2235258) (← links)
- On the tractability of \(( k , i )\)-coloring (Q2235289) (← links)
- List decoding of number field codes (Q2249795) (← links)
- Optimal optical orthogonal signature pattern codes with weight three and cross-correlation constraint one (Q2285780) (← links)
- On \(m\)-near-resolvable block designs and \(q\)-ary constant-weight codes (Q2314155) (← links)
- Johnson type bounds for mixed dimension subspace codes (Q2323816) (← links)
- Two-weight codes: upper bounds and new optimal constructions (Q2324498) (← links)
- Almost designs and their links with balanced incomplete block designs (Q2324778) (← links)
- New explicit binary constant weight codes from Reed-Solomon codes (Q2363317) (← links)
- Semi-distance codes and Steiner systems (Q2373934) (← links)
- Distributed scheduling for disconnected cooperation (Q2375304) (← links)
- New optical orthogonal signature pattern codes with maximum collision parameter 2 and weight 4 (Q2407714) (← links)
- Low-degree test with polynomially small error (Q2410685) (← links)
