Product Constructions for Perfect Lee Codes

DOI10.1109/TIT.2011.2161133zbMath1365.94509arXiv1103.3933MaRDI QIDQ5272247

Tuvi Etzion

Publication date: 12 July 2017

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Linear codes (general theory) (94B05)

Related Items (12)

A new approach towards the Golomb-Welch conjecture ⋮ Total perfect codes in Cayley graphs ⋮ On linear diameter perfect Lee codes with distance 6 ⋮ Constructions and invariants of optimal codes in the Lee metric ⋮ Partitions into perfect codes in the Hamming and Lee metrics ⋮ A generalization of Lee codes ⋮ On the non-existence of lattice tilings by quasi-crosses ⋮ Lattice-like total perfect codes ⋮ Non-periodic tilings of \({\mathbb{R}}^{n}\) by crosses ⋮ Perfect codes in circulant graphs ⋮ Perfect codes in the discrete simplex ⋮ Rainbow perfect domination in lattice graphs

This page was built for publication: Product Constructions for Perfect Lee Codes