New lower bounds for constant weight codes
From MaRDI portal
Publication:3472053
Recommendations
Cited in
(27)- Improvements on the juxtaposition theorem
- Optimal ternary constant-composition codes with weight four and distance three
- Upper bounds for constant weight and Lee codes slightly outside the Plotkin range
- Some lower bounds for constant weight codes
- scientific article; zbMATH DE number 7274073 (Why is no real title available?)
- scientific article; zbMATH DE number 3985112 (Why is no real title available?)
- Bounds on permutation codes of distance four
- Lower bounds for constant weight codes
- New constant weight codes and packing numbers
- Optimal partitions for triples
- Partitions of triples into optimal packings
- scientific article; zbMATH DE number 3885791 (Why is no real title available?)
- Partition of triples of order \(6 k +5\) into \(6 k +3\) optimal packings and one packing of size \(8 k +4\)
- On the chromatic number, colorings, and codes of the Johnson graph
- Bounds on the sizes of constant weight covering codes
- A PROBLEM FOR ABELIAN GROUPS
- Asymptotic bounds for general covering designs
- The last packing number of quadruples, and cyclic SQS
- An improvement of the Gilbert bound for constant weight codes (Corresp.)
- A geometric approach to finding new lower bounds of \(A(n,d,w)\)
- Improved linear programming bound on sizes of doubly constant-weight codes
- Upper bounds on the general covering numberCλ(v,k,t,m)
- New lower bounds for the number of ACG codes over \(\mathbb{F}_4\)
- A new binary (17,4,5) constant weight code
- scientific article; zbMATH DE number 5914949 (Why is no real title available?)
- Upper bounds for constant-weight codes
- A modification of the Zinoviev lower bound for constant weight codes
This page was built for publication: New lower bounds for constant weight codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3472053)