Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
153 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
45 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Improvement on Asymptotic Density of Packing Families Derived from Multiplicative Lattices (1506.00432v2)

Published 1 Jun 2015 in math.NT, cs.IT, math.AG, math.IT, and math.MG

Abstract: Let $\omega=(-1+\sqrt{-3})/2$. For any lattice $P\subseteq \mathbb{Z}n$, $\mathcal{P}=P+\omega P$ is a subgroup of $\mathcal{O}Kn$, where $\mathcal{O}_K=\mathbb{Z}[\omega]\subseteq \mathbb{C}$. As $\mathbb{C}$ is naturally isomorphic to $\mathbb{R}2$, $\mathcal{P}$ can be regarded as a lattice in $\mathbb{R}{2n}$. Let $P$ be a multiplicative lattice (principal lattice or congruence lattice) introduced by Rosenbloom and Tsfasman. We concatenate a family of special codes with $t{\mathfrak{P}}\ell\cdot(P+\omega P)$, where $t_{\mathfrak{P}}$ is the generator of a prime ideal $\mathfrak{P}$ of $\mathcal{O}_K$. Applying this concatenation to a family of principal lattices, we obtain a new family with asymptotic density exponent $\lambda\geqslant-1.26532182283$, which is better than $-1.87$ given by Rosenbloom and Tsfasman considering only principal lattice families. For a new family based on congruence lattices, the result is $\lambda\geqslant -1.26532181404$, which is better than $-1.39$ by considering only congruence lattice families.

Citations (3)

Summary

We haven't generated a summary for this paper yet.