Pages that link to "Item:Q2705972"
From MaRDI portal
The following pages link to Upper bounds for constant-weight codes (Q2705972):
Displaying 38 items.
- Bounds for codes by semidefinite programming (Q735630) (← links)
- Construction of optimal ternary constant weight codes via Bhaskar Rao designs (Q924950) (← links)
- Binary permutation sequences as subsets of Levenshtein codes, spectral null codes, run-length limited codes and constant weight codes (Q1009036) (← links)
- A modification of the Zinoviev lower bound for constant weight codes (Q1070995) (← links)
- Upper bounds for constant weight and Lee codes slightly outside the Plotkin range (Q1095110) (← links)
- Some lower bounds for constant weight codes (Q1096589) (← links)
- Optimal FHSs and DSSs via near zero-difference balanced functions (Q1671375) (← links)
- Constructions for optimal cyclic ternary constant-weight codes of weight four and distance six (Q1699543) (← links)
- Improved linear programming bound on sizes of doubly constant-weight codes (Q1800703) (← links)
- Bounds on the sizes of constant weight covering codes (Q1804978) (← links)
- Application of cover-free codes and combinatorial designs to two-stage testing. (Q1811089) (← links)
- Optimal binary constant weight codes and affine linear groups over finite fields (Q1999901) (← links)
- Optimal multiply constant-weight codes from generalized Howell designs (Q2000555) (← links)
- A combinatorial formula for Kazhdan-Lusztig polynomials of sparse paving matroids (Q2121736) (← links)
- Matroids are not Ehrhart positive (Q2136552) (← links)
- On the constructions of constant-composition codes from perfect nonlinear functions (Q2267142) (← links)
- Two-weight codes: upper bounds and new optimal constructions (Q2324498) (← links)
- Hanani triple packings and optimal \(q\)-ary codes of constant weight three (Q2345917) (← links)
- Some new resolvable GDDs with \(k = 4\) and doubly resolvable GDDs with \(k = 3\) (Q2352077) (← links)
- New explicit binary constant weight codes from Reed-Solomon codes (Q2363317) (← links)
- The characterization of binary constant weight codes meeting the bound of Fu and Shen (Q2384006) (← links)
- Eigenvalue bounds on the pseudocodeword weight of expander codes (Q2470810) (← links)
- Exact and Parameterized Algorithms for (k, i)-Coloring (Q2971658) (← links)
- (Q3011798) (← links)
- Coding Theory Motivated by Relational Databases (Q3092324) (← links)
- Fixed Points of Boolean Networks, Guessing Graphs, and Coding Theory (Q3455244) (← links)
- Fundamentals of coding type problems (Q3637813) (← links)
- Оценки объемов окрестностей двоичных кодов в терминах их весовых спектров (Q4959067) (← links)
- Generalized vector space partitions (Q5377019) (← links)
- Rank-Metric Codes and Their Applications (Q5863764) (← links)
- An upper bound for binary constant weight codes (Q5934172) (← links)
- Upper bounds on weight hierarchies of extremal non-chain codes (Q5951954) (← links)
- Optimal combinatorial batch codes based on block designs (Q5963364) (← links)
- A new construction for \(q\)-ary constant weight codes (Q6156927) (← links)
- Balanced reconstruction codes for single edits (Q6564093) (← links)
- New upper bounds for spherical codes and packings (Q6583556) (← links)
- Approximate generalized Steiner systems and near-optimal constant weight codes (Q6637139) (← links)
- Binary cyclic-gap constant weight codes with low-complexity encoding and decoding (Q6651916) (← links)