The partial order of perfect codes associated to a perfect code

Olof Heden

doi:10.3934/amc.2007.1.399

Article Contents

2007, Volume 1, Issue 4: 399-412. Doi: 10.3934/amc.2007.1.399

This issue Previous Article Next Article On the security of generalized Jacobian cryptosystems

The partial order of perfect codes associated to a perfect code

Olof Heden^1,

1.
Department of Mathematics, KTH, Stockholm, Sweden S-100 44

Received: March 2007

Revised: October 2007

Published: November 2007

Abstract Related Papers Cited by

Abstract

It is clarified whether or not ''full rank perfect 1-error correcting binary codes act like primes in the family of all perfect 1-error correcting binary codes''. Thereby the well known connection between perfect 1-error correcting binary codes and tilings will be discussed and used.

Keywords:

Perfect codes,
tiles.

Mathematics Subject Classification: Primary: 94B25.

Citation:

Article Metrics

HTML views() PDF downloads(77) Cited by(0)

The partial order of perfect codes associated to a perfect code

Abstract

Access History

Article Metrics

Access History

Other Articles By Authors

Catalog

The partial order of perfect codes associated to a perfect code

Abstract

Access History

SHARE

Article Metrics

Access History

Other Articles By Authors

Catalog

Export File

Citation

Format

Content