Binary extended perfect codes of length 16 by the generalized concatenated construction
From MaRDI portal
Publication:1812370
DOI10.1023/A:1022049912988zbMath1027.94030OpenAlexW82746619MaRDI QIDQ1812370
Dmitrii Zinoviev, Victor A. Zinoviev
Publication date: 8 September 2003
Published in: Problems of Information Transmission (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1022049912988
Exact enumeration problems, generating functions (05A15) Orthogonal arrays, Latin squares, Room squares (05B15) Combinatorial codes (94B25)
Related Items (4)
An enumeration of 1-perfect ternary codes ⋮ Vasil'ev codes of length \(n=2^m\) and doubling of Steiner systems \(S(n,4,3)\) of a given rank ⋮ Constructions of transitive Latin hypercubeatin hypercubes ⋮ On the classification of perfect codes: extended side class structures
This page was built for publication: Binary extended perfect codes of length 16 by the generalized concatenated construction
