Perfect Codes in the Lee Metric and the Packing of Polyominoes

From MaRDI portal
Revision as of 03:48, 7 March 2024 by Import240305080351 (talk | contribs) (Created automatically from import240305080351)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:5587625

DOI10.1137/0118025zbMath0192.56302OpenAlexW2070938277MaRDI QIDQ5587625

Solomon W. Golomb, Lloyd R. Welch

Publication date: 1970

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

Full work available at URL: https://doi.org/10.1137/0118025




Related Items (52)

Optimal interleaving schemes for correcting two-dimensional cluster errorsThe file distribution problem for processor networksA new approach towards the Golomb-Welch conjectureRestriction conditions on \(\mathrm{PL}(7, 2)\) codes \((3 \le \vert\mathcal{G}_i\vert \le 7)\)Perfect t-codes in Cayley graphs of groupsNonexistence of face-to-face four-dimensional tilings in the Lee metricHigh-dimensional holeyominoesA generalization of the pentomino exclusion problem: dislocation of graphsVariable Length Perfect CodesOn domination numbers of Cartesian products of pathsConstant 2-labellings and an application to \((r, a, b)\)-covering codesCharacterizing subgroup perfect codes by 2-subgroupsLattice packings of cross‐polytopes from Reed–Solomon codes and Sidon setsPerfect codes in two-dimensional algebraic latticesOn linear diameter perfect Lee codes with distance 6Expansivity and periodicity in algebraic subshiftsOn the construction of new toric quantum codes and quantum burst-error-correcting codesOn the nonexistence of lattice tilings of \(\mathbb{Z}^n\) by Lee spheresConstructions and invariants of optimal codes in the Lee metricOn perfect codes in Cartesian products of graphsPerfect codes in the \(\ell_p\) metricOn abelian Cayley graphs of diameter two and defect onePartitions into perfect codes in the Hamming and Lee metricsBasis arrays and successive packing for \(M\)-D interleavingA generalization of Lee codesImproved Bounds on Sidon Sets via Lattice Packings of SimplicesOn the non-existence of lattice tilings by quasi-crossesLattice-like total perfect codes\([1,2\)-sets in graphs] ⋮ Mellin transforms with only critical zeros: Legendre functionsNon-periodic tilings of \({\mathbb{R}}^{n}\) by crossesThe degree-diameter problem for circulant graphs of degree 8 and 9Perfect codes in Euclidean latticesModeling hexagonal constellations with Eisenstein-Jacobi graphsAdaptive identification in graphsOn the non-existence of linear perfect Lee codes: the Zhang-Ge condition and a new polynomial criterionQuotients of Gaussian graphs and their application to perfect codesDerived tilingsThe structure of cube tilings under symmetry conditionsQuasi-perfect codes in the \(\ell _p\) metricWeighted codes in Lee metricsNo lattice tiling of \(\mathbb{Z}^n\) by Lee sphere of radius 2Perfect \(r\)-domination in the Kronecker product of two cycles, with an application to diagonal/toroidal meshThe 2-distance coloring of the Cartesian product of cycles using optimal Lee codesSteganographic schemes from perfect codes on Cayley graphsCharacterizing \(r\)-perfect codes in direct products of two and three cyclesUnnamed ItemWeighted perfect codes in Lee metricPerfect codes in the discrete simplexPerfect codes in direct graph bundlesPerfect codes in Cartesian products of hypercube and multidimensional gridNonexistence of perfect 2-error-correcting Lee codes in certain dimensions




This page was built for publication: Perfect Codes in the Lee Metric and the Packing of Polyominoes