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

The author shows that perfect \((n,3;n-1)_3\) codes (ternary constant-weight codes of length \(n\) and weight \(n-1\) with distance 3) correspond to perfect matchings without parallel edges at distance 1 or 2 from each other in a binary hypercube. Then inductive constructions of perfect \((n,3;n-1)_3\) codes are proposed that are analogs of some constructions of nonlinear perfect binary codes. The author also presents a construction that yields the lower bound \(2^{2^{n/2-2}}\) for the number of perfect \((n,3;n-1)_3\) codes.