Jeffrey C. Lagarias, Peter W. Shor  Home/Search
Context
Related
| att.com/~shor/papers/cubetilings.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: att.com/~shor/papers/ (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Families of non-lattice tilings of R n by unit cubes are constructed. These tilings are specializations of certain families of nonlinear codes over GF(2). These cube-tilings provide building blocks for the construction of cube-tilings such that no two cubes have a high-dimensional face in common. We construct cube-tilings of R n such that no two cubes have a common face of dimension exceeding n - 3 1 __ Ö"n . Cube-Tilings of R n and Nonlinear Codes Jeffrey C. Lagarias Peter W. ... (Update)
Active bibliography (related documents): More All
0.2: An Exact Parallel Algorithm For The Maximum Clique Problem - Pardalos, Rappe, Resende (1998) (Correct)
0.2: The Maximum Clique Problem - Bomze, Budinich, Pardalos, Pelillo (1999) (Correct)
0.2: Experimental Analyses of the Life Span Method for the Maximum .. - Fujisawa, Kubo (1995) (Correct)
Similar documents based on text: More All
0.3: Maximal Facet-to-Facet Snakes of Unit Cubes - Aszl'o Szab'o Computer (Correct)
0.2: Keller's Cube-Tiling Conjecture Is False In High Dimensions - Lagarias, Shor (1992) (Correct)
0.1: Version of Wed 2001 Mar 21 16:53 - Szekeres Szekeres The (Correct)
BibTeX entry: (Update)
@misc{ lagarias-cube,
author = "Jeffrey C. Lagarias and Peter W. Shor",
title = "Cube Tilings of Rn and Nonlinear Codes",
url = "citeseer.ist.psu.edu/100746.html" }
Citations (may not include all citations):4 A combinatorial approach for Keller's conjecture (context) - Corradi, Szabo - 1990
1 ber einfache und mehrfache Bedeckung des n-dimensionalen Rau.. (context) - Hajos - 1942
1 Sur la factorisation des groupes abelians (context) - Hajos
Documents on the same site (http://www.research.att.com/~shor/papers/): More
Elementary Gates for Quantum Computation - Barenco, Bennett, Cleve, Di.. (1995) (Correct)
Algorithms for Quantum Computation: Discrete Logarithms and.. - Shor (1994) (Correct)
Fault-Tolerant Quantum Computation - Shor (1996) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC