The poset structures admitting the extended binary Hamming code to be a perfect code (Q704279): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.disc.2004.07.010 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2067929867 / rank | |||
Normal rank | |||
Revision as of 01:59, 20 March 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
