scientific article
From MaRDI portal
Publication:3285920
zbMath0102.34602MaRDI QIDQ3285920
Publication date: 1962
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (79)
On the upper bound of the size of the \(r\)-cover-free families ⋮ New explicit binary constant weight codes from Reed-Solomon codes ⋮ A systematic approach to some block design constructions ⋮ Semi-distance codes and Steiner systems ⋮ Distributed scheduling for disconnected cooperation ⋮ On the difference between asymptotically good packings and coverings ⋮ Upper bounds for constant weight and Lee codes slightly outside the Plotkin range ⋮ Construction of several classes of maximum codes ⋮ Combinatorial constructions of optimal \((m,n,4,2)\) optical orthogonal signature pattern codes ⋮ New optical orthogonal signature pattern codes with maximum collision parameter 2 and weight 4 ⋮ A modified Guruswami-Sudan algorithm for decoding Reed-Solomon codes ⋮ Low-degree test with polynomially small error ⋮ Generalized packing designs ⋮ Uniform hypergraphs containing no grids ⋮ Combinatorial constructions for maximum optical orthogonal signature pattern codes ⋮ Matroid relaxations and Kazhdan-Lusztig non-degeneracy ⋮ New inequalities for \(q\)-ary constant-weight codes ⋮ Multi-trial Guruswami-Sudan decoding for generalised Reed-Solomon codes ⋮ Constructions of optimal two-dimensional optical orthogonal codes with AM-OPPW restriction for \(\lambda = 2\) ⋮ An Upper Bound on the Size of Sidon Sets ⋮ New families of asymptotically optimal doubly periodic arrays with ideal correlation constraints ⋮ New bound and constructions for geometric orthogonal codes and geometric 180-rotating orthogonal codes ⋮ The automorphism groups of some token graphs ⋮ Improved List-Decodability and List-Recoverability of Reed–Solomon Codes via Tree Packings ⋮ Spectrum of 3-uniform 6- and 9-cycle systems over \(K_v^{( 3 )} - I\) ⋮ Maximum w‐cyclic holey group divisible packings with block size three and applications to optical orthogonal codes ⋮ A new construction for \(q\)-ary constant weight codes ⋮ On the Construction of Multiply Constant-Weight Codes ⋮ A SIMPLE PROOF OF THE IMPROVED JOHNSON BOUND FOR BINARY CODES ⋮ List decoding of maximal order codes over number fields ⋮ Some sequences of optimal constant weight codes ⋮ Packing cliques in 3‐uniform hypergraphs ⋮ Subspace packings: constructions and bounds ⋮ New asymptotically optimal three-dimensional wave-length/space/time optical orthogonal codes for OCDMA systems ⋮ On packing designs with block size 5 and index 4 ⋮ Combinatorial constructions for optimal 2-D optical orthogonal codes with AM-OPPTS property ⋮ Further results on optimal \((v,4,2,1)\)-OOCs ⋮ Classifying optimal binary subspace codes of length 8, constant dimension 4 and minimum distance 6 ⋮ Group homomorphisms as error correcting codes ⋮ Orbit-disjoint regular \((n, 3, 1)\)-CDPs and their applications to multilength OOCs ⋮ On the construction of \(q\)-ary equidistant codes ⋮ The clique distribution in powers of hypercubes ⋮ On the tractability of \(( k , i )\)-coloring ⋮ Classes of optical orthogonal codes from ARCS in root subspaces ⋮ Generalising Fisher's inequality to coverings and packings ⋮ Remark on balanced incomplete block designs, near-resolvable block designs, and \(q\)-ary constant-weight codes ⋮ Genetic algorithms in coding theory -- a table for \(A_ 3(n, d)\) ⋮ List decoding of number field codes ⋮ Constructions for strictly cyclic 3-designs and applications to optimal OOCs with \(\lambda =2\) ⋮ Optimal binary constant weight codes and affine linear groups over finite fields ⋮ Collapsing and separating completeness notions under average-case and worst-case hypotheses ⋮ Maximal resolvable packings and minimal resolvable coverings of triples by quadruples ⋮ Constructions for rotational Steiner quadruple systems ⋮ Latin squares with bounded size of row prefix intersections ⋮ Independence and matching numbers of some token graphs ⋮ Some simple consequences of coding theory for combinatorial problems of packings and coverings ⋮ Power decoding Reed-Solomon codes up to the Johnson radius ⋮ Further results on the existence of super-simple pairwise balanced designs with block sizes 3 and 4 ⋮ Hamiltonicity of token graphs of fan graphs ⋮ Optimal optical orthogonal signature pattern codes with weight three and cross-correlation constraint one ⋮ Parallel and concurrent security of the HB and \(HB^{+}\) protocols ⋮ Some series of optimal multilength OOCs of weight four ⋮ A sharpening of the Johnson bound for binary linear codes and the nonexistence of linear codes with Preparata parameters ⋮ Packing pairs by quintuples: The case of zero congruence mod 4 ⋮ Optimal packings of \(K_4\)'s into a \(K_n\) ⋮ Constructions of Strictlym-Cyclic and Semi-Cyclic H(m,n,4,3) ⋮ On \(m\)-near-resolvable block designs and \(q\)-ary constant-weight codes ⋮ Nearly perfect binary codes ⋮ Upper bounds for constant weight error correcting codes ⋮ Maximum \(w\)-cyclic holey group divisible packings and their application to three-dimensional optical orthogonal codes ⋮ Johnson type bounds for mixed dimension subspace codes ⋮ Two-weight codes: upper bounds and new optimal constructions ⋮ Almost designs and their links with balanced incomplete block designs ⋮ Power error locating pairs ⋮ The packing problem for projective geometries over GF(3) with dimension greater than five ⋮ Some combinatorial constructions for optical orthogonal codes ⋮ On the size of partial block designs with large blocks ⋮ Rank-Metric Codes and Their Applications ⋮ Packing pairs by quintuples with index 2: \(v\) odd, \(v\not\equiv 13\pmod{20}\)
This page was built for publication:
