The poset structures admitting the extended binary Hamming code to be a perfect code (Q704279)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 2127153
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The poset structures admitting the extended binary Hamming code to be a perfect code |
scientific article; zbMATH DE number 2127153 |
Statements
The poset structures admitting the extended binary Hamming code to be a perfect code (English)
0 references
13 January 2005
0 references
The authors characterize the partially ordered sets (posets) \(P\) for which an extended binary Hamming code is a double or triple error-correcting perfect code under the poset metric \(d_{P}\). For the two extended Hamming codes such posets are showed explicitly. These results follow and complete a previous work by \textit{R.A. Brualdi}, \textit{J.S. Graves} and \textit{K.M. Lawrence} in [Discrete Math. 147, 57--72 (1995; Zbl 0854.94019)].
0 references
poset codes
0 references
perfect codes
0 references
extended Hamming codes
0 references
0.94923925
0 references
0.9360583
0 references
0.93136203
0 references
0.92259324
0 references
0.8911923
0 references
0 references
0.87348133
0 references
0.86539924
0 references
0.86361194
0 references
