On Perfect Codes and Tilings: Problems and Solutions

From MaRDI portal
Revision as of 02:02, 7 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:4388989

DOI10.1137/S0895480196309171zbMath0908.94035MaRDI QIDQ4388989

Alexander Vardy, Tuvi Etzion

Publication date: 11 May 1998

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)




Related Items

ELEMENTARY p-GROUPS WITH THE RÉDEI PROPERTYOn the binary codes with parameters of doubly-shortened 1-perfect codesMaximal partial packings of \(\mathbb Z_2^n\) with perfect codesOn the classification of perfect codes: side class structuresOn the structure of symmetry groups of Vasil'ev codesIntersection of isomorphic linear codesCardinality spectra of components of correlation immune functions, bent functions, perfect colorings, and codesParity check systems of nonlinear codes over finite commutative Frobenius ringsMaximum intersection of linear codes and codes equivalent to linearOn non-full-rank perfect codes over finite fieldsAn enumeration of 1-perfect ternary codesProjective tilings and full-rank perfect codesTwo optimal one-error-correcting codes of length 13 that are not doubly shortened perfect codesSMALL p-GROUPS WITH FULL-RANK FACTORIZATIONOn partitions of an \(n\)-cube into nonequivalent perfect codesOn perfect binary codesA Partition of the Hypercube into Maximally Nonparallel Hamming CodesOn existence of perfect bitrades in Hamming graphsA full rank perfect code of length 31On intersection problem for perfect binary codesOn the size of the symmetry group of a perfect codeA remark on full rank perfect codesPerfect codes as isomorphic spacesPerfect codes from the dual point of view. IOn transitive partitions of an \(n\)-cube into codesFull-rank factorings of elementary \(p\)-groups by \(Z\)-subsets.Full rank perfect codes and \(\alpha \)-kernelsOn intersections of Reed-Muller like codesOn transitive uniform partitions of \(F^n\) into binary Hamming codesOn rank and kernel of some mixed perfect codesKernels and \(p\)-kernels of \(p^r\)-ary 1-perfect codes.Bounds on the rank and kernel of perfect codes