Pages that link to "Item:Q3199330"
From MaRDI portal
The following pages link to A new table of constant weight codes (Q3199330):
Displaying 50 items.
- Algorithms for detecting optimal hereditary structures in graphs, with application to clique relaxations (Q360375) (← links)
- A class of optimal \(p\)-ary codes from one-weight codes over \(\mathbb F_p[u]/\langle u^m\rangle\) (Q397712) (← links)
- Asymptotic bounds on the equilateral dimension of hypercubes (Q497358) (← links)
- The completion determination of optimal \((3,4)\)-packings (Q499668) (← links)
- A Graham-Sloane type construction for \(s\)-surjective matrices (Q685994) (← links)
- List decodability at small radii (Q717148) (← links)
- Tensors, matchings and codes (Q765171) (← links)
- New techniques for constructing \(t\)-EC/\(d\)-ED/AUED and \(t\)-EC/\(d\)-ED/\(s\)-UED codes (Q811487) (← links)
- Sets in Abelian groups with distinct sums of pairs. (Q868904) (← links)
- Finite field constructions of combinatorial arrays (Q908047) (← links)
- Construction of optimal ternary constant weight codes via Bhaskar Rao designs (Q924950) (← links)
- Construction of constant GC-content DNA codes via a variable neighbourhood search algorithm (Q1040788) (← links)
- Optimal partitions for triples (Q1185896) (← links)
- Partitions of triples into optimal packings (Q1185904) (← links)
- Bounds and constructions of asymmetric or unidirectional error-correcting codes (Q1205125) (← links)
- The last packing number of quadruples, and cyclic SQS (Q1309825) (← links)
- Test case generators and computational results for the maximum clique problem (Q1310979) (← links)
- The maximum clique problem (Q1318271) (← links)
- Quaternary constructions for the binary single-error-correcting codes of Julin, Best and others (Q1321554) (← links)
- Optimal constant weight codes over \(Z_k\) and generalized designs (Q1357723) (← links)
- On the equivalence of certain constant weight codes and combinatorial designs (Q1361726) (← links)
- Error-detecting abilities of binary nonlinear constant weight codes (Q1370177) (← links)
- Error-correcting nonadaptive group testing with \(d^e\)-disjunct matrices (Q1382279) (← links)
- Modelling constant weight codes using tabu search (Q1384374) (← links)
- Sets in \(\mathbb{Z}_n\) with distinct sums of pairs. (Q1428557) (← links)
- Some binary maximin distance designs (Q1578228) (← links)
- Perfect two-fault tolerant search with minimum adaptiveness (Q1585493) (← links)
- Optimal FHSs and DSSs via near zero-difference balanced functions (Q1671375) (← links)
- A note on the size of \(\mathscr{N}\)-free families (Q1677188) (← links)
- Constructions for optimal cyclic ternary constant-weight codes of weight four and distance six (Q1699543) (← links)
- Optimal ternary constant-composition codes with weight four and distance three (Q1727782) (← links)
- New constant weight codes and packing numbers (Q1742694) (← links)
- A new approach for examining \(q\)-Steiner systems (Q1753104) (← links)
- Multiset combinatorial batch codes (Q1791675) (← links)
- Packing pairs by quintuples: The case of zero congruence mod 4 (Q1804219) (← links)
- Bounds on the sizes of constant weight covering codes (Q1804978) (← links)
- Several classes of \((2^{m}-1,w,2)\) optical orthogonal codes (Q1811097) (← links)
- On equidistant constant weight codes (Q1811100) (← links)
- Strand design for biomolecular computation. (Q1853477) (← links)
- Nonabelian sets with distinct \(k\)-sums (Q1903729) (← links)
- The nonexistence of \([71,5,46;3]\)-codes (Q1918454) (← links)
- On the chromatic number, colorings, and codes of the Johnson graph (Q1923589) (← links)
- Optimal binary constant weight codes and affine linear groups over finite fields (Q1999901) (← links)
- On trace zero matrices and commutators (Q2099279) (← links)
- The completion of optimal cyclic quaternary codes of weight 3 and distance 3 (Q2119936) (← links)
- Biangular lines revisited (Q2230922) (← links)
- Speeding up branch and bound algorithms for solving the maximum clique problem (Q2249809) (← links)
- On the constructions of constant-composition codes from perfect nonlinear functions (Q2267142) (← links)
- Bounds on permutation codes of distance four (Q2269535) (← links)
- Two-weight codes: upper bounds and new optimal constructions (Q2324498) (← links)
