Clique matchings in the \(k\)-ary \(n\)-dimensional cube

DOI10.1134/S0037446611020133zbMath1232.05187MaRDI QIDQ546220

Vladimir N. Potapov

Publication date: 24 June 2011

Published in: Siberian Mathematical Journal (Search for Journal in Brave)

zbMATH Keywords

permanentperfect matchingMDS codeclique matchingH-design

Mathematics Subject Classification ID

Hypergraphs (05C65) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Optimal constant weight codes over \(Z_k\) and generalized designs
• A class of perfect ternary constant-weight codes
• On a leverage problem in the hypercube
• On Some Tactical Configurations
• Inductive construction of perfect ternary constant-weight codes with distance 3

This page was built for publication: Clique matchings in the \(k\)-ary \(n\)-dimensional cube