Recent bounds for codes, sphere packings and related problems obtained by linear programming and other methods

DOI10.1090/conm/009/655979zbMath0491.94024OpenAlexW4253170435MaRDI QIDQ3953699

N. J. A. Sloane

Publication date: 1982

Published in: Papers in Algebra, Analysis and Statistics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1090/conm/009/655979

zbMATH Keywords

surveybibliographyconstant weight codeserror-correcting codesspherical codessphere packingspacking problems in two-point homogeneous spaces

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Research exposition (monographs, survey articles) pertaining to information and communication theory (94-02) Packing and covering in (n) dimensions (aspects of discrete geometry) (52C17) Theory of error-correcting codes and error-detecting codes (94B99) Combinatorial aspects of packing and covering (05B40) Bibliographies for mathematics in general (00A15)

Related Items (8)

A lower bound on packing density ⋮ An improvement to the Minkowski‐Hiawka bound for packing superballs ⋮ On the packing densities of superballs and other bodies ⋮ Designs as maximum codes in polynomial metric spaces ⋮ On upper bounds for code distance and covering radius of designs in polynomial metric spaces ⋮ Energy bounds for codes in polynomial metric spaces ⋮ On the sphericity and cubicity of graphs ⋮ Further lattice packings in high dimensions

This page was built for publication: Recent bounds for codes, sphere packings and related problems obtained by linear programming and other methods