Pages that link to "Item:Q3199330"
From MaRDI portal
The following pages link to A new table of constant weight codes (Q3199330):
Displaying 28 items.
- Hanani triple packings and optimal \(q\)-ary codes of constant weight three (Q2345917) (← links)
- Matroids from hypersimplex splits (Q2363366) (← links)
- A geometric approach to finding new lower bounds of \(A(n,d,w)\) (Q2384016) (← links)
- Improvements to MCS algorithm for the maximum clique problem (Q2444144) (← links)
- Asymptotic determination of the last packing number of quadruples (Q2491259) (← links)
- On constant composition codes (Q2492193) (← links)
- Partition of triples of order \(6 k +5\) into \(6 k +3\) optimal packings and one packing of size \(8 k +4\) (Q2502027) (← links)
- On equidistant constant weight codes (Q2741409) (← links)
- On the Security of RSM - Presenting 5 First- and Second-Order Attacks (Q2794598) (← links)
- Feeding Two Cats with One Bowl: On Designing a Fault and Side-Channel Resistant Software Encoding Scheme (Q2975798) (← links)
- New results on GDDs, covering, packing and directable designs with block size 5 (Q3057080) (← links)
- Upper bounds on the general covering number<i>C</i><sub>λ</sub>(<i>v</i>,<i>k</i>,<i>t</i>,<i>m</i>) (Q3156929) (← links)
- Fixed Points of Boolean Networks, Guessing Graphs, and Coding Theory (Q3455244) (← links)
- An Extended Comparison of the Best Known Algorithms for Finding the Unweighted Maximum Clique (Q3627690) (← links)
- Some sequences of optimal constant weight codes (Q4602094) (← links)
- Fast Algorithms for the Maximum Clique Problem on Massive Graphs with Applications to Overlapping Community Detection (Q4985798) (← links)
- The Maximum <i>k</i>-Colorable Subgraph Problem and Related Problems (Q5084675) (← links)
- Asymptotic Bounds for General Covering Designs (Q5175786) (← links)
- A distributed computing perspective of unconditionally secure information transmission in Russian cards problems (Q5925684) (← links)
- An upper bound for binary constant weight codes (Q5934172) (← links)
- Least adaptive optimal search with unreliable tests (Q5958337) (← links)
- Correction to: ``A new binary (17,4,5) constant weight code'' (Q6110159) (← links)
- A new construction for \(q\)-ary constant weight codes (Q6156927) (← links)
- Combinatorial constructions of repairable threshold schemes (Q6622519) (← links)
- Few-weight linear codes over \(\mathbb{F}_p\) from \(t\)-to-one mappings (Q6631501) (← links)
- Approximate generalized Steiner systems and near-optimal constant weight codes (Q6637139) (← links)
- Quantum search algorithm for binary constant weight codes (Q6639960) (← links)
- Binary cyclic-gap constant weight codes with low-complexity encoding and decoding (Q6651916) (← links)