Timeline for Perfect sphere packings (as opposed to perfect ball packings)
Current License: CC BY-SA 4.0
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Oct 16, 2020 at 14:22 | vote | accept | Nick Gill | ||
| Oct 1, 2020 at 16:28 | comment | added | Nick Gill | I could potentially weaken the notion of equivalence between codes to allow for the odd- and even-weight codes to be permuted separately, and ask again if all sphere packings are equivalent in this sense... I have no idea yet whether that is a silly question! But thanks again. | |
| Oct 1, 2020 at 16:28 | comment | added | Nick Gill | This looks great, thank you so much. There's plenty to think about here... I wonder if I could do something similar using the construction in the question: split the subspace I gave into odd- and even-weight vectors, and then use the fact that there is a lower bound on minimal distance to permute the odd-weight vectors to come up with a different packing, in particular a non-linear one? I wonder if this would potentially give something equivalent to what you have done? | |
| Oct 1, 2020 at 15:20 | history | edited | LeechLattice | CC BY-SA 4.0 |
added 9 characters in body
|
| Oct 1, 2020 at 15:15 | history | answered | LeechLattice | CC BY-SA 4.0 |