Optimal constant weight covering codes and nonuniform group divisible 3-designs with block size four
From MaRDI portal
Publication:663476
DOI10.1007/s10623-011-9499-8zbMath1237.05039OpenAlexW2042210804MaRDI QIDQ663476
Gennian Ge, Xian De Zhang, Hui Zhang
Publication date: 15 February 2012
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10623-011-9499-8
group divisible designcovering designconstant weight codecandelabra systemH-designcovering codequadruple system
Bounds on codes (94B65) Combinatorial codes (94B25) Combinatorial aspects of packing and covering (05B40)
Related Items (2)
A new existence proof for Steiner quadruple systems ⋮ Some New Infinite Classes of Candelabra Quadruple Systems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Minimal coverings of pairs by triples
- Small group divisible Steiner quadruple systems
- Covering triples by quadruples: an asymptotic solution
- A general recursive construction for quadruple systems
- Partitioning the planes of \(AG_{2m}(2)\) into 2-designs
- On group divisible covering designs
- Bounds on the sizes of constant weight covering codes
- Subdesigns in Steiner quadruple systems
- On coverings
- Maximal and minimal coverings of (k - 1)-tuples by k-tuples
- On Quadruple Systems
- An improvement on covering triples by quadruples
- An improvement on H design
- A class of group divisible 3-designs and their applications
- Covering radius---Survey and recent results
- Source coding theorems without the ergodic assumption
- Transverse quadruple systems with five holes
- Modified bounds for covering codes
- On the theory of graphs
This page was built for publication: Optimal constant weight covering codes and nonuniform group divisible 3-designs with block size four
