Inductive construction of perfect ternary constant-weight codes with distance 3 Full article
| Journal |
Problems of Information Transmission
ISSN: 0032-9460 , E-ISSN: 1608-3253 |
||
|---|---|---|---|
| Output data | Year: 2001, Volume: 37, Number: 1, Pages: 1-9 Pages count : 9 DOI: 10.1023/a:1010424208992 | ||
| Authors |
|
||
| Affiliations |
|
Abstract:
We propose inductive constructions of perfect (n,3;n–1)3 codes (ternary constant-weight codes of length n and weight n–1 with distance 3), which are modifications of constructions of perfect binary codes. The construction yields at least 2^{2^{n/2−2}} different perfect (n,3;n–1)3 codes. To perfect (n,3;n–1)3 codes, perfect matchings in a binary hypercube without close (at distance 1 or 2 from each other) parallel edges are equivalent.
Cite:
Krotov D.S.
Inductive construction of perfect ternary constant-weight codes with distance 3
Problems of Information Transmission. 2001. V.37. N1. P.1-9. DOI: 10.1023/a:1010424208992 Scopus OpenAlex
Inductive construction of perfect ternary constant-weight codes with distance 3
Problems of Information Transmission. 2001. V.37. N1. P.1-9. DOI: 10.1023/a:1010424208992 Scopus OpenAlex
Original:
Кротов Д.С.
Индуктивные конструкции совершенных троичных равновесных кодов с расстоянием 3
Проблемы передачи информации. 2001. Т.37. №1. С.3-11.
Индуктивные конструкции совершенных троичных равновесных кодов с расстоянием 3
Проблемы передачи информации. 2001. Т.37. №1. С.3-11.
Dates:
| Submitted: | Mar 2, 2000 |
Identifiers:
| Scopus: | 2-s2.0-0035767729 |
| OpenAlex: | W1486463359 |