Pages that link to "Item:Q4146671"
From MaRDI portal
The following pages link to Bounds for binary codes of length less than 25 (Q4146671):
Displaying 45 items.
- Entry-faithful 2-neighbour transitive codes (Q281316) (← links)
- Symmetry in RLT-type relaxations for the quadratic assignment and standard quadratic optimization problems (Q296969) (← links)
- On optimal binary codes with unbalanced coordinates (Q371241) (← links)
- On packing designs with block size 5 and index 4 (Q911603) (← links)
- Lower bounds on the minimum average distance of binary codes (Q998361) (← links)
- Some lower bounds for constant weight codes (Q1096589) (← links)
- A completion problem for finite affine planes (Q1105611) (← links)
- Applications of coding theory to the design of somatic cell hybrid panels (Q1108959) (← links)
- Upper bounds for A(n,4) and A(n,6) derived from Delsarte's linear programming bound (Q1167704) (← links)
- On the average Hamming distance for binary codes (Q1281403) (← links)
- New bounds for the minimum length of binary linear block codes (Q1310754) (← links)
- Some recent developments on BIBDs and related designs (Q1313979) (← links)
- Packing pairs by quintuples with index 2: \(v\) odd, \(v\not\equiv 13\pmod{20}\) (Q1318789) (← links)
- Bipacking pairs by quintuples: The case \(\nu\equiv 13\bmod 20\) (Q1336685) (← links)
- On the Delsarte inequalities (Q1375529) (← links)
- A new upper bound for binary codes with minimum distance four (Q1584302) (← links)
- The sextuply shortened binary Golay code is optimal (Q1727350) (← links)
- New nonbinary code bounds based on divisibility arguments (Q1741925) (← links)
- Improved linear programming bound on sizes of doubly constant-weight codes (Q1800703) (← 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)
- Slight improvements of the Singleton bound (Q1887651) (← links)
- Two new bounds on the size of binary codes with a minimum distance of three (Q1904422) (← links)
- A new lower bound on the minimal length of a binary linear code (Q1916055) (← links)
- On the maximum number of minimal codewords (Q2037586) (← links)
- On the classification of binary completely transitive codes with almost-simple top-group (Q2080231) (← links)
- A new two-error-correcting binary code of length 16 (Q2179504) (← links)
- Sporadic neighbour-transitive codes in Johnson graphs (Q2249651) (← links)
- Refinements of Levenshtein bounds in \(q\)-ary Hamming spaces (Q2278701) (← links)
- 2-neighbour-transitive codes with small blocks of imprimitivity (Q2294111) (← links)
- Minimal binary 2-neighbour-transitive codes (Q2299621) (← links)
- Note on the size of binary Armstrong codes (Q2439741) (← links)
- A tropical approach to secant dimensions (Q2457280) (← links)
- Two new four-error-correcting binary codes (Q2572972) (← links)
- Numerical results on the asymptotic rate of binary codes (Q2717190) (← links)
- A new upper bound for single error-correcting codes (Q2770349) (← links)
- Some Bounds on the Size of Codes (Q2986470) (← links)
- On Additive Bases and Harmonious Graphs (Q3964614) (← links)
- The chromatic number of the square of the $8$-cube (Q4640334) (← links)
- A SIMPLE PROOF OF THE IMPROVED JOHNSON BOUND FOR BINARY CODES (Q4968646) (← links)
- Construction of several classes of maximum codes (Q5063292) (← links)
- Generalized vector space partitions (Q5377019) (← links)
- On the minimum average distance of binary codes: Linear programming approach (Q5939230) (← links)
- Semidefinite programming bounds for binary codes from a split Terwilliger algebra (Q6074024) (← links)
- Block size five: quo vadis? (Q6613374) (← links)
