Dense Packings from Algebraic Number Fields and Codes
June 01, 2015 Β· Declared Dead Β· π Finite Fields Their Appl.
"No code URL or promise found in abstract"
Evidence collected by the PWNC Scanner
Authors
Shantian Cheng
arXiv ID
1506.00419
Category
math.NT
Cross-listed
cs.IT,
math.AC,
math.MG
Citations
1
Venue
Finite Fields Their Appl.
Last Checked
1 month ago
Abstract
We introduce a new method from number fields and codes to construct dense packings in the Euclidean spaces. Via the canonical $\mathbb{Q}$-embedding of arbitrary number field $K$ into $\mathbb{R}^{[K:\mathbb{Q}]}$, both the prime ideal $\mathfrak{p}$ and its residue field $ΞΊ$ can be embedded as discrete subsets in $\mathbb{R}^{[K:\mathbb{Q}]}$. Thus we can concatenate the embedding image of the Cartesian product of $n$ copies of $\mathfrak{p}$ together with the image of a length $n$ code over $ΞΊ$. This concatenation leads to a packing in Euclidean space $\mathbb{R}^{n[K:\mathbb{Q}]}$. Moreover, we extend the single concatenation to multiple concatenation to obtain dense packings and asymptotically good packing families. For instance, with the help of \Magma{}, we construct one $256$-dimension packing denser than the Barnes-Wall lattice BW$_{256}$.
Community Contributions
Found the code? Know the venue? Think something is wrong? Let us know!
π Similar Papers
In the same crypt β math.NT
R.I.P.
π»
Ghosted
R.I.P.
π»
Ghosted
An analogue of Vosper's Theorem for Extension Fields
R.I.P.
π»
Ghosted
Improved torsion point attacks on SIDH variants
R.I.P.
π»
Ghosted
Ramanujan graphs in cryptography
R.I.P.
π»
Ghosted
Locally Recoverable Codes with Availability $t\geq 2$ from Fiber Products of Curves
R.I.P.
π»
Ghosted
Failing to hash into supersingular isogeny graphs
Died the same way β π» Ghosted
R.I.P.
π»
Ghosted
Language Models are Few-Shot Learners
R.I.P.
π»
Ghosted
PyTorch: An Imperative Style, High-Performance Deep Learning Library
R.I.P.
π»
Ghosted
XGBoost: A Scalable Tree Boosting System
R.I.P.
π»
Ghosted