New lower bounds for constant weight codes

DOI10.1109/18.45293zbMath0695.94016OpenAlexW2005919832MaRDI QIDQ3472053

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

zbMATH Keywords

lower boundsconstant weight codesbinary code

Mathematics Subject Classification ID

Other types of codes (94B60)

Related Items (10)

Upper bounds on the general covering numberC_λ(v,k,t,m) ⋮ On the chromatic number, colorings, and codes of the Johnson graph ⋮ Optimal ternary constant-composition codes with weight four and distance three ⋮ Optimal partitions for triples ⋮ Partitions of triples into optimal packings ⋮ Asymptotic Bounds for General Covering Designs ⋮ Bounds on permutation codes of distance four ⋮ Partition of triples of order \(6 k +5\) into \(6 k +3\) optimal packings and one packing of size \(8 k +4\) ⋮ Bounds on the sizes of constant weight covering codes ⋮ The last packing number of quadruples, and cyclic SQS

This page was built for publication: New lower bounds for constant weight codes