Approximate generalized Steiner systems and near-optimal constant weight codes

Cites Work

Unnamed Item
Unnamed Item
Optimal ternary constant-composition codes with weight four and distance six
Asymptotic behavior of the chromatic index for hypergraphs
Construction of optimal ternary constant weight codes via Bhaskar Rao designs
Constructions of optimal quaternary constant weight codes via group divisible designs
On a packing and covering problem
Near perfect coverings in graphs and hypergraphs
Optimal constant weight codes over $Z_k$ and generalized designs
Optimal ternary constant-composition codes with weight four and distance three
A new approach for examining $q$-Steiner systems
Ternary constant weight codes
Constructions for permutation codes in powerline communications
On constant composition codes
Upper bounds for constant-weight codes
The structure of linear codes of constant weight
Optimal Quaternary Constant-Weight Codes With Weight Four and Distance Five
Estimates on the Size of Symbol Weight Codes
A new table of constant weight codes
Combinatorial Constructions of Optimal Constant-Composition Codes
On constant-composition codes over Z/sub q/
Constructions for $q$-Ary Constant-Weight Codes
Group Divisible Codes and Their Application in the Construction of Optimal Constant-Composition Codes of Weight Three
A Construction for Constant-Composition Codes
Lower bounds for constant weight codes
Bounds and constructions for ternary constant-composition codes
Linear Size Constant-Composition Codes Meeting the Johnson Bound
Decompositions of Edge-Colored Digraphs: A New Technique in the Construction of Constant-Weight Codes and Related Families
Semidefinite Programming Bounds for Constant-Weight Codes
[https://portal.mardi4nfdi.de/wiki/Publication:4870539 A linear programming perspective on the Frankl?R�dl?Pippenger theorem]
Linear Size Optimal $q$-ary Constant-Weight Codes and Constant-Composition Codes
A New Construction for Constant-Composition Codes
Extremal aspects of graph and hypergraph decomposition problems
Perfect Codes and Related Structures
HYPERGRAPH MATCHINGS AND DESIGNS
Optimal Ternary Constant-Weight Codes With Weight 4 and Distance 5
Optimal Ternary Constant-Weight Codes of Weight Four and Distance Six
Graph and hypergraph colouring via nibble methods: a survey
Conflict-free hypergraph matchings

This page was built for publication: Approximate generalized Steiner systems and near-optimal constant weight codes