The poset structures admitting the extended binary Hamming code to be a perfect code (Q704279): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / DOI | |||
| Property / DOI: 10.1016/j.disc.2004.07.010 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.DISC.2004.07.010 / rank | |||
Normal rank | |||
Latest revision as of 01:14, 10 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The poset structures admitting the extended binary Hamming code to be a perfect code |
scientific article |
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
