The poset metrics that allow binary codes of codimension m to be m-, (m-1)-, or (m-2)-perfect Научная публикация
| Журнал |
IEEE Transactions on Information Theory
ISSN: 0018-9448 , E-ISSN: 1557-9654 |
||||
|---|---|---|---|---|---|
| Вых. Данные | Год: 2008, Том: 54, Номер: 11, Страницы: 5241-5246 Страниц : 6 DOI: 10.1109/tit.2008.929972 | ||||
| Ключевые слова | perfect codes, poset codes | ||||
| Авторы |
|
||||
| Организации |
|
Реферат:
A binary poset code of codimension m (of cardinality 2^{n-m}, where n is the code length) can correct maximum m errors. All possible poset metrics; that allow codes of codimension m to be m-, (m-1)-, or (m-2)-perfect are described. Some general conditions on a poset which guarantee the nonexistence of perfect poset codes are derived; as examples, we prove the nonexistence of r-perfect poset codes for some r in the case of the crown poset and in the case of the union of disjoint chains.
Библиографическая ссылка:
Kim H.K.
, Krotov D.S.
The poset metrics that allow binary codes of codimension m to be m-, (m-1)-, or (m-2)-perfect
IEEE Transactions on Information Theory. 2008. V.54. N11. P.5241-5246. DOI: 10.1109/tit.2008.929972 WOS Scopus РИНЦ OpenAlex
The poset metrics that allow binary codes of codimension m to be m-, (m-1)-, or (m-2)-perfect
IEEE Transactions on Information Theory. 2008. V.54. N11. P.5241-5246. DOI: 10.1109/tit.2008.929972 WOS Scopus РИНЦ OpenAlex
Даты:
| Поступила в редакцию: | 20 дек. 2007 г. |
| Принята к публикации: | 6 авг. 2008 г. |
| Опубликована online: | 22 окт. 2008 г. |
Идентификаторы БД:
| Web of science: | WOS:000260426400035 |
| Scopus: | 2-s2.0-55349104773 |
| РИНЦ: | 13591718 |
| OpenAlex: | W2950887441 |