Perfect codes in the metric
Authors:
- Antonio CampelloACAntonio Campello
- Grasiele C. JorgeGJGrasiele C. Jorge
- João E. StrapassonJSJoão E. Strapasson
- Sueli I.R. CostaSCSueli I.R. Costa
- 1 April 2016
- journal article
- research article
- Published by Elsevier in European Journal of Combinatorics
- Vol. 53, 72-85
Abstract
No abstract availableAll Related Versions
Funding Information
- FAPESP (2014/20602-8, 2013/25977-7)
- CNPq (312926/2013-8)
This publication has 9 references indexed in Scilit:
- A new approach towards the Golomb–Welch conjectureEuropean Journal of Combinatorics, 2014
- On the non-existence of lattice tilings by quasi-crossesEuropean Journal of Combinatorics, 2014
- Codes and lattices in the lp metric2014
- Diameter Perfect Lee CodesIEEE Transactions on Information Theory, 2012
- Constructive spherical codes near the Shannon boundDesigns, Codes and Cryptography, 2012
- Quasi-Cross Lattice Tilings With Applications to Flash MemoryIEEE Transactions on Information Theory, 2011
- New upper bounds on sphere packings IAnnals of Mathematics, 2003
- An improvement to the Minkowski‐Hiawka bound for packing superballsMathematika, 1987
- Perfect Codes in the Lee Metric and the Packing of PolyominoesSIAM Journal on Applied Mathematics, 1970