Lattice packings of cross‐polytopes from Reed–Solomon codes and Sidon sets

DOI10.1112/blms.12699arXiv2111.03343OpenAlexW4293250626MaRDI QIDQ6051405

Mladen Kovačević

Publication date: 20 September 2023

Published in: Bulletin of the London Mathematical Society (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2111.03343

zbMATH Keywords

packingMinkowski-Hlawka boundpacking construction

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Special sequences and polynomials (11B83) Packing and covering in (n) dimensions (aspects of discrete geometry) (52C17) Lattice packing and covering (number-theoretic aspects) (11H31) Combinatorial aspects of packing and covering (05B40) Relations with coding theory (11H71)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Constructive high-dimensional sphere packings
• A lower bound on packing density
• Theorems in the additive theory of numbers
• On the packing densities of superballs and other bodies
• A complete annotated bibliography of work related to Sidon sequences
• A bound, and a conjecture, on the maximum lattice‐packing density of a superball
• Searching for Primitive Roots in Finite Fields
• Constructive packings of cross polytopes
• Lee-metric BCH codes and their application to constrained and partial-response channels
• On the discrete logarithm problem in finite fields of fixed characteristic
• Codes in the Space of Multisets—Coding for Permutation Channels With Impairments
• Improved Bounds on Sidon Sets via Lattice Packings of Simplices
• Perfect Codes in the Lee Metric and the Packing of Polyominoes
• Discrete logarithms in quasi-polynomial time in finite fields of fixed characteristic
• Introduction to Coding Theory

This page was built for publication: Lattice packings of cross‐polytopes from Reed–Solomon codes and Sidon sets