On multifold MDS and perfect codes that are not splittable into onefold codes

DOI10.1023/B:PRIT.0000024875.79605.fczbMath1083.94022OpenAlexW2072915944MaRDI QIDQ2388463

Denis S. Krotov, Vladimir N. Potapov

Publication date: 14 September 2005

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

Full work available at URL: https://doi.org/10.1023/b:prit.0000024875.79605.fc

zbMATH Keywords

\(k\)-ary code\(n\)-quasi groupLatin \(n\)-cubemaximal distance seperable codes

Mathematics Subject Classification ID

Bounds on codes (94B65) Orthogonal arrays, Latin squares, Room squares (05B15) Theory of error-correcting codes and error-detecting codes (94B99)

Related Items (6)

On the binary codes with parameters of doubly-shortened 1-perfect codes ⋮ Multidimensional Latin bitrades ⋮ Cardinality spectra of components of correlation immune functions, bent functions, perfect colorings, and codes ⋮ Non-extendible Latin parallelepipeds ⋮ On decomposability of 4-ary distance 2 MDS codes, double-codes, and \(n\)-quasigroups of order 4 ⋮ On the \(\mathrm{OA}(1536,13,2,7)\) and related orthogonal arrays

This page was built for publication: On multifold MDS and perfect codes that are not splittable into onefold codes