On transitive partitions of an n-cube into codes

DOI10.1134/S0032946009010037MaRDI QIDQ734284zbMATH OpenOpenAlexFDO

Authors Faina I. Solov'eva

Publication date 20 October 2009

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

Full work available at URL https://doi.org/10.1134/s0032946009010037

Mathematics Subject Classification ID

Orthogonal arrays, Latin squares, Room squares (05B15) Applications of the theory of convex sets and geometry of numbers (covering radius, etc.) to coding theory (94B75)

Recommendations

• On construction of vertex-transitive partitions of the \(n\)-cube into perfect codes
• On partitions of an n-cube into nonequivalent perfect codes
• On partitions of an \(n\)-cube into perfect binary codes
• On transitive uniform partitions of \(F^n\) into binary Hamming codes
• On the construction of transitive codes

Cites work

• scientific article; zbMATH DE number 6004879 (Why is no real title available?)
• scientific article; zbMATH DE number 1811351 (Why is no real title available?)
• scientific article; zbMATH DE number 1471084 (Why is no real title available?)
• scientific article; zbMATH DE number 3321827 (Why is no real title available?)
• 1-perfect uniform and distance invariant partitions
• A General Product Construction for Error Correcting Codes
• A Generalized Parity Function and Its Use in the Construction of Perfect Codes
• A characterization of 1-perfect additive codes
• Intersection matrices for partitions by binary perfect codes
• On Perfect Codes and Tilings: Problems and Solutions
• On binary 1-perfect additive codes: some structural properties
• On partitions of an n-cube into nonequivalent perfect codes
• Well-Ordered Steiner Triple Systems and 1-Perfect Partitions of the n-cube

Cited in

(9)

• On transitive uniform partitions of \(F^n\) into binary Hamming codes
• On mobile sets in the binary hypercube
• On construction of vertex-transitive partitions of the \(n\)-cube into perfect codes
• On partitions of an n-cube into nonequivalent perfect codes
• On the construction of transitive codes
• A scheme to construct distance-three codes using Latin squares, with applications to the \(n\)-cube
• Symmetric vertex partitions of hypercubes by isometric trees
• On partitions of an \(n\)-cube into perfect binary codes
• A partition of the hypercube into maximally nonparallel Hamming codes

This page was built for publication: On transitive partitions of an \(n\)-cube into codes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q734284)