Inductive construction of perfect ternary constant-weight codes with distance 3

DOI10.1023/A:1010424208992zbMath0999.94045MaRDI QIDQ5951357

Denis S. Krotov

Publication date: 2 December 2002

Published in: Problems of Information Transmission (Search for Journal in Brave)

zbMATH Keywords

lower boundperfect codesperfect matchingsternary constant-weight codes

Mathematics Subject Classification ID

Other types of codes (94B60)

Related Items (9)

DP-colorings of hypergraphs ⋮ A family of diameter perfect constant-weight codes from Steiner systems ⋮ Completely reducible super-simple designs with block size four and related super-simple packings ⋮ On diameter perfect constant-weight ternary codes ⋮ 4‐*GDD(6ⁿ)s and Related Optimal Quaternary Constant‐Weight Codes ⋮ On perfect binary codes ⋮ Clique matchings in the \(k\)-ary \(n\)-dimensional cube ⋮ On reducibility of \(n\)-ary quasigroups ⋮ 2-Factors Without Close Edges in the n-Dimensional Cube

This page was built for publication: Inductive construction of perfect ternary constant-weight codes with distance 3