New lower bounds for constant weight codes
From MaRDI portal
Publication:3472053
DOI10.1109/18.45293zbMATH Open0695.94016OpenAlexW2005919832MaRDI QIDQ3472053FDOQ3472053
Authors: Cornelis Leonardus Maria van Pul, Tuvi Etzion 
Publication date: 1989
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/8d531671c5381ada4d9512d867db1519a876c2b1
Recommendations
Cited In (25)
- 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
- Title not available (Why is that?)
- Title not available (Why is that?)
- Asymptotic Bounds for General Covering Designs
- 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
- Title not available (Why is that?)
- 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
- An improvement of the Gilbert bound for constant weight codes (Corresp.)
- The last packing number of quadruples, and cyclic SQS
- A geometric approach to finding new lower bounds of \(A(n,d,w)\)
- Upper bounds on the general covering numberCλ(v,k,t,m)
- A new binary (17,4,5) constant weight code
- Title not available (Why is that?)
- 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)
