Packing superballs from codes and algebraic curves
type: Item
instance of: scholarly article
title: Packing superballs from codes and algebraic curves
zbMATH Open document ID: 1156.52011
author: Li Liu
author: Chaoping Xing
publication date: 2008-06-11T00:00:00Z
review text: Superballs in \(\mathbb{R}^n\) with respect to the \(L_{\sigma}\)-distance \(d(x,y)=\left(\sum (x_i-y_i)^\sigma\right)^{1/\sigma}\) are packed by using codes of good parameters (with respect to the Hamming distance) and algebraic curves with many rational points over finite fields. Numerical results are presented to show that the lower bounds on the best possible packings are improved.
Mathematics Subject Classification ID: 52C17
Mathematics Subject Classification ID: 11H31
Mathematics Subject Classification ID: 94B75
zbMATH DE Number: 5286512
zbMATH Keywords: packing
zbMATH Keywords: density
zbMATH Keywords: algebraic curves
zbMATH Keywords: codes
reviewed by: Peter Boyvalenkov
MaRDI profile type: Publication
full work available at URL: s10114-007-1028-3
OpenAlex ID: W2040017473
cites work: Q5611106
cites work: Low-dimensional lattices. VI. Voronoi reduction of three-dimensional lattices
cites work: Q5568974
cites work: Q5595275
cites work: Multiplicative lattices in global fields
cites work: An improvement to the Minkowski‐Hiawka bound for packing superballs
cites work: Number of points of an algebraic curve
cites work: Q4748267
cites work: Modular curves, Shimura curves, and Goppa codes, better than Varshamov-Gilbert bound
cites work: Rational points on curves over finite fields. Theory and Applications
cites work: A lower bound on packing density
DOI: 10.1007/S10114-007-1028-3
published in: Acta Mathematica Sinica, English Series
description: scientific article; zbMATH DE number 5286512